Combined cutting stock and scheduling: a matheuristic approach. (2016)

• Record Type: Journal Article
• Authors: Braga, Nuno; Alves, Cláudio; Macedo, Rita; Carvalho, José Valério De
• Is Part Of: International journal of innovative computing and applications. Volume 7:Number 3(2016)
• Page Start: 135
• Page End: 146
• Publication Date: 2016
• Subjects: combinatorial optimisation -- integer programming -- cutting stock -- scheduling -- integrated optimisation -- matheuristics -- compact formulations -- pseudo-poynomial formulations -- valid inequalities -- computational experiments -- cutting planning -- waste generation -- stock rolls -- tardiness -- due dates -- knapsack-based inequalities -- arc flows; Evolutionary computation -- Periodicals; Neural networks (Computer science) -- Periodicals; Genetic programming (Computer science) -- Periodicals; Biologically-inspired computing -- Periodicals; Swarm intelligence -- Periodicals; Quantum computers -- Periodicals; 006.3
• Languages: English
• ISSNs: 1751-648X

Abstract

The efficient solution of practical problems combining both cutting stock and scheduling aspects has motivated the development of several approaches described recently in the literature. These problems consist in determining a cutting plan that minimises both the waste generated by cutting the stock rolls and the tardiness related to the delivery of items later than their specified due date. In this paper, we review two exact formulations proposed recently, which differ essentially on their strength and size. The first one is a compact model, which can be strengthened using knapsack-based inequalities. The other is a pseudo-polynomial model based on arc flows. Additionally, we explore a matheuristic approach based on a variant of the arc flow model that proved to be effective for solving medium scale instances. Computational results are provided and discussed at the end of the paper.