A model-based heuristic for the combined cutting stock and scheduling problem

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 work was supported by FEDER funding through the Programa Operacional Factores de Competitividade - COMPETE and by national funding through the Portuguese FCT in the scope of the project PTDC/EGEGES/116676/2010 (Ref. COMPETE: FCOMP-01-0124-FEDER-020430), and by FCT within the project scope: UID/CEC/00319/2013.info:eu-repo/semantics/publishedVersio