Robustness of Schedules Obtained Using the Tabu Search Algorithm Based on the Average Slack Method

• Iwona Paprocka ^[1] ; Aleksander Gwiazda ^[1] ; Magdalena Bączkowicz ^[1]
  1. [1] Silesian University of Technology

     Silesian University of Technology

     Gliwice, Polonia

     
• Localización: International Joint Conference SOCO’16-CISIS’16-ICEUTE’16: San Sebastián, Spain, October 19th-21st, 2016 Proceedings / coord. por Manuel Graña Romay, José Manuel López Guede, Oier Etxaniz, Álvaro Herrero Cosío, Héctor Quintián Pardo, Emilio Santiago Corchado Rodríguez, 2017, ISBN 978-3-319-47364-2, págs. 426-434
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • One of the most important problems consider with the scheduling process is to ensure the needed level of robustness of obtained schedules. One of possible tools that could be used to realize this objective is the Taboo Search Algorithm (TSA). The Average Slack Method (ASM) enables to obtain the best performance of the job shop system. In the paper is presented analysis of two objectives: to achieve the best compromise basic schedule for four efficiency measures as well as to achieve the best compromise reactive schedule. It was investigated of 15 processes executed on 10 machines. It was shown that ASM enables the obtainment of the best performance of the job shop system.