Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems

Autor(en): Brucker, P
Kramer, A
Stichwörter: Business & Economics; flow shop; job shop; Management; multiprocessor scheduling; Operations Research & Management Science; resource-constrained scheduling; scheduling
Erscheinungsdatum: 1996
Herausgeber: ELSEVIER SCIENCE BV
Journal: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volumen: 90
Ausgabe: 2
Startseite: 214
Seitenende: 226
Zusammenfassung: 
Resource-constrained scheduling problems with a fixed number of task types are considered in which, in addition, either the processing times are bounded or the number of processors is fixed. For problems with makespan, (weighted) mean now time, weighted number of tardy tasks, and sum of tardiness as objective functions polynomial time algorithms are presented. These algorithms generalize results derived by Blaiewicz ct al. (1989) for makespan problems and solve open problems listed by Hoogeveen et al. (1994). Furthermore, results for shop problems with multiprocessor tasks and unit processing times, in which either the number of jobs or the number of stages is fixed, are derived.
Beschreibung: 
4th EURO Working-Group-on-Project-Management-and-Scheduling - Project Management and Scheduling, LOUVAIN, BELGIUM, JUL 12, 1994-JUL 15, 1995
ISSN: 03772217
DOI: 10.1016/0377-2217(95)00350-9

Show full item record

Page view(s)

1
Last Week
0
Last month
0
checked on Mar 3, 2024

Google ScholarTM

Check

Altmetric