Q5319420
type: Item
instance of: scholarly article
zbMATH Open document ID: 1174.90494
author: Jinzhi Tan
publication date: 2009-07-22T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5583893
zbMATH Keywords: scheduling
zbMATH Keywords: online
zbMATH Keywords: semi-online
zbMATH Keywords: approximation algorithm
zbMATH Keywords: competitive ratio
MaRDI profile type: Publication
Recommended article: Q4709623
Recommended article: The on-line preemptive scheduling on parallel machines which have nonsimultaneous machine available times
Recommended article: Semi-online algorithms for parallel machine scheduling problems
Recommended article: SEMI-ON-LINE PARALLEL MACHINES SCHEDULING UNDER KNOWN TOTAL AND LARGEST PROCESSING TIMES
Recommended article: ONLINE AND SEMI-ONLINE SCHEDULING ON CAPACITATED TWO-PARALLEL MACHINES
Recommended article: On-line scheduling of parallel machines to minimize total completion times
Recommended article: Online scheduling on parallel machines: A survey
Recommended article: Semi-on-line scheduling problems for maximizing the minimum machine completion time
Recommended article: The optimal on-line parallel machine scheduling
Recommended article: On an on-line scheduling problem for parallel jobs
description: scientific article; zbMATH DE number 5583893