Paper Info
Title
New integer programming formulations and an exact algorithm for the ordered cutting stock problem
Abstract
Apart from trim loss minimization, there are many other issues concerning cutting processes that arise in real production systems. One of these is related to the number of stacks that need to be opened near the cutting machines. Many researchers have worked in the last years on cutting stock problems with additional constraints on the number of open stacks. In this paper, we address a related problem: the Ordered Cutting Stock Problem (OCSP). In this case, a stack is opened for every new client's order, and it is closed only when all the items of that order are cut. The OSCP has been introduced recently in the literature. Our aim is to provide further insight into this problem. This paper describes three new integer programming formulations for solving it, and an exact algorithm based on column generation, branch-and-bound and cutting planes. We report on computational experiments on a set of random instances. The results show that good lower bounds can be computed quickly, and that optimal solutions can be found in a reasonable amount of time.
Year
DOI
Venue
2008
10.1057/palgrave.jors.2602494
JORS
Keywords
Field
DocType
management science,cutting stock problem,logistics,operations research,production,forecasting,information technology,operational research,location,marketing,computer science,information systems,communications technology,scheduling,reliability,inventory,investment,project management
Branch and bound,Column generation,Cutting-plane method,Exact algorithm,Computer science,Upper and lower bounds,Minification,Integer programming,Cutting stock problem,Operations management
Journal
Volume
Issue
ISSN
59
11
0160-5682
Citations 
PageRank 
References 
1
0.38
13
Authors
2
Name
Order
Citations
PageRank
Cláudio Alves118416.29
J. M. Valério de Carvalho2654.53