Single machine batch scheduling with sequential job processing

Single machine batch scheduling with sequential job processing

0.00 Avg rating0 Votes
Article ID: iaor20022272
Country: United States
Volume: 33
Issue: 5
Start Page Number: 413
End Page Number: 420
Publication Date: May 2001
Journal: IIE Transactions
Authors: ,
Keywords: production, programming: dynamic
Abstract:

The problem of scheduling n jobs on a single machine in batches to minimize some regular cost functions is studied. Jobs within each batch are processed sequentially so that the processing time of a batch is equal to the sum of the processing times of the jobs contained in it. Jobs in the same batch are completed at the same time when the last job of the batch has finished its processing. A constant set-up time precedes the processing of each batch. The number of jobs in each batch is bounded by some value b. If b < n, then the problem is called bounded. Otherwise, it is unbounded. For both the bounded and unbounded problems, dynamic programming algorithms are presented for minimizing the maximum lateness, the number of late jobs, the total tardiness, the total weighted completion time, and the total weighted tardiness when all due dates are equal, which are polynomial if there is a fixed number of distinct due dates or processing times. More efficient algorithms are derived for some special cases of both the bounded and unbounded problems in which all due dates and/or processing times are equal. Several special cases of the bounded problem are shown to be NP-hard. Thus, a comprehensive classification of the computational complexities of the special cases is provided.

Reviews

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