Quality of move-optimal schedules for minimizing total weighted completion time
type: Item
instance of: scholarly article
title: Quality of move-optimal schedules for minimizing total weighted completion time
zbMATH Open document ID: 1152.90431
published in: Operations Research Letters
publication date: 2008-03-28T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5255512
zbMATH Keywords: parallel machines
zbMATH Keywords: total weighted completion time
zbMATH Keywords: approximation
author: Tobias Brueggemann
author: Johann L. Hurink
author: Walter Kern
MaRDI profile type: MaRDI publication profile
full work available at URL: j.orl.2005.08.003
OpenAlex ID: W2028177822
cites work: Improving local search heuristics for some scheduling problems. II
cites work: Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
cites work: Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
cites work: Q4537756
cites work: Q4788095
DOI: 10.1016/J.ORL.2005.08.003
Recommended article: Minimizing the total weighted completion time in the relocation problem
Recommended article: Q4641267
Recommended article: Q3328238
Recommended article: On the existence of schedules that are near-optimal for both makespan and total weighted completion time
Recommended article: Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations
Recommended article: Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds
Recommended article: Q5171598
Recommended article: Minimizing completion time for a class of scheduling problems
Recommended article: Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines
Recommended article: Q3569627
description: scientific article; zbMATH DE number 5255512