Abstract
This paper focuses on the configuration of a parallel multi-purpose machines workshop. An admissible configuration must be chosen in order to ensure that a load-balanced production plan meeting the demand exists. Moreover, the demand is strongly subject to uncertainties. That is the reason why the configuration must exhibit robustness properties: the load-balancing performance must be guaranteed with regard to a given range of uncertainties. A branch-and-bound approach has been developed and implemented to determine a cost-constrained configuration that maximizes a robustness level. Computational results are reported for both academic and industrial-scale instances. More than 80% of the academic instances are solved to optimality by the proposed method. Moreover, this method appears to be a good heuristic for industrial-scale instances.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Allahverdi, A., Gupta, J., & Aldowaisan, T. (1999). A review of scheduling research involving setup considerations. OMEGA—The International Journal of Management Science, 27, 219–239.
Allahverdi, A., Cheng, T., & Kovalyov, M. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187(3), 985–1032.
Aubry, A., Rossi, A., Espinouse, M. L., & Jacomino, M. (2008). Minimizing setup costs for parallel multi-purpose machines under load-balancing constraint. European Journal of Operational Research, 187(3), 1115–1125.
Ben-Tal, A., & Nemirovski, A. (2000). Robust solutions of linear programming problems contaminated with uncertain data. Mathematical Programming, 88, 411–424.
Bertsimas, D., & Sim, M. (2004). The price of robustness. Operations Research, 54(1), 35–53.
Billaut, J. C., Moukrim, A., & Sanlaville, E. (2008). Flexibility and robustness in scheduling. London: ISTE Ltd.
Brucker, P., Jurisch, B., & Krämer, A. (1997). Complexity of scheduling problems with multi-purpose machines. Annals of Operational Research, 70, 57–73.
Demeulemeester, E., & Herroelen, W. (2007). Introduction to the special issue: project scheduling under uncertainty. Journal of Scheduling, 10(3), 151–152.
Gurevsky, E., Guschinskaya, O., & Dolgui, A. (2010). Assembly line balancing problems under uncertainties. In 25th mini-Euro conference: uncertainty and robustness in planning and decision making (URPDM2010), Portugal.
Hall, N., & Posner, M. (2004). Sensitivity analysis for scheduling problems. Journal of Scheduling, 7, 49–83.
Johnzen, C., Dauzere-Peres, S., Vialetelle, P., & Yugma, C. (2007). Importance of qualification management for wafer fabs. In Advanced semiconductor manufacturing conference, ASMC2007, IEEE/SEMI.
Johnzen, C., Dauzère-Pérès, S., Vialetelle, P., & Yugma, C. (2009). Optimizing flexibility and equipment utilization through qualification management. In Advanced semiconductor manufacturing conference, ASMC2009, IEEE/SEMI.
Kouvelis, P., & Yu, G. (1997). Robust discrete optimization and its applications. Dordrecht: Kluwer Academic.
Leung, J. T., & Li, C. L. (2009). Scheduling with processing set restrictions: a survey. International Journal of Production Economics, 116, 251–262.
Miwa, T., Nishihara, N., & Yamamoto, K. (2005). Automated stepper load balance allocation system. IEEE Transactions on Semiconductor Manufacturing, 18, 510–516.
Montemanni, R., & Gambardella, L. (2005). The robust shortest path problem with interval data via benders decomposition. 4OR, 3, 315–328.
Nourine, L., & Raynaud, O. (1999). A fast algorithm for building lattices. Information Processing Letters, 71, 199–204.
Rossi, A. (2003). Ordonnancement en milieu incertain, mise en œuvre d’une démarche robuste. Ph.D. thesis, Institut National Polytechnique de Grenoble, France.
Rossi, A. (2010). A robustness measure of the configuration of multi-purpose machines. International Journal of Production Research, 48(4), 1013–1033.
Rossi, A., Jacomino, M., & Espinouse, M. L. (2004). Étude de robustesse: configuration d’un parc de machines partiellement multifonctions. Journal Européen des Systèmes Automatisés, 34, 373–395.
Roy, B. (2010). Robustness in operational research and decision aiding: a multi-faceted issue. European Journal of Operational Research, 200(3), 629–638. doi:10.1016/j.ejor.2008.12.036.
Sotskov, Y., Tanaev, V., & Werner, F. (1998a). Stability radius of an optimal schedule: a survey and recent developments. In Yu, G. (Ed.) Industrial applications of combinatorial optimization (pp. 72–108). Dordrecht: Kluwer Academic.
Sotskov, Y., Wagelmans, A., & Werner, F. (1998b). On the calculation of the stability radius of an optimal or an approximate schedule. Annals of Operations Research, 83, 213–252.
Taniguchi, F., Yamada, T., & Kataoka, S. (2008). Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem. Computers and Operations Research, 35, 2034–2048.
Vincke, P. (1999). Robust solutions and methods in decision-aid. Journal of Multi-Criteria Decision Analysis, 8, 181–187.
Williams, T. (1999). Recipe management: a matter of efficiency. In Semiconductor fabtech (pp. 47–51).
Zieliński, P. (2004). The computational complexity of the relative robust shortest path problem with interval data. European Journal of Operational Research, 158, 570–576.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Aubry, A., Jacomino, M., Rossi, A. et al. Maximizing the configuration robustness for parallel multi-purpose machines under setup cost constraints. J Sched 15, 457–471 (2012). https://doi.org/10.1007/s10951-011-0257-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-011-0257-6