Integrated model for production planning and scheduling in a supply chain using benchmarked genetic algorithm

  • Haejoong Kim
  • Han-Il Jeong
  • Jinwoo Park


Production planning and scheduling is one of the core functions in manufacturing systems. Furthermore, this task is drawing even more attention in supply chain environments as problems become harder and more complicated. Most of the traditional approaches to production planning and scheduling have adopted a multi-phased, hierarchical and decompositional approach. This traditional approach does not guarantee a feasible production schedule. And even when capacity constraints are satisfied, it may generate an expensive schedule. In order to overcome the limitations of the traditional approach, several previous studies tried to integrate the production planning and scheduling problems. However, these studies also have some limitations, due to their intrinsic characteristics and the method for incorporating the hierarchical product structure into the scheduling model. In this paper we present a new integrated model for production planning and scheduling for multi-item and multi-level production. Unlike previous lot sizing approaches, detailed scheduling constraints and practical planning criteria are incorporated into our model. We present a mathematical formulation, propose a heuristic solution procedure, and demonstrate the performance of our model by comparing the experimental results with those of a traditional approach and optimal solution.


Production planning and scheduling Supply chain Lot sizing and scheduling Genetic algorithm 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Dauzère-Péres S, Lasserre JB (1994) Integration of lotsizing and scheduling decisions in a job-shop. Eur J Oper Res 75:413–426zbMATHCrossRefGoogle Scholar
  2. 2.
    Vollmann TE, Berry WL, Whybark DC, Jacobs FR (2005) Manufacturing planning and control for supply chain management, 5th edn. McGraw-Hill, New YorkGoogle Scholar
  3. 3.
    Fleishmann B (1990) The discrete lot-sizing and scheduling problem. Eur J Oper Res 44:337–348CrossRefGoogle Scholar
  4. 4.
    Drexl A, Haase K (1995) Proportional lotsizing and scheduling. Int J Prod Econ 40:73–87CrossRefGoogle Scholar
  5. 5.
    Kimms A, Drexl A (1998) Proportional Lot Sizing and Scheduling: Some Extensions. Networks 32:85–101zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Fleischmann B, Meyr H (1997) The general lot sizing and scheduling problem. OR Spektrum 19:11–21zbMATHMathSciNetGoogle Scholar
  7. 7.
    Drexl A, Kimms A (1997) Lot sizing and scheduling — Survey and extensions. Eur J Oper Res 99:221–235zbMATHCrossRefGoogle Scholar
  8. 8.
    Karimi B, Fatemi Ghomi SMT, Wilson JM (2003) The capacitated lot sizing problem: a review of models and algorithms. Omega 31:365–378CrossRefGoogle Scholar
  9. 9.
    Jordan C, Drexl A (1998) Discrete lotsizing and scheduling by batch sequencing. Manage Sci 44:698–713zbMATHGoogle Scholar
  10. 10.
    Fandel G, Stammen-Hegene C (2006) Simultaneous lot sizing and scheduling for multi-product multi-level production. Int J Prod Econ 104:308–316CrossRefGoogle Scholar
  11. 11.
    Lasserre JB (1992) An integrated model for job-shop planning and scheduling. Manage Sci 38:1201–1211zbMATHCrossRefGoogle Scholar
  12. 12.
    Anwar MF, Nagi R (1997) Integrated lot-sizing and scheduling for just-in-time production of complex assemblies with finite set-ups. Int J Prod Res 35:1447–1470zbMATHCrossRefGoogle Scholar
  13. 13.
    Dellaert A, Jeunet J, Jonard N (2000) A genetic algorithm to solve the general multi-level lot-sizing problem with time-varying costs. Int J Prod Econ 68:241–257CrossRefGoogle Scholar
  14. 14.
    Goldberg DE, Lingle R (1985) Alleles, loci and the traveling salesman problem. In: Grefenstette JJ (ed) Proceedings of an International Conference on Genetic Algorithms and Their Applications. Lawrence Erlbaum Associates, Hillsdale, pp 154–159Google Scholar
  15. 15.
    Berretta R, Rodrigues LF (2004) A memetic algorithm for a multistage capacitated lot-sizing problem. Int J Prod Econ 87:87–81CrossRefGoogle Scholar
  16. 16.
    Moscato P (1989) On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms, C3P Report 826. California Institute of Technology, PasadenaGoogle Scholar
  17. 17.
    Collier DA (1981) The measurement and operating benefits of component part commonality. Decis Sci 12:85–96CrossRefGoogle Scholar
  18. 18.
    Kimms A (1997) Multi-level lot-sizing and scheduling methods for capacitated, dynamic, and deterministic models, Physica Verlag Series on Production and LogisticsGoogle Scholar
  19. 19.
    Silver EA, Pyke DF, Peterson R (1998) Inventory management and production planning and scheduling, Wiley, New YorkGoogle Scholar

Copyright information

© Springer-Verlag London Limited 2007

Authors and Affiliations

  1. 1.ASRI(Automation and System Research Institute), Department of Industrial Eng.Seoul National UniversityKwanak-guRepublic of Korea
  2. 2.Department of IT Business EngineeringDaejeon UniversityDong-guRepublic of Korea

Personalised recommendations