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

DOI10.1016/j.cor.2020.105020zbMath1458.90326arXiv2006.13064OpenAlexW3036882732WikidataQ122112496 ScholiaQ122112496MaRDI QIDQ2664355

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

Publication date: 20 April 2021

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.13064

zbMATH Keywords

mixed integer linear programmingconstraint programmingsequence-dependent setup timeflexible job shop scheduling with sequence flexibilityresumable operationsunavailability of the machines

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

The sample analysis machine scheduling problem: definition and comparison of exact solving approaches, An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times, A simulation-optimization framework for generating dynamic dispatching rules for stochastic job shop with earliness and tardiness penalties, An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning, A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions, Scheduling wagons to unload in bulk cargo ports with uncertain processing times, A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization, Metaheuristics for the online printing shop scheduling problem

Uses Software

• CPLEX
• ILOG SCHEDULE

Cites Work

• Unnamed Item
• List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility
• Evaluation of mathematical models for flexible job-shop scheduling problems
• Mathematical models for job-shop scheduling problems with routing and process plan flexibility
• A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling.
• IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG
• An update on the comparison of MIP, CP and hybrid approaches for mixed resource allocation and scheduling
• A heuristic to schedule flexible job-shop in a glass factory
• A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem
• A MILP model for an extended version of the flexible job shop problem
• A research survey: review of flexible job shop scheduling techniques
• The Complexity of Flowshop and Jobshop Scheduling
• Failure-Directed Search for Constraint-Based Scheduling
• Scheduling
• The multiperiod two‐dimensional non‐guillotine cutting stock problem with usable leftovers