Mathematical models for the deterministic, capacitated, single kanban system.
AuthorMitwasi, Mousa George
AdvisorAskin, Ronald G.
MetadataShow full item record
PublisherThe University of Arizona.
RightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.
AbstractThe kanban system is the most popular technique for implementing the Just-In-Time philosophy. In this dissertation we develop mathematical models for the deterministic, capacitated, single kanban system. Three different production structures are studied. The models are used to analyze the system, understand the need and behavior of kanbans, and compute good solutions for the number of kanbans to allocate for each part. The first model applies to the single-stage, single-item system. Optimal solutions for the number of kanbans for this system are developed. The second and third models are built for the multi-stage, single-item system and the single-stage, multi-item system respectively. Necessary and sufficient conditions for the feasibility of a set of kanbans are developed for the last two models. The conditions are used to develop heuristic and optimal solution procedures. The heuristic procedures are tested over randomly generated problems and are shown to perform very well compared to the optimal solution procedures.
Degree ProgramSystems and Industrial Engineering