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

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.