Worst-case analysis of a scheduling algorithm

DOI10.1016/0167-6377(85)90043-4zbMath0569.90045OpenAlexW2075962074MaRDI QIDQ1060946

Jeremy P. Spinrad

Publication date: 1985

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(85)90043-4

zbMATH Keywords

heuristicindependent tasksscheduling algorithmworst-case behaviorunrelated processors

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)

Related Items

Unrelated parallel machine scheduling using local search, Heuristics for scheduling unrelated parallel machines, Heuristic methods and applications: A categorized survey

Cites Work

• Unnamed Item
• Algorithms for Scheduling Tasks on Unrelated Processors
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
• Scheduling independent tasks to reduce mean finishing time