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.

An LP-based Tabu Search for Batch Scheduling in a Cutting Process with Finite Buffers

ARBIB, CLAUDIO;
2012-01-01

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.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11697/5001
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 14
  • ???jsp.display-item.citation.isi??? 15
social impact