Extension of algorithm list scheduling for a semi-online scheduling problem
type: Item
instance of: scholarly article
title: Extension of algorithm list scheduling for a semi-online scheduling problem
zbMATH Open document ID: 1158.90347
author: Yong He
author: György Dósa
published in: CEJOR. Central European Journal of Operations Research
publication date: 2009-04-14T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5542926
zbMATH Keywords: Analysis of algorithm
zbMATH Keywords: Scheduling
zbMATH Keywords: Semi-online
zbMATH Keywords: Competitive ratio
MaRDI profile type: Publication
full work available at URL: s10100-006-0003-x
OpenAlex ID: W1980874942
cites work: Better Bounds for Online Scheduling
cites work: On randomized online scheduling
cites work: Semi-online algorithms for parallel machine scheduling problems
cites work: Extending Graham's result on scheduling to other heuristics
cites work: Bounds on Multiprocessing Timing Anomalies
cites work: Q3031924
cites work: The optimal on-line parallel machine scheduling
cites work: Semi-online scheduling jobs with tightly-grouped processing times on three identical machines
cites work: Semi on-line scheduling on two identical machines
cites work: Semi on-line algorithms for the partition problem
cites work: A Better Algorithm for an Ancient Scheduling Problem
DOI: 10.1007/S10100-006-0003-X
description: scientific article; zbMATH DE number 5542926