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

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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Operational research Jg. 21; H. 1; S. 55 - 71
Hauptverfasser:	Ben Abdellafou, Khaoula, Hadda, Hatem, Korbaa, Ouajdi
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2021 Springer Nature B.V
Schlagworte:	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
ISSN:	1109-2858, 1866-1505
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!