An Improved Tabu Search Meta-heuristic Approach for Solving Scheduling Problem with Non-availability Constraints

• Published in: Arabian journal for science and engineering (2011) Vol. 44; no. 4; pp. 3369 - 3379
• Main Authors: Ben Abdellafou, Khaoula, Hadda, Hatem, Korbaa, Ouajdi
• Format: Journal Article
• Language: English
• Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.04.2019; Springer Nature B.V
• Subjects: Algorithms; Completion time; Computational efficiency; Computing time; Engineering; Heuristic; Heuristic methods; Humanities and Social Sciences; Job shops; Lower bounds; multidisciplinary; Precedence constraints; Preventive maintenance; Production scheduling; Research Article - Computer Engineering and Computer Science; Scheduling; Science; Searching; Tabu search; Non-availability constraints; Precedence constraints; Parallel computing; Tabu search; Neighbourhoods; Machines

In this paper, the problem of scheduling on parallel machines subject to non-availability constraints with precedence constraints between the tasks is treated. We consider the minimization of the maximum completion time (i.e., makespan). We propose to use a meta-heuristic entitled tabu search to sol...