An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time
type: Item
instance of: scholarly article
title: An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time
zbMATH Open document ID: 1412.90053
author: Ran Ma
author: Jiping Tao
published in: Journal of Industrial and Management Optimization
publication date: 2019-02-05T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 7012487
zbMATH Keywords: scheduling
zbMATH Keywords: online algorithms
zbMATH Keywords: competitive analysis
zbMATH Keywords: total weighted completion time
zbMATH Keywords: parallel machine
MaRDI profile type: Publication
full work available at URL: jimo.2017057
OpenAlex ID: W2642679724
cites work: Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
cites work: The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates
cites work: LP-based online scheduling: From single to parallel machines
cites work: Single machine scheduling with release dates
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
cites work: Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
cites work: On-line scheduling of parallel machines to minimize total completion times
cites work: Online scheduling with linear deteriorating jobs to minimize the total weighted completion time
cites work: On-line scheduling to minimize average completion time revisited.
cites work: Minimizing average completion time in the presence of release dates
cites work: Efficient Algorithms for Average Completion Time Scheduling
cites work: A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time
cites work: A \(2.28\)-competitive algorithm for online scheduling on identical machines
cites work: Q4368485
DOI: 10.3934/JIMO.2017057
description: scientific article; zbMATH DE number 7012487