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

•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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Computers & operations research Ročník 123; s. 105020
Hlavní autoři:	Lunardi, Willian T., Birgin, Ernesto G., Laborie, Philippe, Ronconi, Débora P., Voos, Holger
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Elsevier Ltd 01.11.2020 Pergamon Press Inc
Témata:	Constraint modelling Constraint programming Flexible job shop scheduling with sequence flexibility Integer programming Job shop scheduling Job shops Linear programming Mixed integer Mixed integer linear programming Operations research Optimization Precedence constraints Printing Printing industry Resumable operations Sequence-dependent setup time Setup times Solvers Unavailability of the machines Sequence-dependent setup time Constraint programming 90C11 90B35 Resumable operations 90C59 Flexible job shop scheduling with sequence flexibility Mixed integer linear programming Unavailability of the machines
ISSN:	0305-0548, 0305-0548
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!