Robustness of schedules obtained using the tabu search algorithm based on the average slack method

Abstract

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.