Advertisement

Capacitated Lot Sizing Problem with Production Carryover and Setup Crossover Across Periods Assuming Sequence-Dependent Setup Times and Setup Costs (CLSP-SD-PCSC): Mathematical Models for Process Industries

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

Abstract

In Chaps. 3 and 4, mathematical models have been proposed for the capacitated lot sizing problem with production carryover and setup crossover across periods. Heuristics based on both the mathematical models have also been proposed. The models and heuristics address real-life situations in process industries such as production immediately after setup and uninterrupted production carryover across periods.

References

  1. Abdelmaguid, T. F. 2015. A neighborhood search function for flexible job shop scheduling with separable sequence-dependent setup times. Applied Mathematics and Computation 260(1): 188–203.CrossRefGoogle 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. 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
  5. 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
  6. 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
  7. 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
  8. 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
  9. Haase, K. 1996. Capacitated lot-sizing with sequence dependent setup costs. Operations-Research-Spektrum 18(1): 51–59.CrossRefGoogle Scholar
  10. 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
  11. Jeong, B. and Y.-D. Kim. 2014. Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times. Computers & Operations Research 47: 72–80.CrossRefGoogle Scholar
  12. 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
  13. 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
  14. 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
  15. 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
  16. 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
  17. Park, H., Y. Hong, and S. Y. Chang. 2002. An efficient scheduling algorithm for the hot coil making in the steel mini-mill. Production Planning & Control 13(3): 298–306.CrossRefGoogle Scholar
  18. 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
  19. 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
  20. Timpe, C. 2002. Solving planning and scheduling problems with combined integer and constraint programming. OR Spectrum 24(4): 431–448.CrossRefGoogle 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