Heuristic for scheduling in a Kanban system with dual blocking mechanisms
From MaRDI portal
Publication:1280177
DOI10.1016/S0377-2217(96)00276-7zbMath0921.90083OpenAlexW2019592132MaRDI QIDQ1280177
Chandrasekharan Rajendran, B. Sharadapriyadarshini
Publication date: 10 March 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(96)00276-7
Cites Work
- Unnamed Item
- A review of optimisation models of Kanban-based production systems
- Optimal two- and three-stage production schedules with setup times included
- Flowshop sequencing problems with limited buffer storage
- ANALYSIS FOR MINIMIZING WEIGHTED MEAN FLOW-TIME IN FLOW-SHOP SCHEDULING
- An Evaluation of Flow Shop Sequencing Heuristics
- Formulations and heuristics for scheduling in a buffer-constrained flowshop and flowline-based manufacturing cell with different buffer-space requirements for jobs: Part 2
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
This page was built for publication: Heuristic for scheduling in a Kanban system with dual blocking mechanisms