Metaheuristics for the Online Printing Shop Scheduling Problem

1 code implementation • 22 Jun 2020 • Willian T. Lunardi, Ernesto G. Birgin, Débora P. Ronconi, Holger Voos

This challenging real scheduling problem, that emerged in the nowadays printing industry, corresponds to a flexible job shop scheduling problem with sequencing flexibility; and it presents several complicating specificities such as resumable operations, periods of unavailability of the machines, sequence-dependent setup times, partial overlapping between operations with precedence constraints, and fixed operations, among others.

Job Shop Scheduling Scheduling