A branch-and-price-and-cut algorithm for the pattern minimization problem
n cutting stock problems, after an optimal (minimal stockusage) cutting plan has been devised, one might want to further reducethe operational costs by minimizing the number of setups. A setupoperation occurs each time a different cutting pattern begins to beproduced. The related optimization proble...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | article |
| Language: | eng |
| Published: |
2008
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1822/59116 |
| Country: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/59116 |