Heuristic algorithms for scheduling intrees on m machines with non-availability constraints

• Published in: Operational research Vol. 21; no. 1; pp. 55 - 71
• Main Authors: Ben Abdellafou, Khaoula, Hadda, Hatem, Korbaa, Ouajdi
• Format: Journal Article
• Language: English
• Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2021; Springer Nature B.V
• Subjects: Applications programs; Availability; Business and Management; Computational Intelligence; Computer simulation; Computing costs; Computing time; Dependence; Heuristic; Heuristic methods; Heuristic task scheduling; Job shops; Lower bounds; Management Science; Operations Research; Operations Research/Decision Theory; Optimization; Original Paper; Polynomials; Precedence constraints; Preventive maintenance; Production scheduling; Schedules; Scheduling; Search algorithms; Tabu search; Non-availability; Scheduling; Makespan; Tabu search; Intree; Heuristic

Many real-world scheduling problems are solved to obtain optimal solutions in terms of processing time, cost, and quality as optimization objectives. Parallel computing systems promise higher performance for computationally intensive applications. Since programs for parallel systems consist of tasks...