A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation
From MaRDI portal
Publication:1887965
DOI10.1016/S0377-2217(03)00434-XzbMath1065.90032OpenAlexW2052457629MaRDI QIDQ1887965
S. Bertel, Jean-Charles Billaut
Publication date: 22 November 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(03)00434-x
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times ⋮ Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective ⋮ Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time ⋮ A hybrid flowshop scheduling problem for a cold treating process in seamless steel tube production ⋮ Modeling realistic hybrid flexible flowshop scheduling problems ⋮ Two-stage hybrid flow shop with recirculation ⋮ The hybrid flow shop scheduling problem ⋮ Scheduling jobs on a \(k\)-stage flexible flow-shop ⋮ Supercomputer Scheduling with Combined Evolutionary Techniques ⋮ Bottleneck-based heuristics to minimize tardy jobs in a flexible flow line with unrelated parallel machines ⋮ A simulated annealing with multiple-search paths and parallel computation for a comprehensive flowshop scheduling problem ⋮ Minimizing makespan in two-stage hybrid cross docking scheduling problem ⋮ Multi-objective reentrant hybrid flowshop scheduling with machines turning on and off control strategy using improved multi-verse optimizer algorithm ⋮ Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop ⋮ A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Branch and bound algorithm for the flow shop with multiple processors
- A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
- Minimizing late jobs in the general one machine scheduling problem
- Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
- A bicriteria two-machine permutation flowshop problem
- Flowshop scheduling with identical jobs and uniform parallel machines
- Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment
- Heuristic algorithms for the two-stage hybrid flowshop problem
- Local search algorithms for the multiprocessor flow shop scheduling problem
- The flow shop with parallel machines: A tabu search approach
- A generalized permutation approach to job shop scheduling with genetic algorithms
- Mathematical Modeling of Scheduling Problems
- Two-Stage, Hybrid Flowshop Scheduling Problem
- A Survey of Scheduling Rules
- Minimizing tardy jobs in a two-stage hybrid flowshop
- Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art
