Decomposition in single-machine scheduling

Decomposition in single-machine scheduling

0.00 Avg rating0 Votes
Article ID: iaor19991180
Country: Netherlands
Volume: 83
Issue: 1
Start Page Number: 271
End Page Number: 287
Publication Date: Oct 1998
Journal: Annals of Operations Research
Authors:
Abstract:

This paper discusses the recent research on decomposition techniques in single-machine scheduling. A variety of orderings between adjacent and nonadjacent jobs in an optimal scheduling are presented. A list of decomposition rules is given that enable one to solve large size instances of six single-machine models. A partition technique is also developed to determine the optimal completion times of a general earliness–tardiness model for a given arrangement of jobs.

Reviews

Required fields are marked *. Your email address will not be published.