Prioritization of kanbans in the case of a single station serving multiple downstream stations

DOI10.1080/00207549508930155zbMath0914.90128OpenAlexW2028987959WikidataQ126247692 ScholiaQ126247692MaRDI QIDQ4398914

No author found.

Publication date: 1 June 1999

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207549508930155

zbMATH Keywords

dynamic programmingMarkovian decision processkanbannon-serial production linesprioritization problem

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Production models (90B30) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)

Cites Work

• Unnamed Item
• Unnamed Item
• The cμ rule revisited
• A Mathematical Programming Approach to a Deterministic Kanban System
• A Broader View of the Job-Shop Scheduling Problem

This page was built for publication: Prioritization of kanbans in the case of a single station serving multiple downstream stations