期刊
INFORMS JOURNAL ON COMPUTING
卷 25, 期 4, 页码 720-729出版社
INFORMS
DOI: 10.1287/ijoc.1120.0534
关键词
facility location; reliability; mixed integer program; cutting planes; heuristics; supply chain disruption
资金
- NSF [CMMI 1068862, 1031637]
- NSF China [71128001, 71210002]
- CSUSM UPD/RSC
- Directorate For Engineering [1031637] Funding Source: National Science Foundation
- Div Of Civil, Mechanical, & Manufact Inn [1031637] Funding Source: National Science Foundation
We consider reliable facility location models in which facilities are subject to unexpected failures, and customers may be reassigned to facilities other than their regular facilities. The objective is to minimize the total expected costs in normal and failure scenarios. We allow facilities to have different failure rates and do not limit the number of facilities that might be assigned to a customer. Lower bounds for reliable uncapacitated fixed-charge location problem (RUFLP) are derived and used to introduce a class of efficient algorithms for solving the RUFLP problem.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据