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

DOI10.1080/00207549508930155MaRDI QIDQ4398914zbMATH OpenOpenAlexWikidataFDO

Authors

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 programmingkanbanMarkovian decision processnon-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)

Recommendations

• Determining the optimal number of Kanban in multi-products supply chain system
• A dynamic programming model for the kanban assignment problem in a multistage multiperiod production system
• An overview of design and operational issues of kanban systems
• An adaptive approach to controlling kanban systems
• Production planning for a multi-item, single-stage kanban system

Cites work

• A Broader View of the Job-Shop Scheduling Problem
• A Mathematical Programming Approach to a Deterministic Kanban System
• scientific article; zbMATH DE number 3906232 (Why is no real title available?)
• scientific article; zbMATH DE number 941166 (Why is no real title available?)
• The cμ rule revisited

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4398914)