Scheduling independent two processor tasks on a uniform duo-processor system

DOI10.1016/0166-218X(90)90090-YzbMath0715.90069OpenAlexW2018494064WikidataQ57387914 ScholiaQ57387914MaRDI QIDQ751995

Jacek Błażewicz, Dominique de Werra, Maciej Drozdowski, Günter Schmidt

Publication date: 1990

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(90)90090-y

zbMATH Keywords

polynomial-time algorithmpreemptive schedulingscheduling multiprocessor tasks

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Distributed algorithms (68W15)

Related Items

Deadline scheduling of multiprocessor tasks, A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks, Scheduling chained multiprocessor tasks onto large multiprocessor system, Hybrid flow-shop scheduling problems with multiprocessor task systems., Scheduling multiprocessor tasks -- An overview, Scheduling multiprocessor tasks with chain constraints

Cites Work

• Unnamed Item
• Scheduling independent 2-processor tasks to minimize schedule length
• Scheduling on semi-identical processors
• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• Preemptive Scheduling of Uniform Processor Systems