Lower bounds on precedence-constrained scheduling for parallel processors.

DOI10.1016/S0020-0190(01)00303-9zbMath1043.68029OpenAlexW1998723022MaRDI QIDQ1853033

Alexandre Eichenberger, Ivan D. Baev, Waleed M. Meleis

Publication date: 21 January 2003

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00303-9

zbMATH Keywords

Parallel processingSchedulingLower bounds

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• NP-complete scheduling problems
• Optimal scheduling for two-processor systems
• Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines
• Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
• Scheduling independent tasks to reduce mean finishing time

This page was built for publication: Lower bounds on precedence-constrained scheduling for parallel processors.