Metaheuristics for the online printing shop scheduling problem
From MaRDI portal
Publication:2030284
DOI10.1016/j.ejor.2020.12.021zbMath1487.90304arXiv2006.12344OpenAlexW3082309043MaRDI QIDQ2030284
Holger Voos, Willian T. Lunardi, Ernesto G. Birgin, Débora P. Ronconi
Publication date: 7 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.12344
metaheuristicslocal searchflexible job shop schedulingsequencing flexibilityonline printing shop scheduling
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Semiconductor final-test scheduling under setup operator constraints, A hybrid genetic algorithm based on a two-level hypervolume contribution measure selection strategy for bi-objective flexible job shop problem, An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scatter search with path relinking for the flexible job shop scheduling problem
- List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility
- Optimized task scheduling and resource allocation on cloud computing environment using improved differential evolution algorithm
- Genetic tabu search for the fuzzy flexible job shop problem
- An efficient differential evolution based algorithm for solving multi-objective optimization problems
- Mathematical models for job-shop scheduling problems with routing and process plan flexibility
- Differential evolution for solving multi-mode resource-constrained project scheduling problems
- A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
- Tabu search for the job-shop scheduling problem with multi-purpose machines
- An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- 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
- A heuristic to schedule flexible job-shop in a glass factory
- Future paths for integer programming and links to artificial intelligence
- Effective neighbourhood functions for the flexible job shop problem
- A priority-based genetic algorithm for a flexible job shop scheduling problem
- Routing and scheduling in a flexible job shop by tabu search
- 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 hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
- Mixed integer linear programming and constraint programming models for the online printing shop scheduling problem
- A research survey: review of flexible job shop scheduling techniques
- The Complexity of Flowshop and Jobshop Scheduling
- A Taxonomy for the Flexible Job Shop Scheduling Problem
