Extending Graham's result on scheduling to other heuristics
type: Item
instance of: scholarly article
title: Extending Graham's result on scheduling to other heuristics
zbMATH Open document ID: 0993.90048
DOI: 10.1016/S0167-6377(01)00098-0
author: Robert R. Goldberg
author: Jacob Shapiro
published in: Operations Research Letters
publication date: 2002-07-03T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 65Y20
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 1762701
zbMATH Keywords: NP-hard
zbMATH Keywords: partitioning
zbMATH Keywords: scheduling theory
zbMATH Keywords: worst-case analysis
MaRDI profile type: Publication
cites work: Q5501827
cites work: Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
cites work: Q4002885
cites work: Q4198056
cites work: Partitioning under the \(L_p\) norm
cites work: Bounds on Multiprocessing Timing Anomalies
cites work: Q3995531
cites work: Tighter bounds on a heuristic for a partition problem
cites work: Q3525910
Recommended article: On Graham's bound for cyclic scheduling
Recommended article: On the optimality of exact and approximation algorithms for scheduling problems
Recommended article: On the extension complexity of scheduling polytopes
Recommended article: On approximating a scheduling problem
Recommended article: Q4527188
Recommended article: On an extension of the Sort \& Search method with application to scheduling theory
Recommended article: Towards Tight Lower Bounds for Scheduling Problems
Recommended article: Q3115571
Recommended article: A greedy heuristic for solving scheduling problems with bounded rejection cost
Recommended article: On the approximability of an interval scheduling problem
description: scientific article; zbMATH DE number 1762701