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.
Similar content being viewed by others
References
Baker, K.R. (1988) Scheduling the production of components at a common facility. IIE Transactions, 20, 32-35.
Coffman, Jr, E.G., Nozari, A. and Yannakakis, M. (1989) Optimal scheduling of products with two subassemblies on a single machine. Operations Research, 37, 426-436.
Coffman, Jr, E.G., Yannakakis, M., Magazine, M.J. and Santos, C. (1990) Batch sizing and job sequencing on a single machine. Annals of Operations Research, 26, 135-147.
Gerodimos, A.E., Glass, C.A. and Potts, C.N. (2000) Scheduling the production of two-operation jobs on a single machine. European Journal of Operational Research, 120, 250-259.
Gerodimos, A.E., Glass, C.A., Potts, C.N. and Tautenhahn, T. (1999) Scheduling multi-operation jobs on a single machine. Annals of Operations Research, 92, 87-105.
Gupta, S.K. and Kyparisis, J. (1987) Single machine scheduling research. Omega, 15, 207-227.
Julien, F.M. and Magazine, M.J. (1990) Scheduling customer orders: an alternative production scheduling approach. Journal of Manufacturing and Operations Management, 3, 177-199.
Moore, M.J. (1968) An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science, 15, 102-109.
Van Hoesel, S., Wagelmans, A. and Moerman, B. (1994) Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions. European Journal of Operational Research, 75, 312-331.
Vickson, R.G., Magazine, M.J. and Santos, C.A. (1993) Batching and sequencing of components at a single facility. IIE Transactions, 25, 65-70.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Gerodimos, A., Glass, C. & Potts, C. Scheduling of Customized Jobs on a Single Machine under Item Availability. IIE Transactions 33, 975–984 (2001). https://doi.org/10.1023/A:1010930216679
Issue Date:
DOI: https://doi.org/10.1023/A:1010930216679