Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 34, Issue 11, Pages 3491-3513Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2006.02.022
Keywords
advance planning and scheduling (APS); supply chain management; master planning; order scheduling; demand fulfillment; multi-objective linear programming
Ask authors/readers for more resources
This study proposes a heuristic algorithm, called the multi-objective master planning algorithm (MOMPA), to solve master planning (MP) problems for a supply chain network with multiple finished products. MOMPA has three objectives: to minimize delay penalties, to minimize use of outsourcing capacity, and to minimize the costs of materials, production, processing, transportation, and inventory holding-all while respecting the capacity limitations and the demand deadlines of all those involved in a given supply chain network. MOMPA plans each demand, one by one, without backtracking, and sorts those demands using a sorting mechanism that is part of the algorithm. For each demand, the minimum production cost tree is determined within the limits of the time bucket for the demand deadline. The maximum available capacity of this tree is then computed for the no delay case. Following this calculation, the delay-or-not criterion is evaluated to determine whether or not further delay is necessary. MOMPA compares the results of these two procedures and allocates the appropriate capacities to the demand for all the nodes on the selected tree. If the minimum cost production tree has no available capacity, MOMPA adjusts the network and looks for a new tree. With complexity and computational analysis, MOMPA is shown to be very efficient in solving NIP problems, sometimes generating the same optimal solution as the LP model. (C) 2006 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available