Abstract
We investigate the problem of scheduling a collection of products according to a restricted set of feasible lot sizes on one machine in the presence of changeover costs and upper bounds on inventory. The restricted sizes of the different lots may only be drawn from a set of given integers. We determine the borderline between easy and hard problems and present polynomial algorithms.
Zusammenfassung
Wir untersuchen das Problem der optimalen Losgröße bezogen auf Umrüstkosten unter Berücksichtigung nur einer Produktionseinheit. Es sind nur ganzzahlige Losgrößen zulässig. Komplexitätsanalyse und polynomiale Verfahren werden präsentiert.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baker, K.R., Dixon, P.S., Magazine, M.J., Silver, E.A. 1978. An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints. Man. Sci. 24, 1710–1720.
Bitran, G.R., Yanasse, H.H. 1982. Computational Complexity of the Capacitated Lot Size Problem. Man. Sci. 28, 1174–1186.
Bruno, J., Downey, P. 1978. Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs. SIAM J. Comput. 7, 393–404.
Driscoll, W.C., Emmons, H. 1977. Scheduling Production on One Machine with Changeover Costs. AIIE Transact. 9, 388–395.
Florian, M., Lenstra, J.K., Rinnooy Kan, A.H.G. 1980. Deterministic Production Planning: Algorithms and Complexity. Man. Sci. 26, 669–679.
Gascon, A., Leachman, R.C. 1988. A Dynamic Programming Solution to the Dynamic, Multi-Item, Single-Machine, Scheduling Problem. Opns. Res. 36, 50–56.
Glassey, C.R. 1968. Minimum Changeover Scheduling of Several Products on One Machine. Opns. Res. 16, 342–352.
Hu, T.C., Kuo, Y.S., Ruskey, F. 1987. Some Optimum Algorithms for Scheduling Problems with Changeover Costs. Opns. Res. 35, 94–99.
Love, S. 1973. Bounded Production and Inventory Models with Piecewise Concave Costs. Man. Sci. 20, 313–318.
Mitsumori, S. 1972. Optimal Production Scheduling of Multicommodity in Flow Line. IEEE Trans. Systems, Man and Cyb. CMC-2, 486–493.
Pattloch, M. 1989. Rüstkostenoptimale Losgrößen bei einstufiger Fertigung. Tech. Univ. Berlin.
Schrage, L. 1982. The Multiproduct Lot Scheduling Problem, in: Dempster, M.A.H., Lenstra, J.K., Rinnooy Kan, A.H.G (eds.). Deterministic and Stochastic Scheduling, Reidel
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Schmidt, G., Pattloch, M. (1992). Minimizing Changeover Costs: The One Machine Case. In: Bühler, W., Feichtinger, G., Hartl, R.F., Radermacher, F.J., Stähly, P. (eds) Papers of the 19th Annual Meeting / Vorträge der 19. Jahrestagung. Operations Research Proceedings, vol 1990. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-77254-2_48
Download citation
DOI: https://doi.org/10.1007/978-3-642-77254-2_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55081-5
Online ISBN: 978-3-642-77254-2
eBook Packages: Springer Book Archive