Quality of move-optimal schedules for minimizing total weighted completion time

DOI10.1016/j.orl.2005.08.003zbMath1152.90431OpenAlexW2028177822MaRDI QIDQ2480059

Johann L. Hurink, Tobias Brueggemann, Walter Kern

Publication date: 28 March 2008

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

Full work available at URL: https://doi.org/10.1016/j.orl.2005.08.003

zbMATH Keywords

parallel machinesapproximationtotal weighted completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (4)

Exponential size neighborhoods for makespan minimization scheduling ⋮ Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines ⋮ Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines ⋮ Performance guarantees of local search for minsum scheduling problems

Cites Work

• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
• Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
• Improving local search heuristics for some scheduling problems. II
• Unnamed Item
• Unnamed Item

This page was built for publication: Quality of move-optimal schedules for minimizing total weighted completion time