Bounds on delay start LPT algorithm for scheduling on two identical machines in the lp norm

Journal of Industrial and Management Optimization

Volumn 4, Issue 4, 2008, Pages 817-826

  Lin, Ling ^a   He, Dong ^b   Tan, Zhiyi ^b  

^a ZHEJIANG UNIVERSITY   (China)

^b ZHEJIANG UNIVERSITY   (China)

Author keywords

Design and analysis of algorithms; lp norm; Parallel machine; Scheduling

Indexed keywords

EID: 56649084869     PISSN: 15475816     EISSN: 1553166X     Source Type: Journal    
DOI: 10.3934/jimo.2008.4.817     Document Type: Article

References (12)

1. N. Alon, Y. Azar, G. J. Woeginger and T. Yadid, Approximation schemes for scheduling on parallel machines, Journal of Scheduling, 1 (1998), 55-66.
2. p norm, Algorithmica, 29 (2001), 422-441.
3. Y. Azar, L. Epstein, Y. Richtera and G. J. Woeginger, All-norm approximation algorithms, Journal of Algorithms, 52 (2004), 120-133.
4. A. K. Chandra and C. K. Wong, Worst-case analysis of placement algorithm related to storage allocation, SIAM Journal on Computing, 1 (1975), 249-263.
5. p norm on two processors, Journal of Industrial and Management Optimization, 1 (2005), 345-351.
6. R. L. Graham, Bounds for certain multiprocessor anomalies, Bell Systems Technical Journal, 45 (1966), 1563-1581.
7. R. L. Graham, Bounds on multiprocessing timing anomalies, SIAM Journal on Applied Mathematics, 17 (1969), 416-429.
8. C. Koulamas and G. J. Kyparisis, An improved delayed-start LPT algorithm for a partition problem on two identical parallel machines, European Journal of Operational Research, 187 (2008), 660-666.
9. J. Y. T. Leung and W. D. Wei, Tighter bounds on a heuristic for a partition problem, Information Processing Letters, 56 (1995), 51-57.
10. p norm on two identical machines, Journal of Zhejiang University Science, 6A (2005), 20-26.
11. S. Sahni, Algorithms for scheduling independent tasks, Journal of the Association of Computing Machinery, 23 (1976), 116-127.
12. p norm, Lecture Notes in Computer Science, 5034 (2008), 316-327.