Coffman-Graham scheduling of UET task systems with 0-1 resources

DOI10.1016/0020-0190(81)90075-2zbMath0454.68014OpenAlexW2095373190MaRDI QIDQ1149763

Errol L. Lloyd

Publication date: 1981

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(81)90075-2

zbMATH Keywords

list schedule

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Algorithms for minimizing maximum lateness with unit length tasks and resource constraints

Cites Work

• List scheduling bounds for UET systems with resources
• Bounds on list scheduling of UET tasks with restricted resource constraints
• Optimal scheduling for two-processor systems
• Worst Case Analysis of Two Scheduling Algorithms

This page was built for publication: Coffman-Graham scheduling of UET task systems with 0-1 resources