Abstract

Problem statement: Lot-size is the clustering of items for transportation or manufacturing processes occurring at the same time. The issue in lot-size problem is to design production processes so that the feasible production quantities are equal to customer demand quantities and the timing of production is such that inventory positions are almost zero. Approach: In this study, we explore the multi-level lot-size and scheduling problem. It is on a multi-level capacitated lot-size problem or known as the multi-level lot-size problem with bottlenecks. Two models were introduced to solve the multi-level lot-size problem namely the Billington model and Alf Kimms model. Using these models, a simple heuristic method was designed to solve a multi level capacitated lot sizing scheduling problem. Results: In this study, we showed that Alf Kimms model is more efficient than Billington model. The result given by Alf Kimms model is always feasible without further modification unlike the Billington model. This is due to the way the constraint is devised to ensure the inventory balance. The constraint used in Alf Kimms model ensures that inventory in hand is always sufficient to fulfill the demand occurred in each period. However, the use of this constraint in Billington model is to ensure that the total production for each item is always greater than or equal to the total external demand in the time horizon. Therefore, without some form of modification, the result given by Billington model will be infeasible production plan. Conclusion: A comparative study between these models shows that both models were successfully devised to solve capacitated multi-level lot sizing problem with the objective function to minimize the total holding costs and setup- cost. This study also shows that the production schedule will always start at the last period because this will give the lowest costs and it also shows that Alf Kimms model gives a set of feasible sub-optimal schedule compare to Billington model.

Highlights

  • Material Requirement Planning (MRP) is a production scheduling method to determine the demand for material required to produce a group of finished goods for multi-stage, or multi-product manufacturing system

  • The inventory here is eliminated by substituting cumulative production minus cumulative demand and the integer programming model is given as follows

  • We proposed the adaptation of simple heuristics as Opening stock Net requirement Start assembly Schedule receipts developed by Toklu and Wilson and modify them to here we will only discuss the MRP approach satisfy the problem requirements

Read more

Summary

Introduction

Material Requirement Planning (MRP) is a production scheduling method to determine the demand for material required to produce a group of finished goods for multi-stage, or multi-product manufacturing system. In the MRP system, the lot-sizing problem arise a central issue to be addressed to the system designer. It is a problem, where the periods and the cost are fixed a priori. The multilevel lot-sizing problem is computationally a very difficult to solve as a NP-hard problem. It is important to develop effective heuristics for these problems. Heuristics is a way one learn, discover or solve problems rather than guessing or acting at random. The heuristics method presented here is based on integer programming develop by Billington et al (1986) and Kimms (1997) when there is a bottleneck facility at workstations

Objectives
Methods
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call