Improved algorithm for a generalized on-line scheduling problem on identical machines

被引：2

作者：

Li, Rongheng

Huang, Huei-Chuen

机构：

[1] Natl Univ Singapore, Dept Ind & Syst Engn, Singapore 117576, Singapore

[2] Hunan Normal Univ, Dept Math, Changsha 410081, Peoples R China

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2007年 / 176卷 / 01期

关键词：

scheduling; heuristic; on-line; list scheduling; competitive ratio;

D O I：

10.1016/j.ejor.2005.06.061

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper considers the problem of on-line scheduling a list of independent jobs in which each job has an arbitrary release time on m parallel identical machines. In this problem, jobs arrive in form of order before its release time and decisions have to be made whenever an order is placed and the orders arrive according to any sequence. A heuristic algorithm, NMLS, better than MLS is given for any m >= 2. The competitive ratio is improved from 2.93920 to 2.78436. (c) 2005 Elsevier B.V. All rights reserved.

引用

页码：643 / 652

页数：10

共 50 条

[1] On-line scheduling with rejection on identical parallel machines
Miao C.
Zhang Y.
[J]. Journal of Systems Science and Complexity, 2006, 19 (3) : 431 - 435
[2] Semi on-line scheduling on two identical machines
Department of Applied Mathematics, Zhejiang University, Hangzhou 310027, China
不详
[J]. Comput Vienna New York, 3 (179-187):
[3] Semi on-line scheduling on two identical machines
He, Y
Zhang, G
[J]. COMPUTING, 1999, 62 (03) : 179 - 187
[4] ON-LINE SCHEDULING WITH REJECTION ON IDENTICAL PARALLEL MACHINES
Cuixia MIAO Department of Mathematics
[J]. Journal of Systems Science & Complexity, 2006, (03) : 431 - 435
[5] Semi On-Line Scheduling on Two Identical Machines
Y. He
G. Zhang
[J]. Computing, 1999, 62 : 179 - 187
[6] Randomized on-line and semi-on-line scheduling on identical machines
He, Y
Tan, ZY
[J]. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2003, 20 (01) : 31 - 40
[7] A note on on-line scheduling with precedence constraints on identical machines
Epstein, L
[J]. INFORMATION PROCESSING LETTERS, 2000, 76 (4-6) : 149 - 153
[8] Scheduling on identical machines: How good is LPT in an on-line setting?
Chen, B
Vestjens, APA
[J]. OPERATIONS RESEARCH LETTERS, 1997, 21 (04) : 165 - 169
[9] An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
Nong, Q. Q.
Cheng, T. C. E.
Ng, C. T.
[J]. OPERATIONS RESEARCH LETTERS, 2008, 36 (05) : 584 - 588
[10] An improved branch and bound algorithm for solving the identical parallel machines scheduling problem with family setup times
Bettayeb, B.
Kacem, I.
Adjallah, K. H.
[J]. 2006 IMACS: MULTICONFERENCE ON COMPUTATIONAL ENGINEERING IN SYSTEMS APPLICATIONS, VOLS 1 AND 2, 2006, : 1040 - +

← 1 2 3 4 5 →