Skip to main content

High Multiplicity Scheduling with Switching Costs for Few Products

  • Conference paper
  • First Online:
Operations Research Proceedings 2014

Part of the book series: Operations Research Proceedings ((ORP))

Abstract

We study several variants of the single machine capacitated lot sizing problem with sequence-dependent setup costs and product-dependent inventory costs. Here we are given one machine and \(n \ge 1\) types of products that need to be scheduled. Each product is associated with a constant demand rate \(d_i\), production rate \(p_i\) and inventory costs per unit \(h_i\). When the machine switches from producing product i to product j, setup costs \(s_{i,j}\) are incurred. The goal is to minimize the total costs subject to the condition that all demands are satisfied and no backlogs are allowed. In this work, we show that by considering the high multiplicity setting and switching costs, even trivial cases of the corresponding “normal” counterparts become non-trivial in terms of size and complexity. We present solutions for one and two products.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Similar content being viewed by others

References

  1. Brauner, N., Crama, Y., Grigoriev, A., Van De Klundert, J.: A framework for the complexity of high-multiplicity scheduling problems. J. Comb. Optim. 9(3), 313–323 (2005)

    Article  Google Scholar 

  2. Goyal, S.K.: Scheduling a multi-product single machine system. J. Oper. Res. Soc. 24(2), 261–269 (1973)

    Article  Google Scholar 

  3. Madigan, J.G.: Scheduling a multi-product single machine system for an infinite planning period. Manag. Sci. 14(11), 713–719 (1968)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Vincent J. C. Kreuzen or Tim Oosterwijk .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Gabay, M., Grigoriev, A., Kreuzen, V.J.C., Oosterwijk, T. (2016). High Multiplicity Scheduling with Switching Costs for Few Products. In: Lübbecke, M., Koster, A., Letmathe, P., Madlener, R., Peis, B., Walther, G. (eds) Operations Research Proceedings 2014. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-28697-6_61

Download citation

Publish with us

Policies and ethics