Automatic design of constructive heuristics for a reconfigurable distributed flowshop group scheduling problem
From MaRDI portal
Publication:6065623
DOI10.1016/j.cor.2023.106432MaRDI QIDQ6065623
Chao Lu, Hongyan Sang, Leilei Meng, Yuyan Han, Biao Zhang
Publication date: 15 November 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
group scheduling; constructive heuristic; reconfigurability; automatic algorithm design; distributed flowshop scheduling
90Bxx: Operations research and management science
Cites Work
- New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem
- Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems
- An improved NEH-based heuristic for the permutation flowshop problem
- Tuning metaheuristics. A machine learning Perspective
- The distributed permutation flowshop scheduling problem
- A comprehensive review of flowshop group scheduling literature
- A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility
- Multi-trip time-dependent vehicle routing problem with time windows
- An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem
- Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
- An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time
