Semi-on-line problems on two identical machines with combined partial information
type: Item
instance of: scholarly article
title: Semi-on-line problems on two identical machines with combined partial information
zbMATH Open document ID: 1013.90064
DOI: 10.1016/S0167-6377(02)00164-5
author: Zhiyi Tan
author: Yong He
published in: Operations Research Letters
publication date: 2003-05-04T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1903540
zbMATH Keywords: semi-on-line
zbMATH Keywords: parallel machine scheduling
zbMATH Keywords: approximation algorithm
zbMATH Keywords: competitive analysis
MaRDI profile type: Publication
cites work: Q4247460
cites work: The optimal on-line parallel machine scheduling
cites work: Ordinal on-line scheduling for maximizing the minimum machine completion time
cites work: Semi on-line scheduling on two identical machines
cites work: Semi on-line algorithms for the partition problem
cites work: Ordinal algorithms for parallel machine scheduling
cites work: Semi-online scheduling with decreasing job sizes
cites work: Semi-on-line scheduling with ordinal data on two uniform machines
cites work: Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times
cites work: A note on on-line scheduling with partial information
full work available at URL: s0167-6377(02)00164-5
OpenAlex ID: W2053558677
description: scientific article; zbMATH DE number 1903540