Simultaneously determining the number of kanbans, container sizes, and the final-assembly sequence of products in a just-in-time shop.

DOI10.1080/00207549608904891zbMath0923.90079OpenAlexW1970332999MaRDI QIDQ4230046

Loren Paul Rees, Patrick R. Philipoom, Bernard W. Taylor III

Publication date: 1 March 1999

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

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

zbMATH Keywords

production planningjust-in-timeeconomic lot schedulingmultiple-level, capacitated resource problem

Mathematics Subject Classification ID

Production models (90B30)

Related Items (1)

Analysis of decentralized multi‐product pull systems with lost sales

Cites Work

• A review of optimisation models of Kanban-based production systems
• A dynamic programming model for the kanban assignment problem in a multistage multiperiod production system
• A Mathematical Programming Approach to a Deterministic Kanban System
• The Economic Lot-Scheduling Problem: Achieving Feasibility Using Time-Varying Lot Sizes
• The Economic Lot Scheduling Problem (ELSP): Review and Extensions
• A Dynamic Programming Approach to a Lot Size Scheduling Problem

This page was built for publication: Simultaneously determining the number of kanbans, container sizes, and the final-assembly sequence of products in a just-in-time shop.