MIP-based heuristic algorithm for finite capacity MRP problem in hybrid flow shop with unrelated parallel machines Online publication date: Fri, 27-Sep-2019
by Watchara Songserm; Teeradej Wuttipornpun
International Journal of Industrial and Systems Engineering (IJISE), Vol. 33, No. 2, 2019
Abstract: A main drawback of the material requirement planning (MRP) system is that it assumes fixed lead time, resulting in capacity problems recently called finite capacity material requirement planning (FCMRP). This paper proposes a mixed integer programming (MIP)-based heuristic algorithm that can solve the industrial scale FCMRP problem in hybrid flow shop with unrelated parallel machines. The heuristic is applied to construct an initial sequence of operations, whereas the MIP model is applied to determine the optimal machines and start times for the operations based on the initial sequence. The objective is to minimise the total cost, defined as the sum of tardiness, earliness, idle time, and work in process (WIP) holding costs. Performances of the proposed algorithm are evaluated using real data from automotive industries. The result shows that the total cost of the proposed algorithm are substantially reduced compared with the recent FCMRP algorithm (HGATS). Moreover, the required runtime is within a practical limit.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Industrial and Systems Engineering (IJISE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com