Some heuristics for no-wait flowshops with total tardiness criterion
From MaRDI portal
Publication:340249
Recommendations
- Minimizing total tardiness in no-wait flowshops
- No-wait flowshop scheduling problem with two criteria; total tardiness and makespan
- New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness
- A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
- Heuristics for no-wait flowshops with makespan subject to mean completion time
Cited in
(12)- scientific article; zbMATH DE number 1859345 (Why is no real title available?)
- Flow shop scheduling problem with position-dependent processing times
- Minimizing total tardiness in no-wait flowshops
- On the exact solution of the no-wait flow shop problem with due date constraints
- A new heuristic and dominance relations for no-wait flowshops with setups
- Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion
- A reactive iterated greedy algorithm for the no-wait flowshop to minimize total tardiness
- No-wait flowshop scheduling problem with two criteria; total tardiness and makespan
- New heuristics for total tardiness minimization in a flexible flowshop
- No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan
- No-Wait Flow Shop scheduling problem: a systematic literature review and bibliometric analysis
- A survey of scheduling problems with no-wait in process
This page was built for publication: Some heuristics for no-wait flowshops with total tardiness criterion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q340249)