Partitioning under the \(L_p\) norm

DOI10.1016/S0377-2217(99)00112-5zbMath0960.90052OpenAlexW2041765306MaRDI QIDQ1572977

Robert R. Goldberg, Jacob Shapiro

Publication date: 14 February 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00112-5

zbMATH Keywords

scheduling theorymathematical programmingNP-completeworst-case analysis

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25) Marketing, advertising (90B60)

Related Items (3)

A note on minimizing the sum of squares of machine completion times on two identical parallel machines ⋮ A fast and effective subset sum based improvement procedure for workload balancing on identical parallel machines ⋮ Extending Graham's result on scheduling to other heuristics

Cites Work

• Tighter bounds on a heuristic for a partition problem
• 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: Partitioning under the \(L_p\) norm