A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop
From MaRDI portal
Publication:1762116
DOI10.1016/j.cor.2011.07.004zbMath1251.90139OpenAlexW2011016358MaRDI QIDQ1762116
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.07.004
Related Items (3)
Predictive-reactive strategy for identical parallel machine rescheduling ⋮ Learning-augmented heuristics for scheduling parallel serial-batch processing machines ⋮ Flowshop-scheduling problems with makespan criterion: a review
Cites Work
- Unnamed Item
- Unnamed Item
- Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- A survey of priority rule-based scheduling
- The two-machine flowshop scheduling problem with total tardiness
- A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
- Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment
- A comparative study of dispatching rules in dynamic flowshops and jobshops
- A new rule for minimizing the number of tardy jobs in dynamic flow shops
- A survey of dynamic scheduling in manufacturing systems
- Minimizing Total Tardiness on One Machine is NP-Hard
- Confidence Intervals for Steady-State Simulations: I. A Survey of Fixed Sample Size Procedures
- On general routing problems
- A Survey of Scheduling Rules
- Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
- Minimizing tardiness in a two-machine flow-shop
This page was built for publication: A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop
