Scheduling of customised jobs on a single machine under item availability

Gerodimos, A.E., Glass, C.A. and Potts, C.N. (2001) Scheduling of customised jobs on a single machine under item availability. IIE Transactions, 33 (11), 975-984.

Abstract

We study a problem of scheduling customized jobs on a single-machine. Each job requires two operations: one standard and one specific. Standard operations are processed in batches under item availability, and each batch requires a set-up time. Based on structural properties of the optimal solution, we introduce a generic dynamic programming scheme that builds an optimal schedule by alternately inserting blocks of operations of two distinct types. Our approach yields efficient algorithms for the sum of completion times problem with agreeable processing times and the maximum lateness problem. The number of late jobs problem is shown to be NP-hard in the ordinary sense, but is pseudo-polynomially solvable. A polynomial algorithm is also given for a special case of this problem. Our results indicate the differences between this problem and its counterpart under batch availability.

This record has no associated files available for download.

Contributors

Download statistics