Skip to main content

Two-Stage Cutting Stock Problem with Due Dates

  • Conference paper
  • First Online:
Operations Research Proceedings 2016

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

Abstract

In this study, we consider a scheduling extension for the two-stage cutting stock problem with the integration of order due dates. The two-stage cutting stock problem arises when technical restrictions inhibit demanded items to be cut from stock rolls directly, and hence require the cutting process to be done in two subsequent stages. The mathematical model proposed for the due date extension aims to determine a cutting plan which not only minimizes the number of stock rolls used but also reduces tardiness and earliness costs incurred. Preliminary results have shown that the modeling approach used is capable of overcoming difficulties caused by the dependencies between stages.

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

References

  1. Arbib, C., Marinelli, F.: On cutting stock with due dates. Omega-Int. J. Manage. S. 46, 11–20 (2014)

    Article  Google Scholar 

  2. Dyson, R.G., Gregory, A.S.: The cutting stock problem in the flat glass industry. Oper. Res. Quart. 25(1), 41–53 (1974)

    Article  Google Scholar 

  3. Muter, I., Birbil, I., Bülbül, K.: Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows. Math. Program. 142(1–2), 47–82 (2013)

    Article  Google Scholar 

  4. Reinertsen, H., Vossen, T.W.M.: The one-dimensional cutting stock problem with due dates. Eur. J. Oper. Res. 201(3), 701–711 (2010)

    Article  Google Scholar 

  5. Yanasse, H.H.: On a pattern sequencing problem to minimize the maximum number of open stacks. Eur. J. Oper. Res. 100(3), 454–463 (1997)

    Article  Google Scholar 

  6. Yuen, B.J.: Improved heuristics for sequencing cutting patterns. Eur. J. Oper. Res. 87(1), 57–64 (1995)

    Article  Google Scholar 

  7. Zak, E.J.: Row and column generation technique for a multistage cutting stock problem. Comput. Oper. Res. 29(9), 1143–1156 (2002)

    Google Scholar 

Download references

Acknowledgements

This work has been partially completed while the author was a member in the Faculty of Engineering at Bahçeşehir University.

This study is supported by The Scientific and Technological Research Council of Turkey (TÜBİTAK) under grant 113M480.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zeynep Sezer .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Cite this paper

Sezer, Z., Muter, İ. (2018). Two-Stage Cutting Stock Problem with Due Dates. In: Fink, A., Fügenschuh, A., Geiger, M. (eds) Operations Research Proceedings 2016. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-55702-1_20

Download citation

Publish with us

Policies and ethics