A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility
From MaRDI portal
Publication:1782178
DOI10.1016/j.cor.2018.07.025zbMath1458.90379OpenAlexW2886663814WikidataQ105789937 ScholiaQ105789937MaRDI QIDQ1782178
Andrea Matta, Chunlong Yu, Quirico Semeraro
Publication date: 18 September 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.07.025
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Attaining flexibility in seru production system by means of Shojinka: an optimization model and solution approaches ⋮ Dynamic dispatching for interbay automated material handling with lot targeting using improved parallel multiple-objective genetic algorithm ⋮ Multi-objective energy-efficient hybrid flow shop scheduling using Q-learning and GVNS driven NSGA-II ⋮ Automatic design of constructive heuristics for a reconfigurable distributed flowshop group scheduling problem ⋮ Manufacturing rescheduling after crisis or disaster-caused supply chain disruption ⋮ Dynamic assignment of a multi-skilled workforce in job shops: an approximate dynamic programming approach ⋮ An uncertain permutation flow shop predictive scheduling problem with processing interruption ⋮ Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Genetic algorithms with different representation schemes for complex hybrid flexible flow line problems
- An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal
- A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks
- A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
- A memetic algorithm for the flexible flow line scheduling problem with processor blocking
- A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers
- Iterated greedy local search methods for unrelated parallel machine scheduling
- Shifting representation search for hybrid flexible flowline problems
- Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows
- Scheduling flexible flow lines with sequence-dependent setup times
- The hybrid flow shop scheduling problem
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
- A Strong Preemptive Relaxation for Weighted Tardiness and Earliness/Tardiness Problems on Unrelated Parallel Machines
- Workload simulation and optimisation in multi-criteria hybrid flowshop scheduling: a case study
- Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach
- Two-Stage, Hybrid Flowshop Scheduling Problem
- Bottleneck-focused scheduling for a hybrid flowshop
- Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art
- Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop
- Scheduling
