Optimal online algorithm for scheduling on two identical machines with machine availability constraints.
type: Item
instance of: scholarly article
title: Optimal online algorithm for scheduling on two identical machines with machine availability constraints.
zbMATH Open document ID: 1043.90033
DOI: 10.1016/S0020-0190(02)00211-9
author: Zhiyi Tan
author: Yong He
published in: Information Processing Letters
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1856428
zbMATH Keywords: Analysis of algorithms
zbMATH Keywords: Scheduling
zbMATH Keywords: Online
zbMATH Keywords: Competitive ratio
MaRDI profile type: Publication
cites work: Q4527046
cites work: The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines
cites work: Two-machine flowshop scheduling with consecutive availability constraints
cites work: Parallel machines scheduling with machine shutdowns
cites work: Parallel machines scheduling with nonsimultaneous machine available time
cites work: Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
cites work: Two-machine flowshop scheduling with availability constraints
cites work: A note on ''parallel machine scheduling with non-simultaneous machine available time''
cites work: Current trends in deterministic scheduling
full work available at URL: s0020-0190(02)00211-9
OpenAlex ID: W2046781886
description: scientific article; zbMATH DE number 1856428