Worst-Case Analysis of Process Flexibility Designs

被引:35
|
作者
Simchi-Levi, David [1 ,2 ]
Wei, Yehua [3 ]
机构
[1] MIT, Dept Civil & Environm Engn, Engn Syst Div, Cambridge, MA 02139 USA
[2] MIT, Ctr Operat Res, Cambridge, MA 02139 USA
[3] Duke Univ, Fuqua Sch Business, Durham, NC 27708 USA
基金
加拿大自然科学与工程研究理事会; 美国国家科学基金会;
关键词
BIPARTITE VERTEX COVER; LONG-CHAIN; PERFORMANCE; BENEFITS;
D O I
10.1287/opre.2014.1334
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Theoretical studies of process flexibility designs have mostly focused on expected sales. In this paper, we take a different approach by studying process flexibility designs from the worst-case point of view. To study the worst-case performances, we introduce the plant cover indices (PCIs), defined by bottlenecks in flexibility designs containing a fixed number of products. We prove that given a flexibility design, a general class of worst-case performance measures can be expressed as functions of the design's PCIs and the given uncertainty set. This result has several major implications. First, it suggests a method to compare the worst-case performances of different flexibility designs without the need to know the specifics of the uncertainty sets. Second, we prove that under symmetric uncertainty sets and a large class of worst-case performance measures, the long chain, a celebrated sparse design, is superior to a large class of sparse flexibility designs, including any design that has a degree of two on each of its product nodes. Third, we show that under stochastic demand, the classical Jordan and Graves (JG) index can be expressed as a function of the PCIs. Furthermore, the PCIs motivate a modified JG index that is shown to be more effective in our numerical study. Finally, the PCIs lead to a heuristic for finding sparse flexibility designs that perform well under expected sales and have lower risk measures in our computational study.
引用
收藏
页码:166 / 185
页数:20
相关论文
共 50 条
  • [1] Worst-case analysis
    Mancini, R
    [J]. EDN, 1999, 44 (13) : 24 - 24
  • [2] Beyond Worst-Case Analysis
    Roughgarden, Tim
    [J]. COMMUNICATIONS OF THE ACM, 2019, 62 (03) : 88 - 96
  • [3] Logic Synthesis for Better Than Worst-case Designs
    Cong, Jason
    Minkovich, Kirill
    [J]. 2009 INTERNATIONAL SYMPOSIUM ON VLSI DESIGN, AUTOMATION AND TEST (VLSI-DAT), PROCEEDINGS OF TECHNICAL PROGRAM, 2009, : 166 - 169
  • [4] Worst-case Structural Analysis
    Zhou, Qingnan
    Panetta, Julian
    Zorin, Denis
    [J]. ACM TRANSACTIONS ON GRAPHICS, 2013, 32 (04):
  • [5] WORST-CASE ANALYSIS OF ALGORITHMS
    VANTRIGT, C
    [J]. PHILIPS JOURNAL OF RESEARCH, 1978, 33 (1-2) : 66 - 77
  • [6] Worst-case flow model of VL for worst-case delay analysis of AFDX
    Liu, Cheng
    Wang, Tong
    Zhao, Changxiao
    Xiong, Huagang
    [J]. ELECTRONICS LETTERS, 2012, 48 (06) : 327 - 328
  • [7] WORST-CASE IDENTIFICATION IN STRUCTURED PROCESS SYSTEMS
    KABATEK, U
    SWANEY, RE
    [J]. COMPUTERS & CHEMICAL ENGINEERING, 1992, 16 (12) : 1063 - 1071
  • [8] WORST-CASE ANALYSIS OF A SCHEDULING ALGORITHM
    SPINRAD, J
    [J]. OPERATIONS RESEARCH LETTERS, 1985, 4 (01) : 9 - 11
  • [9] A COMPARATIVE WORST-CASE ERROR ANALYSIS OF SOME PROPOSED 6-PORT DESIGNS
    GHANNOUCHI, FM
    BOSISIO, RG
    [J]. IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT, 1988, 37 (04) : 552 - 556
  • [10] WORST-CASE ANALYSIS OF HEURISTIC ALGORITHMS
    FISHER, ML
    [J]. MANAGEMENT SCIENCE, 1980, 26 (01) : 1 - 17