Paper Info
Title
A Model-Based Heuristic For The Combined Cutting Stock And Scheduling Problem
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.
Year
DOI
Venue
2015
10.1007/978-3-319-21407-8_35
COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2015, PT II
Keywords
Field
DocType
Cutting stock, Scheduling, Integer programming, Heuristics
Flow network,Mathematical optimization,Heuristic,Job shop scheduling,Tardiness,Computer science,Scheduling (computing),Integer programming,Heuristics,Cutting stock problem
Conference
Volume
ISSN
Citations 
9156
0302-9743
2
PageRank 
References 
Authors
0.36
4
4
Name
Order
Citations
PageRank
Nuno Braga121.04
Cláudio Alves218416.29
Rita Macedo3685.57
José M. Valério De Carvalho416814.06