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 条
  • [1] An Optimal Online Algorithm for Scheduling on Two Parallel Machines with GoS Eligibility Constraints
    Xu J.
    Liu Z.-H.
    Journal of the Operations Research Society of China, 2016, 4 (03) : 371 - 377
  • [2] Optimal parallel machines scheduling with machine availability and eligibility constraints
    Sheen, Gwo-Ji
    Liao, Lu-Wen
    Lin, Cheng-Feng
    International Journal of Advanced Manufacturing Technology, 2008, 36 (1-2): : 132 - 139
  • [3] Optimal parallel machines scheduling with machine availability and eligibility constraints
    Gwo-Ji Sheen
    Lu-Wen Liao
    Cheng-Feng Lin
    The International Journal of Advanced Manufacturing Technology, 2008, 36 : 132 - 139
  • [4] Optimal parallel machines scheduling with machine availability and eligibility constraints
    Sheen, Gwo-Ji
    Liao, Lu-Wen
    Lin, Cheng-Feng
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2008, 36 (1-2): : 132 - 139
  • [5] Online scheduling on two uniform machines subject to eligibility constraints
    Lee, Kangbok
    Leung, Joseph Y. -T.
    Pinedoa, Michael L.
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (38-40) : 3975 - 3981
  • [6] The list scheduling algorithm for scheduling unreliable jobs on two parallel machines
    Agnetis, Alessandro
    Detti, Paolo
    Pranzo, Marco
    DISCRETE APPLIED MATHEMATICS, 2014, 165 : 2 - 11
  • [7] Multiobjective Order Acceptance and Scheduling on Unrelated Parallel Machines with Machine Eligibility Constraints
    Wang, Bailin
    Wang, Haifeng
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2018, 2018
  • [8] Order acceptance and scheduling on parallel machines with setup time and machine-eligibility constraints
    Wang B.-L.
    Li T.-K.
    Wang H.-F.
    Gongcheng Kexue Xuebao/Chinese Journal of Engineering, 2019, 41 (04): : 528 - 538
  • [9] Scheduling jobs with service level requirements on parallel machines under availability and eligibility constraints
    Liao, Lu-Wen
    JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES, 2009, 30 (06): : 1157 - 1176
  • [10] A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility
    Yu, Chunlong
    Semeraro, Quirico
    Matta, Andrea
    COMPUTERS & OPERATIONS RESEARCH, 2018, 100 : 211 - 229
12345