Mixed Integer linear programming and constraint programming models for the online printing shop scheduling problem

Willian T. Lunardi, Ernesto G. Birgin, Philippe Laborie, Débora P. Ronconi, Holger Voos

Abstract: Highlights•The manuscript describes a challenging real scheduling problems that appears in the nowadays printing industry.•As a first solid step towards its resolution, mixed integer linear programming and constraint programming models are presented.•Extensive numerical experiments with large-sized instances of the size of real instances are considered.•Numerical experiments show that an off-the-shelf solver might be an alternative in practice.