Estimation of distribution algorithm with path relinking for the blocking flow-shop scheduling problem
From MaRDI portal
Publication:5058781
DOI10.1080/0305215X.2017.1353090OpenAlexW2741461663MaRDI QIDQ5058781
Dechang Pi, Weishi Shao, Zhongshi Shao
Publication date: 23 December 2022
Published in: Engineering Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0305215x.2017.1353090
Related Items (1)
Cites Work
- Unnamed Item
- An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems
- A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
- A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times
- A three-phase algorithm for flowshop scheduling with blocking to minimize makespan
- Local search methods for the flowshop scheduling problem with flowtime minimization
- Discrete Self-Organising Migrating Algorithm for flow-shop scheduling with no-wait makespan
- Benchmarks for basic scheduling problems
- Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
This page was built for publication: Estimation of distribution algorithm with path relinking for the blocking flow-shop scheduling problem