CINECA IRIS Institutional Research Information System
IRIS è la soluzione IT che facilita la raccolta e la gestione dei dati relativi alle attività e ai prodotti della ricerca. Fornisce a ricercatori, amministratori e valutatori gli strumenti per monitorare i risultati della ricerca, aumentarne la visibilità e allocare in modo efficace le risorse disponibili.
EnglishThis paper addresses the solution of a cutting stock problem with resource availability and scheduling constraints. To cope with these constraints, both pattern and batch sequencing problems must be addressed. A tabu search algorithm exploring batch output sequences is proposed. The algorithm never opens more stacks than buffers available, respects batch compatibility/precedence constraints, and keeps under control the maximum order spread. Effectiveness and efficiency of the approach are demonstrated through a comprehensive computational study.
http://hdl.handle.net/11697/5001| Titolo: | An LP-based Tabu Search for Batch Scheduling in a Cutting Process with Finite Buffers |
| Autori interni: | ARBIB, CLAUDIO |
| Data di pubblicazione: | 2012 |
| Rivista: | INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS |
| Abstract: | This paper addresses the solution of a cutting stock problem with resource availability and scheduling constraints. To cope with these constraints, both pattern and batch sequencing problems must be addressed. A tabu search algorithm exploring batch output sequences is proposed. The algorithm never opens more stacks than buffers available, respects batch compatibility/precedence constraints, and keeps under control the maximum order spread. Effectiveness and efficiency of the approach are demonstrated through a comprehensive computational study. |
| Handle: | http://hdl.handle.net/11697/5001 |
| Appare nelle tipologie: | 1.1 Articolo in rivista |
File in questo prodotto:
Copyright © 2017