Advertisement

Introduction

  • Ravi Ramya
  • Chandrasekharan Rajendran
  • Hans Ziegler
  • Sanjay Mohapatra
  • K. Ganesh
Chapter

Abstract

In the initial phase of research in the fields of Operations Research and Management Science, researchers carried out their work on production planning under the assumption that demand was deterministic and time varying (dynamic). In due course, research on production planning evolved with the development of Harris’s EOQ (Economic Order Quantity) formula, Wilsons’s (Q,r) model, and the dynamic lot sizing model proposed by Wagner and Whitin. Harris (1913) was the first to publish the work in the lot sizing area entitled, (published as Harris (1990)). The EOQ was also known as Wilson’s lot size formula as it was used in practice by Wilson (Wilson 1934). Wagner and Whitin developed the dynamic lot sizing problem in 1958 (Wagner and Whitin 1958). Since then, researchers deal with various types of lot sizing problems for different applications (also see Manne (1958)).

References

  1. Aggarwal, A., and J. K. Park. 1993. Improved algorithms for economic lot size problems. Operations research 41(3): 549–571.Google Scholar
  2. Almada-Lobo, B., and R. J. James. 2010. Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups. International Journal of Production Research 48(3): 861–878.CrossRefGoogle Scholar
  3. Almada-Lobo, B., D. Klabjan, M. Antónia carravilla, and J. F. Oliveira. 2007. Single machine multi-product capacitated lot sizing with sequence-dependent setups. International Journal of Production Research 45(20): 4873–4894.CrossRefGoogle Scholar
  4. Bahl, H. C. 1983. Column generation based heuristic algorithm for multi-item scheduling. AIIE Transactions 15(2): 136–141.Google Scholar
  5. Bahl, H. C., L. P. Ritzman, and J. N. Gupta. 1987. Or practice—determining lot sizes and resource requirements: A review. Operations Research 35(3): 329–345.Google Scholar
  6. Belo-Filho, M. A., F. M. Toledo, and B. Almada-Lobo. 2013. Models for capacitated lot-sizing problem with backlogging, setup carryover and crossover. Journal of the Operational Research Society 65(11): 1735–1747.CrossRefGoogle Scholar
  7. Belvaux, G. and L. A. Wolsey. 2001. Modelling practical lot-sizing problems as mixed-integer programs. Management Science 47(7): 993–1007.Google Scholar
  8. Bilde, O. and J. Krarup. 1977. Sharp lower bounds and efficient algorithms for the simple plant location problem. Annals of Discrete Mathematics 1: 79–97.Google Scholar
  9. Billington, P. J., J. O. McClain, and L. J. Thomas. 1983. Mathematical programming approaches to capacity-constrained mrp systems: review, formulation and problem reduction. Management Science 29(10): 1126–1141.Google Scholar
  10. Bitran, G. R., T. L. Magnanti, and H. H. Yanasse. 1984. Approximation methods for the uncapacitated dynamic lot size problem. Management Science 30(9): 1121–1140.Google Scholar
  11. Bitran, G. R. and H. H. Yanasse. 1982. Computational complexity of the capacitated lot size problem. Management Science 28(10): 1174–1186.CrossRefGoogle Scholar
  12. Briskorn, D. 2006. A note on capacitated lot sizing with setup carry over. IIE Transactions 38(11): 1045–1047.Google Scholar
  13. Brown, G., J. Keegan, B. Vigus, and K. Wood. 2001. The kellogg company optimizes production, inventory, and distribution. Interfaces 31(6): 1–15.Google Scholar
  14. Caserta, M., A. Ramirez, and S. Voß. 2010. A math-heuristic for the multi-level capacitated lot sizing problem with carryover. Applications of evolutionary computation, 462–471. Springer.Google Scholar
  15. Caserta, M., A. Ramirez, S. Voß, and R. Moreno. 2009. A hybrid algorithm for the multi level capacitated lot sizing problem with setup carry-over. Logistik management, 123–138. Springer.Google Scholar
  16. Caserta, M. and S. Voß. 2013. A mip-based framework and its application on a lot sizing problem with setup carryover. Journal of Heuristics 19(2): 295–316.CrossRefGoogle Scholar
  17. Clark, A., M. Mahdieh, and S. Rangel. 2014. Production lot sizing and scheduling with non-triangular sequence-dependent setup times. International Journal of Production Research 52(8): 2490–2503.CrossRefGoogle Scholar
  18. Clark, A. R. and S. J. Clark. 2000. Rolling-horizon lot-sizing when set-up times are sequence-dependent. International Journal of Production Research 38(10): 2287–2307.CrossRefGoogle Scholar
  19. Diaby, M., H. C. Bahl, M. H. Karwan, and S. Zionts. 1992. A lagrangean relaxation approach for very-large-scale capacitated lot-sizing. Management Science 38(9): 1329–1340.Google Scholar
  20. Dillenberger, C., L. F. Escudero, A. Wollensak, and W. Zhang. 1993. On solving a large-scale resource allocation problem in production planning. Operations research in production planning and control, 105–119. Springer.Google Scholar
  21. Dillenberger, C., L. F. Escudero, A. Wollensak, and W. Zhang. 1994. On practical resource allocation for production planning and scheduling with period overlapping setups. European Journal of Operational Research 75(2): 275–286.Google Scholar
  22. Dogramaci, A., J. C. Panayiotopoulos, and N. R. Adam. 1981. The dynamic lot-sizing problem for multiple items under limited capacity. AIIE Transactions 13(4): 294–303.Google Scholar
  23. Drexl, A. and K. Haase. 1995. Proportional lotsizing and scheduling. International Journal of Production Economics 40(1): 73–87.Google Scholar
  24. Eisenhut, P. 1975. A dynamic lot sizing algorithm with capacity constraints. AIIE Transactions 7(2): 170–176.Google Scholar
  25. Elmaghraby, S. E. 1978. The economic lot scheduling problem (elsp): review and extensions. Management Science 24(6): 587–598.Google Scholar
  26. Eppen, G. D., F. Gould, and B. P. Pashigian. 1969. Extensions of the planning horizon theorem in the dynamic lot size model. Management Science 15(5): 268–277.Google Scholar
  27. Eppen, G. D. and R. K. Martin. 1987. Solving multi-item capacitated lot-sizing problems using variable redefinition. Operations Research 35(6): 832–848.Google Scholar
  28. Eren, T. and E. Güner. 2006. A bicriteria scheduling with sequence-dependent setup times. Applied Mathematics and Computation 179(1): 378–385.CrossRefGoogle Scholar
  29. Federgruen, A. and M. Tzur. 1991. A simple forward algorithm to solve general dynamic lot sizing models with n periods in 0 (n log n) or 0 (n) time. Management Science 37(8): 909–925.Google Scholar
  30. Fleischmann, B. 1990. The discrete lot-sizing and scheduling problem. European Journal of Operational Research 44(3): 337–348.Google Scholar
  31. Florian, M., J. K. Lenstra, and A. Rinnooy Kan. 1980. Deterministic production planning: Algorithms and complexity. Management science 26(7): 669–679.Google Scholar
  32. Gao, Y. 2000. A heuristic procedure for the capacitated lot sizing problem with set-up carry-over. Control Theory and Applications 17(6): 937–940.Google Scholar
  33. Gopalakrishnan, M. 2000. A modified framework for modelling set-up carryover in the capacitated lotsizing problem. International Journal of Production Research 38(14): 3421–3424.CrossRefGoogle Scholar
  34. Gopalakrishnan, M., K. Ding, J.-M. Bourjolly, and S. Mohan. 2001. A tabu-search heuristic for the capacitated lot-sizing problem with set-up carryover. Management Science 47(6): 851–863.CrossRefGoogle Scholar
  35. Gopalakrishnan, M., D. Miller, and C. Schmidt. 1995. A framework for modelling setup carryover in the capacitated lot sizing problem. International Journal of Production Research 33(7): 1973–1988.CrossRefGoogle Scholar
  36. Goren, H. G., S. Tunali, and R. Jans. 2012. A hybrid approach for the capacitated lot sizing problem with setup carryover. International Journal of Production Research 50(6): 1582–1597.CrossRefGoogle Scholar
  37. Grünert, T. 1998. Multi-level sequence dependent dynamic lotsizing and scheduling. Shaker Verlag.Google Scholar
  38. Guimarães, L., D. Klabjan, and B. Almada-Lobo. 2014. Modeling lotsizing and scheduling problems with sequence dependent setups. European Journal of Operational Research 239(3): 644–662.CrossRefGoogle Scholar
  39. Haase, K. 1996. Capacitated lot-sizing with sequence dependent setup costs. Operations-Research-Spektrum 18(1): 51–59.CrossRefGoogle Scholar
  40. Haase, K. 1998. Capacitated lot-sizing with linked production quantities of adjacent periods. Springer.Google Scholar
  41. Haase, K. and A. Drexl. 1994. Capacitated lot-sizing with linked production quantities of adjacent periods. Operations Research’93, 212–215. Springer.Google Scholar
  42. Haase, K. and A. Kimms. 2000. Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities. International Journal of Production Economics 66(2): 159–169.CrossRefGoogle Scholar
  43. Harris, F. W. 1990. How many parts to make at once. Operations Research 38(6): 947–950.Google Scholar
  44. Hung, Y.-F. and K.-L. Chien. 2000. A multi-class multi-level capacitated lot sizing model. Journal of the Operational Research Society 51(11): 1309–1318.Google Scholar
  45. James, R. J. and B. Almada-Lobo. 2011. Single and parallel machine capacitated lotsizing and scheduling: New iterative mip-based neighborhood search heuristics. Computers & Operations Research 38(12): 1816–1825.Google Scholar
  46. Kang, S., K. Malik, and L. J. Thomas. 1999. Lotsizing and scheduling on parallel machines with sequence-dependent setup costs. Management Science 45(2): 273–289.CrossRefGoogle Scholar
  47. Karimi, B., S. Ghomi, and J. Wilson. 2006. A tabu search heuristic for solving the clsp with backlogging and set-up carry-over. Journal of the Operational Research Society 57(2): 140–147.CrossRefGoogle Scholar
  48. Karimi, B., S. F. Ghomi, and J. Wilson. 2003. The capacitated lot sizing problem: a review of models and algorithms. Omega 31(5): 365–378.Google Scholar
  49. Karmarkar, U. S. and L. Schrage. 1985. The deterministic dynamic product cycling problem. Operations Research 33(2): 326–345.Google Scholar
  50. Katok, E., H. S. Lewis, and T. P. Harrison. 1998. Lot sizing in general assembly systems with setup costs, setup times, and multiple constrained resources. Management Science 44(6): 859–877.Google Scholar
  51. Kimms, A. 1997. Multi-level lot sizing and scheduling. Heidelberg: Physica-Verlag.Google Scholar
  52. Kimms, A. and A. Drexl. 1998. Proportional lot sizing and scheduling: Some extensions. Networks 32(2): 85–101.Google Scholar
  53. Kovács, A., K. N. Brown, and S. A. Tarim. 2009. An efficient mip model for the capacitated lot-sizing and scheduling problem with sequence-dependent setups. International Journal of Production Economics 118(1): 282–291.CrossRefGoogle Scholar
  54. Kreipl, S. and M. Pinedo. 2004. Planning and scheduling in supply chains: an overview of issues in practice. Production and Operations management 13(1): 77–92.Google Scholar
  55. Kwak, I.-S. and I.-J. Jeong. 2011. A hierarchical approach for the capacitated lot-sizing and scheduling problem with a special structure of sequence-dependent setups. International Journal of Production Research 49(24): 7425–7439.CrossRefGoogle Scholar
  56. Lambrecht, M. and H. Vanderveken. 1979. Heuristic procedures for the single operation, multi-item loading problem. AIIE Transactions 11(4): 319–326.Google Scholar
  57. Lang, J. C. and Z.-J. M. Shen. 2011. Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions. European Journal of Operational Research 214(3): 595–605.CrossRefGoogle Scholar
  58. Maes, J., J. O. McClain, and L. N. van Wassenhove. 1991. Multilevel capacitated lotsizing complexity and lp-based heuristics. European Journal of Operational Research 53(2): 131–148.Google Scholar
  59. Magnanti, T. L. and R. Vachani. 1990. A strong cutting plane algorithm for production scheduling with changeover costs. Operations Research 38(3): 456–473.Google Scholar
  60. Magnusson, T. 2001. The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times. Ph.D. thesis, University of Minnesota.Google Scholar
  61. Manne, A. S. 1958. Programming of economic lot sizes. Management Science 4(2): 115–135.Google Scholar
  62. Millar, H. H. and M. Yang. 1993. An application of lagrangean decomposition to the capacitated multi-item lot sizing problem. Computers & Operations Research 20(4): 409–420.Google Scholar
  63. Millar, H. H. and M. Yang. 1994. Lagrangian heuristics for the capacitated multi-item lot-sizing problem with backordering. International Journal of Production Economics 34(1): 1–15.Google Scholar
  64. Mohammadi, M., S. F. Ghomi, B. Karimi, and S. A. Torabi. 2010. Rolling-horizon and fix-and-relax heuristics for the multi-product multi-level capacitated lotsizing problem with sequence-dependent setups. Journal of Intelligent Manufacturing 21(4): 501–510.CrossRefGoogle Scholar
  65. Mohan, S., M. Gopalakrishnan, R. Marathe, and A. Rajan. 2012. A note on modelling the capacitated lot-sizing problem with set-up carryover and set-up splitting. International Journal of Production Research 50(19): 5538–5543.CrossRefGoogle Scholar
  66. Mohapatra, S. 2015b. Requirement management – controlling quality at the upstream in commercial software project management. International Journal of Applied Engineering Research 10(3): 8203–8219.Google Scholar
  67. Mohapatra, S. 2015c. Using integrated information system for patient benefits, a case study in India. International Journal of Healthcare Management 8(4): 262–271.Google Scholar
  68. Mohapatra, S. 2017. An empirical study for finding factors that would optimise productivity and quality in IT business. International Journal of Productivity and Quality Management 20(2): 169–196.Google Scholar
  69. Mohapatra, S. and J. Anuj. 2010. Green IT framework for small and medium scale Indian IT services companies. International Journal of Green Economics 4(3): 65–82.Google Scholar
  70. Mohapatra, S. and S. Murarka. 2016. Improving patient care in hospital in India by monitoring influential parameters. International Journal of Healthcare Management 9(2): 83–101. http://www.tandfonline.com/doi/full/10.1080/20479700.2015.1101938#abstract.Google Scholar
  71. Mohapatra, S. and R. Rajeev. 2012. Moving to products: entrepreneurial IT firms in India. International Journal of Project Organization and Management 4(1): 34–62.Google Scholar
  72. Mohapatra, S., L. Sabharwal, and A. Sud Shabrwal. 2013. Bridge – the missing link. Asian Case Research Journal 17(1).Google Scholar
  73. Nascimento, M. C. and F. Toledo. 2008. A hybrid heuristic for the multi-plant capacitated lot sizing problem with setup carry-over. Journal of the Brazilian Computer Society 14(4): 7–15.CrossRefGoogle Scholar
  74. Özdamar, L. and G. Barbarosoğlu. 1999. Hybrid heuristics for the multi-stage capacitated lot sizing and loading problem. Journal of the Operational Research Society 50(8): 810–825.Google Scholar
  75. Özdamar, L. and Ş. İ. Birbil. 1998. Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions. European Journal of Operational Research 110(3): 525–547.Google Scholar
  76. Özdamar, L. and M. A. Bozyel. 2000. The capacitated lot sizing problem with overtime decisions and setup times. IIE Transactions 32(11): 1043–1057.Google Scholar
  77. Oztürk, C. and A. Ornek. 2010. Capacitated lot sizing with linked lots for general product structures in job shops. Computers & Industrial Engineering 58(1): 151–164.Google Scholar
  78. Pochet, Y. and L. A. Wolsey. 1988. Lot-size models with backlogging: Strong reformulations and cutting planes. Mathematical Programming 40(1–3): 317–335.Google Scholar
  79. Pochet, Y. and L. A. Wolsey. 2006. Production planning by mixed integer programming. Springer Science & Business Media.Google Scholar
  80. Porkka, P., A. Vepsäläinen, and M. Kuula. 2003. Multiperiod production planning carrying over set-up time. International Journal of Production Research 41(6): 1133–1148.Google Scholar
  81. Potts, C. N. and L. van Wassenhove. 1992. Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity. Journal of the Operational Research Society 395–406.Google Scholar
  82. Quadt, D. and H. Kuhn. 2003. Production planning in semiconductor assembly. Proceedings of the Fourth Aegean International Conference on Analysis of Manufacturing Systems.Google Scholar
  83. Quadt, D. and H. Kuhn. 2009. Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over. Naval Research Logistics (NRL) 56(4): 366–384.Google Scholar
  84. Ramya, R., C. Rajendran, and H. Ziegler. 2016. Capacitated lot-sizing problem with production carry-over and set-up splitting: mathematical models. International Journal of Production Research 54(8): 2332–2344.CrossRefGoogle Scholar
  85. Rardin, R. L. and L. A. Wolsey. 1993. Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems. European Journal of Operational Research 71(1): 95–109.Google Scholar
  86. Sahling, F., L. Buschkühl, H. Tempelmeier, and S. Helber. 2009. Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic. Computers & Operations Research 36(9): 2546–2553.CrossRefGoogle Scholar
  87. Salomon, M., L. G. Kroon, R. Kuik, and L. N. van Wassenhove. 1991. Some extensions of the discrete lotsizing and scheduling problem. Management Science 37(7): 801–812.Google Scholar
  88. Sarkar, S., S. Mohapatra, and J. Sundarakrishnan. 2017. Assessing impact of technology based digital equalizer programme on improving student learning outcomes. Education and Information Technologies 22(1): 195–213.Google Scholar
  89. Selen, W. and R. Heuts. 1990. Operational production planning in a chemical manufacturing environment. European Journal of Operational Research 45(1): 38–46.Google Scholar
  90. Shim, I.-S., H.-C. Kim, H.-H. Doh, and D.-H. Lee. 2011. A two-stage heuristic for single machine capacitated lot-sizing and scheduling with sequence-dependent setup costs. Computers & Industrial Engineering 61(4): 920–929.CrossRefGoogle Scholar
  91. Silver, E. A. and H. Meal. 1973. A heuristic for selecting lot size quantities for the case of a deterministic time-varying demand rate and discrete opportunities for replenishment. Production and Inventory Management 14(2): 64–74.Google Scholar
  92. Smith-Daniels, V. and L. P. Ritzman. 1988. A model for lot sizing and sequencing in process industries. The International Journal of Production Research 26(4): 647–674.Google Scholar
  93. Smith-Daniels, V. L. and D. E. Smith-Daniels. 1986. A mixed integer programming model for lot sizing and sequencing packaging lines in the process industries. IIE Transactions 18(3): 278–285.Google Scholar
  94. Sox, C. R. and Y. Gao 1999. The capacitated lot sizing problem with setup carry-over. IIE Transactions 31(2): 173–181.Google Scholar
  95. Stadtler, H. 1996. Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing. European Journal of Operational Research 94(3): 561–581.Google Scholar
  96. Stadtler, H. 1997. Reformulations of the shortest route model for dynamic multi-item multi-level capacitated lotsizing. Operations-Research-Spektrum 19(2): 87–96.Google Scholar
  97. Stadtler, H. 2000. Improved rolling schedules for the dynamic single-level lot-sizing problem. Management Science 46(2): 318–326.Google Scholar
  98. Stadtler, H. 2005. Supply chain management and advanced planning—-basics, overview and challenges. European journal of operational research 163(3): 575–588.Google Scholar
  99. Stadtler, H. and C. Kilger. 2002. Supply chain management and advanced planning.Google Scholar
  100. Suerie, C. 2006. Time continuity in discrete time models: New approaches for production planning in process industries. Springer Science & Business Media.Google Scholar
  101. Suerie, C. and H. Stadtler. 2003. The capacitated lot-sizing problem with linked lot sizes. Management Science 49(8): 1039–1054.CrossRefGoogle Scholar
  102. Sung, C. and C. T. Maravelias. 2008. A mixed-integer programming formulation for the general capacitated lot-sizing problem. Computers & Chemical Engineering 32(1): 244–259.CrossRefGoogle Scholar
  103. Tempelmeier, H. and L. Buschkühl. 2009. A heuristic for the dynamic multi-level capacitated lotsizing problem with linked lotsizes for general product structures. OR Spectrum 31(2): 385–404.Google Scholar
  104. Tempelmeier, H. and M. Derstroff. 1996. A lagrangean-based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times. Management Science 42(5): 738–757.Google Scholar
  105. Tempelmeier, H. and S. Helber. 1994. A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures. European Journal of Operational Research 75(2): 296–311.Google Scholar
  106. Thizy, J. and L. N. van Wassenhove. 1985. Lagrangean relaxation for the multi-item capacitated lot-sizing problem: A heuristic implementation. IIE Transactions 17(4): 308–313.Google Scholar
  107. Timpe, C. 2002. Solving planning and scheduling problems with combined integer and constraint programming. OR Spectrum 24(4): 431–448.CrossRefGoogle Scholar
  108. Trigeiro, W. W., L. J. Thomas, and J. O. McClain. 1989. Capacitated lot sizing with setup times. Management science 35(3): 353–366.Google Scholar
  109. Wagelmans, A., S. van Hoesel, and A. Kolen. 1992. Economic lot sizing: an o (n log n) algorithm that runs in linear time in the wagner-whitin case. Operations Research 40(Supplement 1: Optimization): S145–S156.Google Scholar
  110. Wagner, H. M. and T. M. Whitin. 1958. Dynamic version of the economic lot size model. Management Science 5(1): 89–96.CrossRefGoogle Scholar
  111. Wilson, R. 1934. A scientific routine for stock control. Harvard Business Review 13(1): 116–128.Google Scholar
  112. Wolsey, L. 1989. Strong formulations for mixed integer programming: a survey. Mathematical Programming 45(1): 173–191.Google Scholar
  113. Wolsey, L. A. 1995. Progress with single-item lot-sizing. European Journal of Operational Research 86(3): 395–401.Google Scholar
  114. Wu, T., K. Akartunalı, J. Song, and L. Shi. 2013. Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms. Discrete Event Dynamic Systems 23(2): 211–239.CrossRefGoogle Scholar
  115. Wu, T. and L. Shi. 2011. Mathematical models for capacitated multi-level production planning problems with linked lot sizes. International Journal of Production Research 49(20): 6227–6247.Google Scholar
  116. Zabel, E. 1964. Some generalizations of an inventory planning horizon theorem. Management Science 10(3): 465–471.Google Scholar
  117. Zangwill, W. I. 1966. A deterministic multi-period production scheduling model with backlogging. Management Science 13(1): 105–119.Google Scholar
  118. Zangwill, W. I. 1969. A backlogging model and a multi-echelon model of a dynamic economic lot size production system-a network approach. Management Science 15(9): 506–527.Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Ravi Ramya
    • 1
  • Chandrasekharan Rajendran
    • 1
  • Hans Ziegler
    • 2
  • Sanjay Mohapatra
    • 3
  • K. Ganesh
    • 4
  1. 1.Department of Management StudiesIndian Institute of Technology MadrasChennai, TNIndia
  2. 2.Chair of Production and LogisticsUniversitát PassauPassauGermany
  3. 3.Xavier Institute of ManagementBhubaneswarIndia
  4. 4.SCM Center of Competence, McKinsey Knowledge CenterMcKinsey & CompanyChennai, TNIndia

Personalised recommendations