Skip to Main Content
 

Global Search Box

 
 
 
 

Files

File List


case1094323177.pdf (543.23 KB)

ETD Abstract Container

Abstract Header

THE MULTI-FAMILY ECONOMIC LOT SCHEDULING PROBLEM WITH SAFETY STOCKS

Karalli, Serge Michael
http://rave.ohiolink.edu/etdc/view?acc_num=case1094323177

Abstract Details

2005, Doctor of Philosophy, Case Western Reserve University, Operations Research.
The Multiple Family Economic Lot Scheduling Problem with safety stocks (MFELSP-SS) with normally distributed, i. i. d. demand is considered in a manufacturing setting where the relevant costs include family setup costs, item setup costs, and inventory holding costs for cycle and safety stocks. A family is a subset of the items that share a common setup, with its associated setup cost and setup time. Items have their own setup times and costs. The formulation considers safety stocks explicitly, as their holding costs vary nontrivially with the model’s decision variables. The subject of Essay 1, the Family Planning Problem (FPP), is the first step in addressing the MFELSP—SS. The service level criterion is used to determine safety stock levels. The solution to the FPP is comprised of the basic period length, the family and item multipliers, restricted to integer powers of two, that give the lowest total cost of setups and carrying inventory. Properties of the non-convex feasible space are identified and used in the efficient solution procedure developed for this model. The solution to the FPP is used as the input to the Family Periodic Loading Problem (FPLP), which is the subject of Essay 2. The purpose of the FPLP is to create a feasible production schedule that achieves, as much as possible, the cost minimizing objective of the FPP. The FPLP generates a production schedule that can be implemented, a feature that is not present in the FPP. Three efficient heuristic approaches to solving the FPLP are proposed. In Essay 3a, the FPP is solved considering the fill rate criterion in determining safety stock levels. In Essay 3b, a computational study assesses the performance of the algorithms developed in Essays 1 and 3a with respect to the approach published in the literature of computing safety stocks after obtaining a schedule. The impact of these approaches to the length of times between production runs is examined. The performance of each of these algorithms will be assessed over a variety of input parameters into the problem. The computational relationships between the service level and the fill rate criterion are derived.
A. Flowers (Advisor)
125 p.
Operations Research
Inventory/production; Approximations/heuristics, Multi-item, Multi-family, Safety stock; Production/scheduling; Applications, Approximations/heuristic, Cyclic schedule

Recommended Citations

Citations

  • Karalli, S. M. (2005). THE MULTI-FAMILY ECONOMIC LOT SCHEDULING PROBLEM WITH SAFETY STOCKS [Doctoral dissertation, Case Western Reserve University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=case1094323177

    APA Style (7th edition)

  • Karalli, Serge. THE MULTI-FAMILY ECONOMIC LOT SCHEDULING PROBLEM WITH SAFETY STOCKS. 2005. Case Western Reserve University, Doctoral dissertation. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=case1094323177.

    MLA Style (8th edition)

  • Karalli, Serge. "THE MULTI-FAMILY ECONOMIC LOT SCHEDULING PROBLEM WITH SAFETY STOCKS." Doctoral dissertation, Case Western Reserve University, 2005. http://rave.ohiolink.edu/etdc/view?acc_num=case1094323177

    Chicago Manual of Style (17th edition)

case1094323177
977
© 2004, all rights reserved.
This open access ETD is published by Case Western Reserve University School of Graduate Studies and OhioLINK.