An improved delayed-start LPT algorithm for a partition problem on two identical parallel machines

European Journal of Operational Research

Volumn 187, Issue 2, 2008, Pages 660-666

  Koulamas, Christos ^a   Kyparisis, George J ^a  

^a FLORIDA INTERNATIONAL UNIVERSITY   (United States)

Author keywords

Approximation algorithms; LPT; Parallel machines; Scheduling

Indexed keywords

OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; SCHEDULING;

LPT; PARALLEL MACHINES; PARTITION PROBLEM; RATIO BOUND;

APPROXIMATION ALGORITHMS;

EID: 36049001129     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2007.04.013     Document Type: Article

References (6)

1. Alon, N., Azar, Y., Woeginger, G.J., Yadid, T., 1997. Approximation schemes for scheduling. In: Proceedings of the 8th Symposium on Discrete Algorithms, pp. 493-500.
2. Chandra A.K., and Wong C.K. Worst-case analysis of a placement algorithm related to storage allocation. SIAM Journal of Computing 4 (1975) 249-263
3. Graham R.L. Bounds on multiprocessing timing anomalies. SIAM Journal of Applied Mathematics 17 (1969) 416-429
4. He Y., Kellerer H., and Kotov V. Linear compound algorithms for the partitioning problem. Naval Research Logistics 47 (2000) 593-601
5. Leung J.Y.-T., and Wei W.-D. Tighter bounds on a heuristic for a partition problem. Information Processing Letters 56 (1995) 51-57
6. Tan Z., He Y., and Epstein L. Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data. Information and Computation 196 (2005) 57-70