A sensitivity analysis to assess the completion time deviation for multi-purpose machines facing demand uncertainty

• Akçali, E., Nemoto, K., & Uzsoy, R. (2001). Cycle-time improvements for photolithography process in semiconductor manufacturing. IEEE Transaction on Semiconductor Manufacturing, 14(1), 48–56.

  Article  Google Scholar 

• Aubry, A., Rossi, A., & Jacomino, M. (2008a). Minimizing setup costs for parallel multi-purpose machines under load-balancing constraint. European Journal of Operational Research, 187(3), 1115–1125.

  Article  Google Scholar 

• Aubry, A., Rossi, A., & Jacomino, M. (2008b). Sensitivity analysis for the configuration of a multi-purpose machines workshop. In International federation of automatic control, Seoul, South Korea. Available at http://sites.google.com/site/aubryalexis/.

  Google Scholar 

• Aubry, A., Rossi, A., & Jacomino, M. (2009). A generic off-line approach for dealing with uncertainty in optimisation. In Preprints of the 13th IFAC symposium on information control problems in manufacturing, Moscow, Russia, 3–5 June (pp. 1464–1469).

  Google Scholar 

• Brucker, P., Jurisch, B., & Kramer, A. (1997). Complexity of scheduling problems with multi-purpose machines. Annals of Operational Research, 70, 57–73.

  Article  Google Scholar 

• Billaut, J.-C., Moukrim, A., & Sanlaville, E. (2008). Flexibility and robustness in scheduling. London: ISTE Ltd, Wiley.

  Book  Google Scholar 

• Espinouse, M.-L., Jacomino, M., & Rossi, A. (2008). The robustness of multi-purpose machines workshop configuration. In Flexibility and robustness in scheduling. London: ISTE Ltd, Wiley.

  Google Scholar 

• Graham, R., Lawler, E., Lenstra, J., & Rinnooy Kan, A. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 287–326.

  Article  Google Scholar 

• Kouvelis, P., & Yu, G. (1997). Robust discrete optimization and its applications. Dordrecht: Kluwer Academic.

  Google Scholar 

• Kouvelis, P., Kurawarwala, A. A., & Gutiérrez, G. J. (1992). Algorithms for robust single and multiple period layout planning for manufacturing systems. European Journal of Operational Research, 63, 287–303.

  Article  Google Scholar 

• Lawler, E., & Labetoulle, J. (1978). On preemptive scheduling of unrelated parallel processors by linear programming. Journal of the Association for Computing Machinery, 25, 612–619.

  Google Scholar 

• Leung, J., & Li, C.-L. (2008). Scheduling with processing set restrictions: a survey. International Journal of Production Economics, 116, 251–262.

  Article  Google Scholar 

• Nourine, L., & Raynaud, O. (1999). A fast algorithm for building lattices. Information Processing Letters, 71(5–6), 199–204.

  Article  Google Scholar 

• Penz, B., Rapine, C., & Trystram, D. (2001). Sensitivity analysis of scheduling algorithms. European Journal of Operational Research, 134, 606–615.

  Article  Google Scholar 

• Renegar, J. (1988). A polynomial-time algorithm, based on Newton’s method, for linear programming. Mathematical Programming, 40, 59–93.

  Article  Google Scholar 

• Rossi, A. (2003). Ordonnancement en milieu incertain, mise en œuvre d’une démarche robuste. Ph.D. thesis, Institut National Polytechnique de Grenoble, France.

• Snyder, L. V. (2006). Facility location under uncertainty: a review. IIE Transactions, 38(7), 547–564.

  Article  Google Scholar 

• Wright, S. (1997). Primal-dual interior-point methods. Philadelphia: Society for Industrial and Applied Mathematics.

  Book  Google Scholar 

• Yoon, H. J., & Lee, D. Y. (2004). Deadlock-free scheduling of photolithography equipment in semiconductor fabrication. IEEE Transaction on Semiconductor Manufacturing, 17(1), 42–54.

  Article  Google Scholar 

Download references