Linear time algorithms for parallel machine scheduling

Authors:
Zhiyi Tan;Yong He
Affiliations:
Department of Mathematics, State Key Lab of CAD & CG Zhejiang University, Hangzhou, P.R. China;Department of Mathematics, State Key Lab of CAD & CG Zhejiang University, Hangzhou, P.R. China
Venue:
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Year:
2005

Citing 6
Cited 0

Using dual approximation algorithms for scheduling problems theoretical and practical results

Journal of the ACM (JACM)
A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach

SIAM Journal on Computing
A linear compound algorithm for uniform machine scheduling

Computing
Semi on-line scheduling on two identical machines

Computing
Semi on-line algorithms for the partition problem

Operations Research Letters
Semi-on-line problems on two identical machines with combined partial information

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses linear time algorithms for parallel machine scheduling problems. We introduce a kind of threshold algorithms and discuss their main features. Three linear time threshold algorithm classes DT, PT and DTm are studied thoroughly. For all classes, we study their best possible algorithms among each class. We also present their application to several scheduling problems. The new algorithms are better than classical algorithms in time complexity and/or worst-case ratio. Computer-aided proof method is used in the proof of main results, which greatly simplifies the proof and decreases case by case analysis.