Skip to main content
SpringerLink
Log in

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

  • Chapter
  • First Online:
Capacitated Lot Sizing Problems in Process Industries

  • 450 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Eren, T. and E. Güner. 2006. A bicriteria scheduling with sequence-dependent setup times. Applied Mathematics and Computation 179(1): 378–385.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Haase, K. 1996. Capacitated lot-sizing with sequence dependent setup costs. Operations-Research-Spektrum 18(1): 51–59.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Timpe, C. 2002. Solving planning and scheduling problems with combined integer and constraint programming. OR Spectrum 24(4): 431–448.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Management Studies, Indian Institute of Technology Madras, Chennai, TN, India

    Ravi Ramya & Chandrasekharan Rajendran

  2. Chair of Production and Logistics, Universitát Passau, Passau, Bayern, Germany

    Hans Ziegler

  3. Xavier Institute of Management, Bhubaneswar, Odisha, India

    Sanjay Mohapatra

  4. SCM Center of Competence, McKinsey Knowledge Center, McKinsey & Company, Chennai, TN, India

    K. Ganesh

Authors
  1. Ravi Ramya
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chandrasekharan Rajendran
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hans Ziegler
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sanjay Mohapatra
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. K. Ganesh
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Ramya, R., Rajendran, C., Ziegler, H., Mohapatra, S., Ganesh, K. (2019). 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. In: Capacitated Lot Sizing Problems in Process Industries. Springer, Cham. https://doi.org/10.1007/978-3-030-01222-9_5

Download citation

Publish with us

Policies and ethics

Search

Navigation