Heuristic for no-wait flow shops with makespan minimization
From MaRDI portal
Publication:5385488
Recommendations
- Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments
- A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
- Objective increment based metaheuristic for total flowtime minimization in no-wait flowshops
- Heuristics for no-wait flowshops with makespan subject to mean completion time
- New heuristics for no-wait flowshops to minimize makespan.
Cites work
Cited in
(14)- A survey of scheduling problems with no-wait in process
- Some local search algorithms for no-wait flow-shop problem with makespan criterion
- An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects
- Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion
- New heuristics for no-wait flowshops to minimize makespan.
- An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time
- Minimizing makespan for a no-wait flowshop using genetic algorithm
- Study on MDIS algorithm for the no-wait flow-shop scheduling
- Accelerating the calculation of makespan used in scheduling improvement heuristics
- On no-wait and no-idle flow shops with makespan criterion
- Minimisation of total tardiness for identical parallel machine scheduling using genetic algorithm
- Heuristics for no-wait flowshops with makespan subject to mean completion time
- Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments
- Objective increment based metaheuristic for total flowtime minimization in no-wait flowshops
This page was built for publication: Heuristic for no-wait flow shops with makespan minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5385488)