Abstract
Various production planning problems can be described and solved with Linear Programming (LP) models. In manufacturing applications setup often plays an important role. To solve a setup problem 0–1 variables must be introduced in the model, which leads to an increase in the model size and computational effort. This paper discusses several models to consider setup times in production planning. A decomposition methodology that does not consider the integrality of all 0–1 variables at once, but successively, is outlined. Results for an application in the modeling of the IBM Sindelfingen Multi-layer-ceramics (MLC) Punching area, are discussed.
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
Chand, S., and S. P. Sethi, “A dynamic lot sizing model with learning in setups,” Operations Research 38 ( 1990 ) 644–655.
de Mata, R., “ On solving production scheduling problems with changeover costs using Lagrangean relaxation,” Working paper 89–12–04, The Wharton School, University of Pennsylvania, Philadelphia, 1989.
de Mata, R., and M. Guignard, “ Production scheduling with sequence- independent changeover cost,” ORSA / TIMS meeting, Denver (Colorado), 1988.
Dillenberger, C., L. F. Escudero, A. Wollensak, and W. Zhang, “On Practical Resource Allocation for Production Planning and Scheduling with Different Setup Types,” European Journal of Operational Research submitted ( 1992 ).
Dzielinski, B. P., and R. E. Gomory, “Optimal programming of lot sizes, inventory and lot size allocations,” Management Science 11 ( 1965 ) 874–890.
Escudero, L. F., “An inexact algorithm for part input sequencing and scheduling with side constraints in FMS,” International Journal of Flexible Manufacturing Systems 1 ( 1989 ) 143–174.
Graves, S. C., “Using Lagrangean techniques to solve hierarchical production planning problems,” Management Science 28 ( 1982 ) 260–275.
Graves, S. C., “A tactical planning model for a shop job,” Operations Research 34 ( 1986 ) 522–533.
IBM, Optimization Subroutine Library Guide and Reference, Kingston (NY), 1991. IBM Form SC23-0519
Lozano, S., J. Larraneta, and L. Oniera, “Primal-dual approach to single-level capacitated lot-sizing problem,” European Journal of Operational Research 51 ( 1991 ) 354–366.
Magnanti, T. L., and R. Vachani, “A strong cutting plane algorithm for production scheduling with changeover costs,” Operations Research 38 ( 1990 ) 456–473.
Pocket, Y., and L. A. Wolsey, “Solving multi-item lot sizing problems using strong cutting planes,” Management Science 37 ( 1991 ) 53–67.
Trigeiro, W. W., L. J. Thomas, and J. O. McClain, “Capacitated lot sizing with setup times,” Management Science 35 ( 1989 ) 353–366.
Wolsey, L. A., “Incapacitated lot-sizing problems with start-up costs,” Operations Research 37 ( 1989 ) 741–747.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin· Heidelberg
About this paper
Cite this paper
Dillenberger, C., Escudero, L.F., Wollensak, A., Zhang, W. (1993). On Solving a Large-Scale Resource Allocation Problem in Production Planning. In: Fandel, G., Gulledge, T., Jones, A. (eds) Operations Research in Production Planning and Control. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-78063-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-78063-9_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-78065-3
Online ISBN: 978-3-642-78063-9
eBook Packages: Springer Book Archive