Worst-Case Analysis of Process Flexibility Designs

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.

[1]  Ramandeep S. Randhawa,et al.  Optimal Flexibility Configurations in Newsvendor Networks: Going Beyond Chaining and Pairing , 2010, Manag. Sci..

[2]  Tianhu Deng,et al.  Process Flexibility Design in Unbalanced and Asymmetric Networks , 2013 .

[3]  Sy-yen Kuo,et al.  Efficient Spare Allocation for Reconfigurable Arrays , 1987, IEEE Design & Test of Computers.

[4]  M. Gail Jones,et al.  It's a Small World After All. , 2005 .

[5]  Seyed M. R. Iravani,et al.  Structural Flexibility: A New Perspective on the Design of Manufacturing and Service Operations , 2005, Manag. Sci..

[6]  Fikri Karaesmen,et al.  Characterizing the performance of process flexibility structures , 2007, Oper. Res. Lett..

[7]  Seyed M. R. Iravani,et al.  Call-Center Labor Cross-Training: It's a Small World After All , 2007, Manag. Sci..

[8]  Stephen C. Graves,et al.  Process Flexibility in Supply Chains , 2003, Manag. Sci..

[9]  D. Simchi-Levi Operations Rules: Delivering Customer Value through Flexible Operations , 2010 .

[10]  Zuo-Jun Max Shen,et al.  Stochastic programming approach to process flexibility design , 2009 .

[11]  Chung-Piaw Teo,et al.  Process Flexibility Revisited: The Graph Expander and Its Applications , 2011, Oper. Res..

[12]  Henning Fernau,et al.  Constraint bipartite vertex cover: simpler exact algorithms and implementations , 2012, J. Comb. Optim..

[13]  Dimitris Bertsimas,et al.  Optimization over integers , 2005 .

[14]  Saif Benjaafar,et al.  Modeling and analysis of flexible queueing systems , 2004 .

[15]  Zuo-Jun Max Shen,et al.  Process flexibility design in unbalanced networks , 2013, IEEE Engineering Management Review.

[16]  William C. Jordan,et al.  Principles on the benefits of manufacturing process flexibility , 1995 .

[17]  Ward Whitt,et al.  A Staffing Algorithm for Call Centers with Skill-Based Routing , 2005, Manuf. Serv. Oper. Manag..

[18]  Wallace J. Hopp,et al.  Benefits of Skill Chaining in Serial Production Lines with Cross-Trained Workers , 2004, Manag. Sci..

[19]  David Simchi-Levi,et al.  Understanding the Performance of the Long Chain and Sparse Designs in Process Flexibility , 2012, Oper. Res..

[20]  Chung-Piaw Teo,et al.  Design for Process Flexibility: Efficiency of the Long Chain and Sparse Structure , 2010, Oper. Res..

[21]  W. Kent Fuchs,et al.  Efficient Spare Allocation for Reconfigurable Arrays , 1987 .

[22]  John A. Buzacott,et al.  Flexibility in manufacturing and services: achievements, insights and challenges , 2008 .

[23]  Huan Zheng,et al.  Process flexibility: design, evaluation, and applications , 2008 .

[24]  Rolf Niedermeier,et al.  An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover , 1999, J. Algorithms.

[25]  C ChouMabel,et al.  Design for Process Flexibility , 2010 .