Abstract
Developing an efficient heuristic algorithm to solve a supply chain operations planning model is the main purpose of this paper. The model considers multi period supply chain planning with capacitated resources. The concept of multi period capacity consumption has been developed recently at the context of supply chain management that realizes resource planning at a supply chain. Because of considering setup times and costs, the model contains binary variables. Since the mixed integer model is strongly NP-hard problem and finding a feasible solution is NP-complete, developing an efficient algorithm is remarkable. In this paper a heuristic algorithm is developed to solve this complicated model. Two reasons encouraged the authors to solve this complex problem. First, the model is an advanced and applicable operations planning model at the supply chain environment. Second, this model is strongly NPhard. So it is of important task to develop a solution for the problem to be capable of feasible and efficient.
Please use the following format when citing this chapter Zolfi, H., Ghomi, S. M. T. F., Karimi, B., 2007, in IFIP International Federation for Information Processing, Volume 246, Advances in Production Management Systems, eds. Olhager, J., Pcrsson, F., (Boston: Springer), pp. 69–76.
Chapter PDF
References
Dellaerl, N., Jeunet, J., Jonard, N., 2000. A genetic algorithm to solve the general multi-level lot-sizing problem with time varying costs. International Journal of Production Economics 68, 241–257.
De Kok, A. G., Fransoo, J. C, 2003. Planning supply chain operations: Definition and comparison of planning concepts. Pages 597–675 of: De Kok, A. G., & Graves, S. C, (eds), Handbook in Operations Research and Management Science, Volume 11: Design and Analysis of Supply Chains. Amsterdam.
Katok, E., Lewis, H.S., Harrison, T.P., 1998. Lot sizing in general assembly systems with setup costs, setup limes, and multiple constrained resources. Management Science 44(6), 859–877.
Maes, J., McClain, J.O., Van Wassenhove, L.N., 1991. Multilevel capacitated lot sizing complexity and LP-based heuristics. European Journal of Operational Research 53, 131–148.
Negenman, E. G., 2000. Material coordination under capacity constraints. Ph.D. thesis, Eindhoven University of Technology, Eindhoven, Netherlands.
Spitter, J. M, Hurkens, C. A. J., de Kok, A. G., Lenstra, J. K., Negenman, E. G, 2005. Linear programming models with planned lead times for supply chain operations planning. European Journal of Operational Research 163, 706–720.
Taha, H. A., 1975. Integer Programming, Theory, Applications and Compulations. Academic Press Inc., Florida, USA.
Tempelmeier, H., Derstroff M., 1996. A Lagrangean-based heuristic for dynamic multi-item multi-level constrained lot sizing with setup times. Management Science 42, 738–757.
Voß, S., Woodruff, D. L., 2003. Introduction to Computational Optimization Models for Production Planning in a Supply Chain. Springer, Berlin.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 International Federation for Information Processing
About this paper
Cite this paper
Zolfi, H., Ghomi, S.M.T.F., Karimi, B. (2007). Supply Chain Operations Planning with Setup Times and Multi Period Capacity Consumption. In: Olhager, J., Persson, F. (eds) Advances in Production Management Systems. IFIP — The International Federation for Information Processing, vol 246. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74157-4_9
Download citation
DOI: https://doi.org/10.1007/978-0-387-74157-4_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-74156-7
Online ISBN: 978-0-387-74157-4
eBook Packages: Computer ScienceComputer Science (R0)