Disruption management in production planning
- 20 April 2005
- journal article
- research article
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 52 (5) , 420-442
Abstract
We study the problem of recovering a production plan after a disruption, where the disruption may be caused by incidents such as power failure, market change, machine breakdown, supply shortage, worker no‐show, and others. The new recovery plan we seek after has to not only suit the changed environment brought about by the disruption, but also be close to the initial plan so as not to cause too much customer unsatisfaction or inconvenience for current‐stage and downstream operations. For the general‐cost case, we propose a dynamic programming method for the problem. For the convex‐cost case, a general problem which involves both cost and demand disruptions can be solved by considering the cost disruption first and then the demand disruption. We find that a pure demand disruption is easy to handle; and for a pure cost disruption, we propose a greedy method which is provably efficient. Our computational studies also reveal insights that will be helpful to managing disruptions in production planning. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.Keywords
This publication has 28 references indexed in Scilit:
- Forecast, Solution, and Rolling Horizons in Operations Management Problems: A Classified BibliographyManufacturing & Service Operations Management, 2002
- Match-up scheduling under a machine breakdownEuropean Journal of Operational Research, 1999
- A Grasp for Aircraft Routing in Response to Groundings and DelaysJournal of Combinatorial Optimization, 1997
- Rescheduling job shops under random disruptionsInternational Journal of Production Research, 1997
- Robust Discrete Optimization and Its Applications1997
- Improved Algorithms for Economic Lot Size ProblemsOperations Research, 1993
- Matchup Scheduling with Multiple Resources, Release Dates and DisruptionsOperations Research, 1991
- Aircraft Flow Management under CongestionTransportation Science, 1987
- Solving integer minimum cost flows with separable convex cost objective polynomially1986
- Less Nervous MRP Systems: A Dynamic Economic Lot-Sizing ApproachManagement Science, 1979