Two-dimensional cutting stock problem with sequence dependent setup times

David A. Wuttke and H. Sebastian Heese

European Journal of Operational Research, 2018, vol. 265, issue 1, 303-315

Abstract: Motivated by a firm in the technical textile industry, we study a two-dimensional cutting stock problem with sequence dependent setup times and permissible tolerances. We provide a sequential heuristic with feedback loop based on the approach of Gilmore and Gomory and formulate the sequencing problem as a mixed integer program. We derive a lower bound algorithm and demonstrate the near-optimal performance of our heuristic. Finally, we use real data to test our heuristic and illustrate its applicability to a problem of realistic size.

Keywords: Cutting stock problem; Sequence dependent setup times; Heuristics; Application (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S037722171730663X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:265:y:2018:i:1:p:303-315

DOI: 10.1016/j.ejor.2017.07.036

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().