A study on the performance of scheduling rules in buffer-constrained dynamic flowshops
From MaRDI portal
Publication:4707446
DOI10.1080/00207540210146107zbMath1081.90557OpenAlexW2051858535MaRDI QIDQ4707446
Oliver Holthaus, Chandrasekharan Rajendran
Publication date: 2002
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540210146107
Related Items (2)
Scheduling in dynamic assembly job-shops with jobs having different holding and tardiness costs ⋮ Influence of capacity- and time-constrained intermediate storage in two-stage food production systems
Cites Work
- A survey of priority rule-based scheduling
- 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
- Flowshop sequencing problems with limited buffer storage
- Formulations and heuristics for scheduling in a Kanban flowshop to minimize the sum of weighted flowtime, weighted tardiness and weighted earliness of containers
- New dispatching rules for shop scheduling: A step forward
- Determination of the number of containers, production kanbans and withdrawal kanbans; and scheduling in kanban flowshops - Part 2
- Sequencing CONWIP flow-shops: Analysis and heuristics
- Input control and dispatching rules in a dynamic CONWIP flow-shop
- Review of sequencing research
This page was built for publication: A study on the performance of scheduling rules in buffer-constrained dynamic flowshops
