Loading...
Loading...

Go to the content (press return)

Procedures for solving a 1-dimensional cutting problem

Author
Corominas, A.; Bautista, J.
Type of activity
Journal article
Journal
European journal of operational research
Date of publication
1994-08
Volume
77
Number
1
First page
154
Last page
168
DOI
https://doi.org/10.1016/0377-2217(94)90035-3 Open in new window
Project funding
Elaboració d'un paquet informàtic per optimització del tall de bobines a partir de peces de teixit
URL
http://www.sciencedirect.com/science/article/pii/0377221794900353 Open in new window
Abstract
The different varieties of a particular article for widespread consumption are characterized by the material used and its length. Each material is acquired in jumbos of a particular length. By cutting them, we must obtain for each production period at least as many items for each variety as are required to cover consumption for the following period; anything above this value will be used in later periods. In order to minimize the cost associated with this process (that of offcuts plus the invent...
Keywords
Cutting problem, Dynamic programming, Heuristics, Integer linear programming
Group of research
OPE-PROTHIUS -

Participants