Extending Graham's result on scheduling to other heuristics

DOI10.1016/S0167-6377(01)00098-0zbMath0993.90048MaRDI QIDQ1604040

Robert R. Goldberg, Jacob Shapiro

Publication date: 3 July 2002

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

zbMATH Keywords

partitioningscheduling theoryNP-hardworst-case analysis

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Complexity and performance of numerical algorithms (65Y20)

Related Items

Extension of algorithm list scheduling for a semi-online scheduling problem

Cites Work

• Tighter bounds on a heuristic for a partition problem
• Partitioning under the \(L_p\) norm
• Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
• Bounds on Multiprocessing Timing Anomalies
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extending Graham's result on scheduling to other heuristics