On-line scheduling of parallel machines to minimize total completion times
type: Item
instance of: scholarly article
title: On-line scheduling of parallel machines to minimize total completion times
zbMATH Open document ID: 1175.90177
author: Peihai Liu
author: Xiwen Lu
published in: Computers \& Operations Research
publication date: 2009-04-03T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5539864
zbMATH Keywords: parallel machine scheduling
zbMATH Keywords: analysis of algorithm
zbMATH Keywords: on-line algorithm
MaRDI profile type: Publication
full work available at URL: j.cor.2008.11.008
OpenAlex ID: W2009134658
cites work: Q4194705
cites work: Q4368485
cites work: Approximation techniques for average completion time scheduling
cites work: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
cites work: On-line scheduling to minimize average completion time revisited.
cites work: LP-Based Online Scheduling: From Single to Parallel Machines
cites work: Optimal on-line algorithms for single-machine scheduling
cites work: Scheduling jobs that arrive over time
cites work: A class of on-line scheduling algorithms to minimize total completion time
cites work: Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
DOI: 10.1016/J.COR.2008.11.008
description: scientific article; zbMATH DE number 5539864