Abstract
In this paper, we address a variant of the cutting stock problem that considers the scheduling of the cutting operations over time. The problem combines the standard objective of cutting stock problems, which is the minimization of the raw material usage, together with a scheduling term penalizing tardiness. There is tardiness whenever the last instance of an item is cut after its given due date. This problem has been analyzed recently considering one and two-dimensional items. In this paper, we describe a new pseudo-polynomial network flow model for this combined cutting stock and scheduling problem. A revised version of this model in which consecutive time instants are aggregated is used to define an heuristic solution procedure for the problem. This revised formulation is complemented by a time assignment procedure leading to good feasible solutions for the problem. Computational results on benchmark instances are provided illustrating the potential of the approach.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arbib, C., Marinelli, F.: On cutting stock with due dates. Omega 46, 11–20 (2014)
Braga, N., Alves, C., de Carvalho, J.V.: Exact solution of combined cutting stock and scheduling problems. Accepted for publication in the CMS2014 Special Volume of Lecture Notes in Economics and Mathematical Systems, 11th International Conference in Computational Management Science. Springer (2014)
Degraeve, Z., Peeters, M.: Optimal integer solutions to industrial cutting-stock problems: Part 2, benchmark results. INFORMS Journal on Computing 15(1), 58–81 (2003)
Dyckhoff, H.: A new linear programming approach to the cutting stock problem. Operations Research 29, 145–159 (1981)
Fekete, S., Schepers, J.: New classes of fast lower bounds for bin packing problems. Mathematical Programming 91, 11–31 (2001)
Gilmore, P., Gomory, R.: A linear programming approach to the cutting stock problem. Operations Research 9, 849–859 (1961)
Hendry, L., Fok, K., Shek, K.: A cutting stock and scheduling problem in the copper industry. Journal of the Operational Research Society 47(1), 38–47 (1996)
Li, S.: Multi-job cutting stock problem with due dates and release dates. Journal of the Operational Research Society 47, 490–510 (1996)
Perrot, N.: Integer Programming Column Generation Strategies for the Cutting Stock Problem and its Variants. Ph.D. thesis, Université Bordeaux 1 (2005)
Reinertsen, H., Vossen, T.: The one-dimensional cutting stock problem with due dates. European Journal of Operational Research 201, 701–711 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Braga, N., Alves, C., Macedo, R., de Carvalho, J.V. (2015). A Model-Based Heuristic for the Combined Cutting Stock and Scheduling Problem. In: Gervasi, O., et al. Computational Science and Its Applications -- ICCSA 2015. ICCSA 2015. Lecture Notes in Computer Science(), vol 9156. Springer, Cham. https://doi.org/10.1007/978-3-319-21407-8_35
Download citation
DOI: https://doi.org/10.1007/978-3-319-21407-8_35
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21406-1
Online ISBN: 978-3-319-21407-8
eBook Packages: Computer ScienceComputer Science (R0)