Just-in-Time Planning and Lot-Sizing

  • Nabil AbsiEmail author
  • Stéphane Dauzère-Pérès
  • Safia Kedad-Sidhoum
Part of the Springer Optimization and Its Applications book series (SOIA, volume 60)


The goal of this chapter is to show that production planning and lot-sizing models are not contradictory with a Just-In-Time (JIT) approach. Characteristics of these models are discussed to explain how they fit with JIT concepts. We first underline the importance of reducing setup times/costs in both lot-sizing and JIT models. We show that the definition of setup time/cost reduction can be different depending on the problem. We then discuss when demands cannot be delivered at their due dates (backlogs or lost sales). The relevance of time windows in a JIT environment is presented, followed by bounded production and inventory. The importance of capacity constraints and their impact on JIT systems are also discussed. Finally, the last section of the chapter is devoted to the interest of integrating lot-sizing and scheduling in a JIT approach.


Setup Time Capacity Constraint Setup Cost Safety Stock Kanban System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Absi N. and Kedad-Sidhoum S.: The multi-item capacitated lot-sizing problem with setup times and shortage costs. European Jounal of Operational Research 185(3), 1351–1374 (2008)zbMATHCrossRefGoogle Scholar
  2. 2.
    Absi N. and Kedad-Sidhoum S.: The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs. Computers & Operations Research 36(11), 2926–2936 (2009)zbMATHCrossRefGoogle Scholar
  3. 3.
    Absi N., Kedad-Sidhoum S., and Dauzère-Pérès S.: “Uncapacitated lot-sizing problem with production time windows, early productions, backlogs and lost sales”. International Journal of Production Research, 49(9), 2551–2566 (2011)zbMATHCrossRefGoogle Scholar
  4. 4.
    Aggarwal A. and Park J.K.: Improved algorithms for economic lot-size problems. Operations Research 41, 549–571 (1993)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Aksen D., Altinkemer K., and Chand S.: The single-item lot-sizing problem with immediate lost sales. European Journal of Operational Research 147, 558–566 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Aksen D.: Loss of customer goodwill in the uncapacitated lot-sizing term problem. Computers & Operations Research 34(9), 2805–2823 (2007)zbMATHCrossRefGoogle Scholar
  7. 7.
    Allahverdi A. and Soroush H.M.: The significance of reducing setup times/setup costs. European Journal of Operational Research 187, 978–984 (2008)zbMATHCrossRefGoogle Scholar
  8. 8.
    Belvaux G. and Wolsey L.A.: Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs. Management Science 47(7), 993–1007 (2001)zbMATHCrossRefGoogle Scholar
  9. 9.
    Berk E., Toy A.O., and Hazir O.: Single item lot-sizing problem for a warm/cold process with immediate lost sales. European Journal of Operational Research 187, 1251–1267 (2008)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Bitran G., and Yanasse H.H.: Computational complexity of the capacitated lot size problem. Management Science 28, 1174–1186 (1982)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Bonney M.C., Zhang Z., Head M.A., Tien C.C., and Barson R.J.: Are push and pull systems really so different? International Journal of Production Economics 59, 53–64 (1999)CrossRefGoogle Scholar
  12. 12.
    N. Brahimi: Production planning: models and algorithms for lot-sizing problems. PhD Thesis, Ecole des Mines de Nantes, France (2004)Google Scholar
  13. 13.
    N. Brahimi, Najid N.M., Dauzère-Pérès S., and Nordli A.: Single item lot sizing problems. European Journal of Operational Research 168(1), 1–16 (2006)Google Scholar
  14. 14.
    N. Brahimi, Dauzère-Pérès S., and Najid N.: Capacitated multi-item lot-sizing problems with time windows. Operations Research 54(5), 951–967 (2006)Google Scholar
  15. 15.
    Chang J. H. and Chiu J.H.: A comprehensive review of lot streaming. International Journal of Production Research 43(8), 1515–1536 (2005)CrossRefGoogle Scholar
  16. 16.
    Chen W.H. and Thizy J.M.: Analysis of relaxations for the multi-item capacitated lot-sizing problem. Annals of Operations Research 26, 29–72 (1990)zbMATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Christensen W., Germain R. and Birou L.: Build-to-order and just-in-time as predictors of applied supply chain knowledge and market performance. Journal of Operations Management 23, 470–481 (2005)CrossRefGoogle Scholar
  18. 18.
    Dauzère-Pérès S. and Lasserre J.B.: Integration of lotsizing and scheduling decisions in a job-shop. European Journal of Operational Research 75(2), 413–426 (1994)zbMATHCrossRefGoogle Scholar
  19. 19.
    Dauzère-Pérès S. and Lasserre J.B.: On the importance of sequencing decisions in production planning and scheduling. International Transactions in Operational Research 9(6), 779–793 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  20. 20.
    Dauzère-Pérès S., Brahimi N., Najid N. and Nordli A.: The single-item lot sizing problem with time windows. Technical report 02/4/AUTO, Ecole des Mines de Nantes, France (2002)Google Scholar
  21. 21.
    Degraeve Z. and Jans R.: A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times. Operations Research 55(5), 909–920 (2007)zbMATHCrossRefMathSciNetGoogle Scholar
  22. 22.
    Diaby M., Bahl H.C., Karwan M.H., and Zionts S.: A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing. Management Science 38(9), 1329–1340 (1992)zbMATHCrossRefGoogle Scholar
  23. 23.
    Dixon P.S., Elder M.D., Rand G.K., and E.A. Silver: A heuristic algorithm for determining lot sizes of an item subject to regular and overtime production capacities. Journal of Operations Management, 3, 121–130 (1983)Google Scholar
  24. 24.
    Federgruen A. and Tzur M.: A simple forward algorithm to solve general dynamic lot-sizing models with n periods in O(nlogn) or O(n) time. Management Science 37, 909-925 (1991)zbMATHCrossRefGoogle Scholar
  25. 25.
    Florian M., Lenstra J.K., and Rinnoy Kan A.H.G.: Deterministic production planning : algorithms and complexity. Management Science 26, 669–679 (1980)Google Scholar
  26. 26.
    Gutié rrez J., Sedeno-Noda A., Colebrook M. and Sicilia J.: A new characterization for the dynamic lot size problem with bounded inventory. Computers & Operations Research 30, 383–395 (2002)Google Scholar
  27. 27.
    Hwang H.: Dynamic lot-sizing model with production time windows. Naval Research Logistics 54(6), 692–701 (2007)zbMATHCrossRefMathSciNetGoogle Scholar
  28. 28.
    Hwang H. and van den Heuvel W.: Economic Lot-Sizing Problem with Bounded Inventory and Lost-Sales. EI report series (Int. rep. EI 2009-01), Erasmus University Rotterdam (2009)Google Scholar
  29. 29.
    Hsu V.N. and Lowe T.J.: Dynamic economic lot size models with period-pair-dependent backorder and inventory costs. Operations Research 49(2), 316–321 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  30. 30.
    Jaber M.Y., Bonney M., and Moualek I.: Lot sizing with learning, forgetting and entropy cost. International Journal of Production Economics 118, 19–25 (2009)CrossRefGoogle Scholar
  31. 31.
    Lasserre J.B.: An Integrated Model for Job-Shop Planning and Scheduling. Management Science 38(8), 1201–1211 (1992)zbMATHCrossRefGoogle Scholar
  32. 32.
    Lee C.-Y., Cetinkaya S. and Wagelmans A.P.M.: A dynamic lot-sizing model with demand time windows. Management Science 47, 1384–1395 (2001)zbMATHGoogle Scholar
  33. 33.
    Liu T.: Economic lot sizing problem with inventory bounds. European Journal of Operational Research 185, 204–215 (2008)zbMATHCrossRefMathSciNetGoogle Scholar
  34. 34.
    Liu X., Chu F., Chu C., and Wang C.: Lot sizing with bounded inventory and lost sales. International Journal of Production Research 45(24), 5881–5894 (2007)zbMATHCrossRefGoogle Scholar
  35. 35.
    Loparic M., Pochet Y., and Wolsey L.A.: The uncapacitated lot-sizing problem with sales and safety stock. Mathematical Programming 89, 487–504 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  36. 36.
    Love S.F.: Bounded production and inventory models with piecewise concave costs. Management Science 20(3), 313–318 (1973)zbMATHCrossRefMathSciNetGoogle Scholar
  37. 37.
    Luss H. and Rosenwein M.B.: A lot-sizing model for just-in-time manufacturing. Journal of the Operational Research Society 41(3), 201–209 (1990)zbMATHGoogle Scholar
  38. 38.
    Millar H.H. and Yang M.: Lagrangian heuristics for the capacitated multi-item lot-sizing problem with backordering. International Journal of Production Economics 34, 1–15 (1994)CrossRefGoogle Scholar
  39. 39.
    Monden Y.: Toyota Production System. Institute of Industrial Engineers Press, (1983)Google Scholar
  40. 40.
    Özdamar L. and Birbil S.I.: 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 (1998)zbMATHCrossRefGoogle Scholar
  41. 41.
    Özdamar L. and Bozyel M.A.: The capacitated lot sizing problem with overtime decisions and setup times. IIE Transactions, 32(11), 1043–1057 (2000)Google Scholar
  42. 42.
    Pochet Y. and L.A. Wolsey: Production planning by mixed integer programming. Springer, (2006)Google Scholar
  43. 43.
    Riezebos J., Klingenberg W., and Hicks C.: Lean Production and information technology: Connection or contradiction? Computers in Industry 60, 237–247 (2009)CrossRefGoogle Scholar
  44. 44.
    Salomon M. and Kroon Leo G., Kuik R. and van Wassenhove Luk N.: Some Extensions of the Discrete Lotsizing and Scheduling Problem. Management Science 37(7), 801–812 (1991)Google Scholar
  45. 45.
    Sox C.R. and Gao Y.: The capacitated lot sizing problem with setup carry-over. IIE Transactions 31(2), 173–181 (1999)Google Scholar
  46. 46.
    Suerie C. and Stadtler H.: The capacitated lot-sizing problem with linked lot sizes. Management Science 49(8), 1039–1054 (2003)zbMATHCrossRefGoogle Scholar
  47. 47.
    Süral H., Denizel M., and Van Wassenhove L.N.: Lagrangean relaxation based heuristics for lot sizing with setup times. European Journal of Operational Research 194(1), 51–63 (2009)zbMATHCrossRefMathSciNetGoogle Scholar
  48. 48.
    Trigeiro W. and Thomas L.J., and McLain J.O.: Capacitated lot-sizing with setup times. Management Science 35, 353–366 (1989)CrossRefGoogle Scholar
  49. 49.
    van den Heuvel W. and Wagelmans A.P.M.: A holding cost bound for the economic lot-sizing problem with time-invariant cost parameters. Operations Research Letters 37, 102–106 (2009)zbMATHCrossRefMathSciNetGoogle Scholar
  50. 50.
    Van Hoesel S., Kuik R., Salomon M., and Van Wassenhove L.N.: The single item discrete lot-sizing and scheduling problem: Optimization by linear and dynamic programming. Discrete Mathematics 48, 289–303 (1994)zbMATHCrossRefGoogle Scholar
  51. 51.
    Sandbothe R.A. and G.L. Thompson: A forward algorithm for the capacitated lot size model with stockouts. Operations Research 38(3), 474–486 (1990)Google Scholar
  52. 52.
    Sandbothe, R.A. and Thompson G.L.: Decision horizons for the capacitated lot size model with inventory bounds and stockouts. Computers & Operations Research 20(5), 455–465 (1993)zbMATHCrossRefGoogle Scholar
  53. 53.
    White R. E. and Prybutok V.: The relationship between JIT practices and type of production system. Omega 29, 113–124 (2001)CrossRefGoogle Scholar
  54. 54.
    W. van den Heuvel and A.P.M. Wagelmans: Four equivalent lot-sizing models. Operations Research Letters 36(4), 465–470 (2008)zbMATHCrossRefMathSciNetGoogle Scholar
  55. 55.
    Vollmann T.E., Berry W.L., Whybark D.C., and Jacobs F.R.: Manufacturing planning and control systems for supply chain management. McGraw-Hill, (2005)Google Scholar
  56. 56.
    Vörös J.: Lot sizing with quality improvement and setup time reduction. European Journal of Operational Research 113, 568–574 (1999)zbMATHCrossRefGoogle Scholar
  57. 57.
    A. Wagelmans, Van Hoesel S., and Kolen A.: Economic lot sizing: an O(nlogn) that runs in linear time in the Wagner-Whitin case. Operations Research 40(1), S145-S156 (1992)Google Scholar
  58. 58.
    Wagner H.M. and Whitin T.M.: Dynamic version of the economic lot size model. Management Science 5(1), 89–96 (1958)zbMATHCrossRefMathSciNetGoogle Scholar
  59. 59.
    Wolsey L. A.: Lot-sizing with production and delivery time windows. Mathematical Programming 107(3), 471–489 (2006)zbMATHCrossRefMathSciNetGoogle Scholar
  60. 60.
    Yang J. and Deane R. H.: A lotsize reduction model for just-in-time manufacturing systems. Integrated Manufacturing Systems 13(7), 471–488 (2002)CrossRefGoogle Scholar
  61. 61.
    Yavuz M. and Akçali E.: Production smoothing in just-in-time manufacturing systems: a review of the models and solution approaches. International Journal of Production Research 45(16), 3579–3597 (2007)zbMATHCrossRefGoogle Scholar
  62. 62.
    Zangwill W.: A backlogging model and a multi-echelon model of a dynamic economic lot size production system–A network approach. Management Science 15, 506–527 (1969)zbMATHCrossRefMathSciNetGoogle Scholar
  63. 63.
    Zhu X. and Wilhelm W. E. :Scheduling and lot sizing with sequence-dependent setup: A literature review. IIE Transactions 38(11), 987–1007 (2006)CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  • Nabil Absi
    • 1
    Email author
  • Stéphane Dauzère-Pérès
    • 1
  • Safia Kedad-Sidhoum
    • 2
  1. 1.CMP, Ecole des Mines de Saint-ÉtienneGardanneFrance
  2. 2.LIP6, Université Pierre et Marie CurieParis CedexFrance

Personalised recommendations