We are upgrading the repository! A content freeze is in effect until November 22nd, 2024 - no new submissions will be accepted; however, all content already published will remain publicly available. Please reach out to repository@u.library.arizona.edu with your questions, or if you are a UA affiliate who needs to make content available soon. Note that any new user accounts created after September 22, 2024 will need to be recreated by the user in November after our migration is completed.
Mathematical models for the deterministic, capacitated, single kanban system.
| dc.contributor.advisor | Askin, Ronald G. | en_US |
| dc.contributor.author | Mitwasi, Mousa George | |
| dc.creator | Mitwasi, Mousa George | en_US |
| dc.date.accessioned | 2011-10-31T17:40:30Z | |
| dc.date.available | 2011-10-31T17:40:30Z | |
| dc.date.issued | 1991 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10150/185523 | |
| dc.description.abstract | The 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. | |
| dc.language.iso | en | en_US |
| dc.publisher | The University of Arizona. | en_US |
| dc.rights | Copyright © 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. | en_US |
| dc.subject | Dissertations, Academic | en_US |
| dc.subject | Industrial engineering | en_US |
| dc.subject | Operations research. | en_US |
| dc.title | Mathematical models for the deterministic, capacitated, single kanban system. | en_US |
| dc.type | text | en_US |
| dc.type | Dissertation-Reproduction (electronic) | en_US |
| dc.identifier.oclc | 711689207 | en_US |
| thesis.degree.grantor | University of Arizona | en_US |
| thesis.degree.level | doctoral | en_US |
| dc.contributor.committeemember | Goldberg, Jeffrey | en_US |
| dc.contributor.committeemember | Sen, Suvrajeet | en_US |
| dc.identifier.proquest | 9136854 | en_US |
| thesis.degree.discipline | Systems and Industrial Engineering | en_US |
| thesis.degree.discipline | Graduate College | en_US |
| thesis.degree.name | Ph.D. | en_US |
| refterms.dateFOA | 2018-08-23T04:15:42Z | |
| html.description.abstract | The 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. |
Files in this item
Name:
azu_td_9136854_sip1_m.pdf
Size:
2.799Mb
Format:
PDF
Description:
azu_td_9136854_sip1_m.pdf