A Heuristic of Scheduling Parallel Tasks and Its Analysis

DOI10.1137/0221021zbMath0756.90053OpenAlexW2028801713MaRDI QIDQ3990654

Kam Hoi Cheng, Qingzhou Wang

Publication date: 28 June 1992

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0221021

zbMATH Keywords

makespanprecedence constraintsidentical parallel machinesperformance ratioearliest completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (11)

Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors ⋮ On chromatic sums and distributed resource allocation ⋮ On-line scheduling of parallel jobs ⋮ Efficient approximation algorithms for scheduling moldable tasks ⋮ Optimal workforce assignment to operations of a paced assembly line ⋮ An effective approximation algorithm for the malleable parallel task scheduling problem ⋮ Global EDF scheduling for parallel real-time tasks ⋮ Competitive online scheduling of perfectly malleable jobs with setup times ⋮ Multi-core real-time scheduling for generalized parallel task models ⋮ On-line scheduling of parallel jobs with runtime restrictions ⋮ Scheduling multiprocessor tasks -- An overview

This page was built for publication: A Heuristic of Scheduling Parallel Tasks and Its Analysis