A tight bound for 3-partitioning

DOI10.1016/0166-218X(93)90013-EzbMath0798.68020MaRDI QIDQ1309812

Hans Kellerer, Gerhard J. Woeginger

Publication date: 4 January 1994

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

zbMATH Keywords

multiprocessor schedulingworst-case analysis3-partitionLPT-algorithm

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 (11)

\(\kappa\)-partitioning problems for maximizing the minimum load ⋮ Three-partitioning containing kernels: Complexity and heuristic ⋮ An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints ⋮ Computer-assisted proof of performance ratios for the differencing method ⋮ Approximation algorithms for \(k\)-partitioning problems with partition matroid constraint ⋮ Lower bounds and modified LPT algorithm for \(k\)-partitioning problems with partition matroid constraint ⋮ Optimal matroid partitioning problems ⋮ \(k\)-partitioning problems with partition matroid constraint ⋮ Unnamed Item ⋮ Optimizing crew rostering with multilicense on high-speed railway lines ⋮ The \(k\)-partitioning problem

Cites Work

• Bounds on Multiprocessing Timing Anomalies
• Unnamed Item

This page was built for publication: A tight bound for 3-partitioning