A posterior competitiveness for list scheduling algorithm on machines with eligibility constraints

被引：12

作者：

Hwang, HC

Chang, SY

Hong, YS

机构：

[1] Chosun Univ, Dept Ind Engn, Gwangju 501709, South Korea

[2] Pohang Univ Sci & Technol, Dept Ind Engn, Div Elect & Comp Engn, Pohang 790784, South Korea

来源：

ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH | 2004年 / 21卷 / 01期

关键词：

on-line parallel machine scheduling; machine eligibility; competitive ratio;

D O I：

10.1142/S0217595904000084

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

We consider the on-line problem of scheduling n independent jobs on m identical machines under the machine eligibility constraints, where each job has its own specified subset of machines which are eligible for processing it. We investigate a greedy algorithm LS and prove its posterior competitiveness ratio is log(2) 4/lambdam - 1/lambda, where lambda is the number of machines eligible for processing the job with the latest completion time.

引用

页码：117 / 125

页数：9

共 50 条

[11] On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints
Zhang, An
OPERATIONS RESEARCH LETTERS, 2015, 43 (05) : 522 - 525
[12] A fast algorithm for scheduling instructions with deadline constraints on RISC machines
Wu, H
Jaffar, J
Yap, R
2000 INTERNATIONAL CONFERENCE ON PARALLEL ARCHITECTURES AND COMPILATION TECHNIQUES, PROCEEDINGS, 2000, : 281 - 290
[13] A heuristic algorithm for the scheduling problem of parallel machines with mold constraints
Hong, Tzung-Pei
Sun, Pei-Chen
Li, Shin-Dai
RECENT ADVANCES IN SYSTEMS, COMMUNICATIONS AND COMPUTERS, 2008, : 242 - +
[14] A heuristic algorithm for the scheduling problem of parallel machines with mold constraints
Department of Computer Science and Information Engineering, National University of Kaohsiung, Kaohsiung 811, Taiwan
不详
不详
WSEAS Trans. Syst., 2008, 6 (642-651):
[15] An improved monotone algorithm for scheduling related machines with precedence constraints
van Zuylen, Anke
OPERATIONS RESEARCH LETTERS, 2011, 39 (06) : 423 - 427
[16] An approximation algorithm for scheduling two parallel machines with capacity constraints
Yang, H
Ye, YY
Zhang, JW
DISCRETE APPLIED MATHEMATICS, 2003, 130 (03) : 449 - 467
[17] Scheduling on identical parallel machines to minimize total completion time with deadline and machine eligibility constraints
Ling-Huey Su
The International Journal of Advanced Manufacturing Technology, 2009, 40 : 572 - 581
[18] Scheduling on identical parallel machines to minimize total completion time with deadline and machine eligibility constraints
Su, Ling-Huey
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2009, 40 (5-6): : 572 - 581
[19] Unrelated machines scheduling with machine eligibility restrictions
Al-Salem, Ameer
Armacost, Robert L.
Engineering Journal of University of Qatar, 2002, 15 : 193 - 210
[20] On the optimality of list scheduling for online uniform machines scheduling
Han, Fangqiu
Tan, Zhiyi
Yang, Yang
OPTIMIZATION LETTERS, 2012, 6 (07) : 1551 - 1571

← 1 2 3 4 5 →