A semi-online algorithm and its competitive analysis for a single machine scheduling problem with bounded processing times
type: Item
instance of: scholarly article
title: A semi-online algorithm and its competitive analysis for a single machine scheduling problem with bounded processing times
zbMATH Open document ID: 1189.90068
author: Jiping Tao
author: Zhijun Chao
author: Yugeng Xi
published in: Journal of Industrial and Management Optimization
publication date: 2010-06-07T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5717704
zbMATH Keywords: single machine scheduling
zbMATH Keywords: online algorithms
zbMATH Keywords: competitive analysis
MaRDI profile type: Publication
full work available at URL: jimo.2010.6.269
OpenAlex ID: W2089643645
DOI: 10.3934/JIMO.2010.6.269
Recommended article: An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time
Recommended article: An optimal online algorithm for single machine scheduling with bounded delivery times
Recommended article: An optimal online algorithm for single machine scheduling to minimize total general completion time
Recommended article: Semi-online algorithms for parallel machine scheduling problems
Recommended article: OPTIMAL SEMI-ONLINE ALGORITHM FOR SCHEDULING ON A BATCH PROCESSING MACHINE
Recommended article: Optimal Semi-online Algorithm for Scheduling on a Batch Processing Machine
Recommended article: Q3052570
Recommended article: Optimal Semi-online Scheduling Algorithms on a Small Number of Machines
Recommended article: A Semi-Online Algorithm for Single Machine Scheduling with Rejection
description: scientific article; zbMATH DE number 5717704