A PTAS for the average weighted completion time problem on unrelated machines.

DOI<link itemprop=identifier href="https://doi.org/10.1002/1099-1425(200011/12)3:6<323::AID-JOS52>3.0.CO;2-E" /><323::AID-JOS52>3.0.CO;2-E 10.1002/1099-1425(200011/12)3:6<323::AID-JOS52>3.0.CO;2-EzbMath1028.90519MaRDI QIDQ1592754

Ioannis Milis, Evripidis Bampis, Claire M. Kenyon, Foto N. Afrati

Publication date: 27 July 2003

Published in: Journal of Scheduling (Search for Journal in Brave)

zbMATH Keywords

approximationunrelated machinesPTAS

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems ⋮ Designing PTASs for MIN-SUM scheduling problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines
• A PTAS for minimizing the weighted sum of job completion times on parallel machines
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
• Algorithms for Scheduling Independent Tasks
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
• Task Scheduling in Networks
• Scheduling independent tasks to reduce mean finishing time
• Technical Note—Minimizing Average Flow Time with Parallel Machines

This page was built for publication: A PTAS for the average weighted completion time problem on unrelated machines.