A robustness measure of the configuration of multi-purpose machines

This paper presents new results for assessing the robustness of a configuration for multi-purpose machines. The workshop manager is provided with quantitative and meaningful information on how a configuration behaves when disturbances affect the demand. Thus, configurations can be compared on the basis of temporal performance, and also on robustness. The robustness measure of a configuration is returned by assessing the minimum magnitude of disturbances affecting the forecast demand that may lead to breaking the deadline provided by the decision-maker. First, it is shown how to minimise the completion time for a given demand. The demands such that the deadline can be met for a given configuration are then characterised, and two robustness measures for a configuration are also provided. The theoretical results are illustrated in detail using an application example.

[1]  D. Atkin.  OR scheduling algorithms. , 2000, Anesthesiology.

[2]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[3]  Albert P. M. Wagelmans,et al.  On the calculation of the stability radiusof an optimal or an approximate schedule , 1998, Ann. Oper. Res..

[4]  Hyun Joong Yoon,et al.  Deadlock-free scheduling of photolithography equipment in semiconductor fabrication , 2004, IEEE Transactions on Semiconductor Manufacturing.

[5]  Peter Brucker,et al.  Complexity of scheduling problems with multi-purpose machines , 1997, Ann. Oper. Res..

[6]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[7]  Alexis Aubry,et al.  Optimisation pour la configuration robuste de systèmes de production de biens et de services , 2007 .

[8]  Marie-Laure Espinouse,et al.  Minimizing setup costs for parallel multi-purpose machines under load-balancing constraint , 2008, Eur. J. Oper. Res..

[9]  Jean-Charles Billaut,et al.  Flexibility and Robustness in Scheduling , 2008 .

[10]  Lhouari Nourine,et al.  A Fast Algorithm for Building Lattices , 1999, Inf. Process. Lett..

[11]  Bernard Roy.  On operational research and decision aid , 1994 .

[12]  R. Uzsoy,et al.  Cycle-time improvements for photolithography process in semiconductor manufacturing , 2001 .

[13]  Yuval Rabani,et al.  Linear Programming , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[14]  A. Rossi,et al.  Ordonnancement en milieu incertain, mise en oeuvre d'une démarche robuste , 2003 .

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[16]  Egon Balas,et al.  Integer Programming , 2021, Encyclopedia of Optimization.