A facility reliability problem: Formulation, properties, and algorithm
Abstract
Having a robustly designed supply chain network is one of the most effective ways to hedge against network disruptions because contingency plans in the event of a disruption are often significantly limited. In this article, we study the facility reliability problem: how to design a reliable supply chain network in the presence of random facility disruptions with the option of hardening selected facilities. We consider a facility location problem incorporating two types of facilities, one that is unreliable and another that is reliable (which is not subject to disruption, but is more expensive). We formulate this as a mixed integer programming model and develop a Lagrangian Relaxation‐based solution algorithm. We derive structural properties of the problem and show that for some values of the disruption probability, the problem reduces to the classical uncapacitated fixed charge location problem. In addition, we show that the proposed solution algorithm is not only capable of solving large‐scale problems, but is also computationally effective. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010
Document Details
- Document Type
- Pub Defense Publication
- Publication Date
- Nov 12, 2009
- Source ID
- 10.1002/nav.20385
Entities
People
- Achal Bassamboo
- Mark S. Daskin
- Michael Lim
- Sunil Chopra
Organizations
- National Science Foundation
- Office of Naval Research