A Mathematical Programming Approach to a Deterministic Kanban System

DOI10.1287/mnsc.33.4.427zbMath0612.90063OpenAlexW2026540608MaRDI QIDQ3753790

Li Chang, Gabriel R. Bitran

Publication date: 1987

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.33.4.427

zbMATH Keywords

Kanban systemdeterministic multi-stage capacitated assembly-tree- structure production

Mathematics Subject Classification ID

Production models (90B30) Inventory, storage, reservoirs (90B05)

Related Items

A review of optimisation models of Kanban-based production systems, Packing items to feed assembly lines, A dynamic programming model for the kanban assignment problem in a multistage multiperiod production system, A linear programming embedded genetic algorithm for an integrated cell formation and lot sizing considering product quality, The Kanban assignment problem -- A non-integral approach, Estimating the throughput of an exponential CONWIP assembly system, Generic kanban systems for dynamic environments, Production planning for a multi-item, single-stage kanban system, Control policies for two-stage, pull-type production/inventory systems with constrained average cost criterion, Prioritization of kanbans in the case of a single station serving multiple downstream stations, Modelling the performance of a kanban assembly shop, Optimal numbers of two kinds of kanbans in a JIT production system, Simulation studies in JIT production, Lead time and response time in a pull production control system, Simultaneously determining the number of kanbans, container sizes, and the final-assembly sequence of products in a just-in-time shop., Effects of kanban withdrawal policies and other factors on the performance of JIT systems—a simulation study, Look-back policies for two-stage, pull-type production/inventory systems, A genetic approach to Kanban assignment problems