scientific article; zbMATH DE number 1990707

MaRDI QIDQ4430874zbMATH OpenFDO

Authors Robert R. Goldberg, Jacob Shapiro, Isak Taksa

Publication date 13 October 2003

zbMATH Keywords

analysis of algorithmscompetitive ratiogreedy heuristicheuristicsoffline-scheduling

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Extending Graham's result on scheduling to other heuristics
• An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
• Ideal schedules in parallel machine settings
• Greed in resource scheduling
• New lower and upper bounds for on-line scheduling

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4430874)