A semi-online algorithm and its competitive analysis for a single machine scheduling problem with bounded processing times
From MaRDI portal
Publication:974714
DOI10.3934/jimo.2010.6.269zbMath1189.90068OpenAlexW2089643645MaRDI QIDQ974714
Yu-Geng Xi, Jiping Tao, Zhijun Chao
Publication date: 7 June 2010
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2010.6.269
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items (9)
A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time ⋮ A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection ⋮ Online scheduling to minimize the total weighted completion time plus the rejection cost ⋮ Semi-online scheduling: a survey ⋮ On competitive analysis for polling systems ⋮ Online scheduling with linear deteriorating jobs to minimize the total weighted completion time ⋮ Simulated annealing and genetic algorithm based method for a bi-level \textit{seru} loading problem with worker assignment in \textit{seru} production systems ⋮ A \(2.28\)-competitive algorithm for online scheduling on identical machines ⋮ A Semi-Online Algorithm for Single Machine Scheduling with Rejection
This page was built for publication: A semi-online algorithm and its competitive analysis for a single machine scheduling problem with bounded processing times
