First fit decreasing scheduling on uniform multiprocessors

DOI10.1016/0166-218X(85)90010-1zbMath0571.90037OpenAlexW2093017196MaRDI QIDQ1061602

Manfred Kunde, Horst Steppat

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0166-218x(85)90010-1

zbMATH Keywords

nonpreemptive schedulingworst case ratioIndependent tasksuniform multiprocessor systems

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

Approximation scheduling algorithms: a survey

Cites Work

• NP-complete scheduling problems
• Bounds for Multifit Scheduling on Uniform Processors
• Bounds for LPT Schedules on Uniform Processors
• An Application of Bin-Packing to Multiprocessor Scheduling
• Bounds on Multiprocessing Timing Anomalies
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item