Single Level and Multi-Level, Lot Sizing Strategies in Material Requirements Planning Systems (Operations Management)
Kim, Seung Baum
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/70463
Description
Title
Single Level and Multi-Level, Lot Sizing Strategies in Material Requirements Planning Systems (Operations Management)
Author(s)
Kim, Seung Baum
Issue Date
1986
Department of Study
Business Administration
Discipline
Business Administration
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Business Administration, Management
Abstract
The area of Material Requirements Planning (MRP) is receiving major emphasis in the management of operations due to the financial benefits of efficient deployment of inventory investment. The issue of lot sizing rule has been one of the most heavily addressed topics in the MRP area. Prior research in lot sizing has dealt with single level or multi-level problems with a single parent product structure. However, real world problems frequently involve both multiple levels and multiple parents.
To develop a multi-level lot sizing rule, the dependent demand relationship between parents and components and common usage of certain items in producing different finished products should be considered in some fashion. The objective of this research is to develop multi-level lot sizing rules that are simple to understand and can be implemented with ease on an MRP system. This dissertation proposes a new approach to multi-level lot sizing for MRP systems.
We formulate a mixed integer programming model for the multi-level lot sizing problem to facilitate the development of a multi-level lot sizing algorithm. An examination of sample solutions obtained by mixed integer programming with the ones obtained by a sequential application of any single level lot sizing rules can provide a pattern which would be useful in developing a recursion algorithm. Exploiting the characteristic differences among these solutions, a recursion algorithm is developed.
Three popular lot sizing rules are modified for the single level, and multi-level problem as well. The three modified lot sizing rules operate on the part period accumulation principle besides their original mechanism.
To evaluate these proposed single level and multi-level lot sizing heuristics we develop a computer simulation model of an MRP system and design experiments designed to consider different demand patterns, different degrees of commonality and different numbers of levels in product structures. Evaluation criteria include inventory costs and computing time requirements.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
