DEDICATION |
|
v | (6) |
PREFACE |
|
xi | (4) |
ACKNOWLEDGMENTS |
|
xv | |
|
1 APPROACHES FOR HANDLING UNCERTAINTY IN DECISION MAKING |
|
|
1 | (25) |
|
1.1 Traditional Approaches for Handling Uncertainty in Decision Making |
|
|
1 | (7) |
|
1.2 A Formal Definition of the Robustness Approach |
|
|
8 | (3) |
|
1.3 Robust Decision Making Framework |
|
|
11 | (6) |
|
1.4 Motivate the Robustness Approach Through International Sourcing Applications |
|
|
17 | (6) |
|
1.5 A Brief Guide Through Related Literature |
|
|
23 | (1) |
|
|
24 | (2) |
|
2 A ROBUST DISCRETE OPTIMIZATION FRAMEWORK |
|
|
26 | (48) |
|
2.1 The Robust Discrete Optimization Problem |
|
|
26 | (33) |
|
2.2 Efficiency and Expected Performance of Robust Solutions |
|
|
59 | (10) |
|
2.3 A Brief Guide Through Related Literature |
|
|
69 | (1) |
|
|
70 | (4) |
|
3 COMPUTATIONAL COMPLEXITY RESULTS OF ROBUST DISCRETE OPTIMIZATION PROBLEMS |
|
|
74 | (42) |
|
3.1 Complexity Results for the Robust Assignment Problem |
|
|
76 | (1) |
|
3.2 Complexity Results for the Robust Shortest Path Problem |
|
|
77 | (8) |
|
3.3 Complexity Results for the Robust Minimum Spanning Tree Problem |
|
|
85 | (5) |
|
3.4 Complexity Results for the Robust Resource Allocation Problem |
|
|
90 | (5) |
|
3.5 Complexity Results for the Robust Machine Scheduling Problem |
|
|
95 | (5) |
|
3.6 Complexity Results for the Robust Multi-period Production Planning Problem |
|
|
100 | (3) |
|
3.7 Complexity Results for the Robust Knapsack Problem |
|
|
103 | (4) |
|
3.8 Complexity Results for the Robust Multi-Item Newsvendor Problem |
|
|
107 | (4) |
|
3.9 A Brief Guide Through Related Literature |
|
|
111 | (2) |
|
|
113 | (3) |
|
4 EASILY SOLVABLE CASES OF ROBUST DISCRETE OPTIMIZATION PROBLEMS |
|
|
116 | (37) |
|
4.1 Robust 1-Median Location Problem on a Tree |
|
|
116 | (6) |
|
4.2 Robust Multi-period Production Planning with Demand Uncertainty |
|
|
122 | (2) |
|
4.3 Robust Economic Order Quantity (EOQ) Model |
|
|
124 | (13) |
|
4.4 Robust Newsvendor Problems |
|
|
137 | (5) |
|
4.5 Robust Multi-Item Newsvendor Models with a Budget Constraint and Interval Demand Data |
|
|
142 | (5) |
|
4.6 Parameter Robust Distribution Free Newsvendor Models |
|
|
147 | (3) |
|
4.7 A Brief Guide Through Related Literature |
|
|
150 | (1) |
|
|
151 | (2) |
|
5 ALGORITHMIC DEVELOPMENTS FOR DIFFICULT ROBUST DISCRETE OPTIMIZATION PROBLEMS |
|
|
153 | (40) |
|
5.1 A Surrogate Relaxation Based Branch-and-Bound Method |
|
|
153 | (7) |
|
5.2 An Approximation Algorithm |
|
|
160 | (8) |
|
5.3 Computational Results |
|
|
168 | (23) |
|
5.4 A Brief Guide Through Related Literature |
|
|
191 | (1) |
|
|
192 | (1) |
|
6 ROBUST 1-MEDIAN LOCATION PROBLEMS: DYNAMIC ASPECTS AND UNCERTAINTY |
|
|
193 | (48) |
|
6.1 Notation, Problem Formulation and Basic Results |
|
|
197 | (7) |
|
6.2 Robust 1-Median with Linear Node Demands and Edge Distances |
|
|
204 | (5) |
|
6.3 Robust 1-Median with Linear Node Demands |
|
|
209 | (6) |
|
6.4 Robust 1-Median with Linear Edge Distances |
|
|
215 | (6) |
|
6.5 Observations on Uncertain Node Demands and Edge Distances, and Conclusions on Robust 1-Median with Discrete Scenarios |
|
|
221 | (2) |
|
6.6 Robust 1-Median Problem on a Tree with Interval Input Data |
|
|
223 | (12) |
|
6.7 Robust 1-Median on a Tree with Mixed Scenarios |
|
|
235 | (2) |
|
6.8 A Brief Guide Through Related Literature |
|
|
237 | (2) |
|
|
239 | (2) |
|
7 ROBUST SCHEDULING PROBLEMS |
|
|
241 | (49) |
|
7.1 Properties of Robust Schedules for Single Machine Scheduling with Interval Processing Time Data |
|
|
243 | (6) |
|
7.2 Properties of Robust Schedules for Two Machine Flowshop Scheduling with Interval Processing Time Data |
|
|
249 | (5) |
|
7.3 Algorithms for the Robust Single Machine Scheduling Problem with Interval Processing Time Data |
|
|
254 | (12) |
|
7.4 Algorithms for the Robust Two Machine Flowshop Scheduling Problem with Interval Processing Time Data |
|
|
266 | (11) |
|
7.5 Algorithms for the Robust Two Machine Flowshop Scheduling Problem with Discrete Processing Time Data |
|
|
277 | (9) |
|
7.6 A Brief Guide Through Related Literature |
|
|
286 | (3) |
|
|
289 | (1) |
|
8 ROBUST UNCAPACITATED NETWORK DESIGN AND INTERNATIONAL SOURCING PROBLEMS |
|
|
290 | (43) |
|
8.1 Notation and Problem Formulation of Uncapacitated Network Design Problems |
|
|
292 | (2) |
|
8.2 Adaptation of the Benders Decomposition Methodology to the Generation of Robust Network Designs |
|
|
294 | (5) |
|
8.3 A Multi-Master Benders Algorithm For Robust Uncapacitated Network Design Problems |
|
|
299 | (6) |
|
8.4 Robust Network Designs and the Expected Cost Uncapacitated Network Design Problem |
|
|
305 | (1) |
|
8.5 Computational Results |
|
|
306 | (9) |
|
8.6 Notation and Formulation of Robust International Sourcing Problem |
|
|
315 | (3) |
|
8.7 An Algorithm to Generate the N Best Robust Solutions to the International Sourcing Problem |
|
|
318 | (4) |
|
8.8 Computational Performance of the Robust International Sourcing Algorithm |
|
|
322 | (4) |
|
8.9 Managerial Uses of the Robust International Sourcing Model |
|
|
326 | (3) |
|
8.10 A Brief Guide Through Related Literature |
|
|
329 | (2) |
|
|
331 | (2) |
|
9 ROBUST DISCRETE OPTIMIZATION: PAST SUCCESSES AND FUTURE CHALLENGES |
|
|
333 | |
|
9.1 Summary of Main Results |
|
|
334 | (9) |
|
9.2 Implementation Considerations of the Robustness Approach |
|
|
343 | (8) |
|
9.3 Future Research Directions |
|
|
351 | |