List scheduling algorithms to minimize the makespan on identical parallel machines

被引：0
|
作者：
Ethel Mokotoff
José Luis Jimeno
Ana Isabel Gutiérrez
机构：
[1] Universidad de Alcalá,Departamento de Fundamentos de Economía
来源：
Top | 2001年 / 9卷 / 2期
关键词：
Approximate algorithms; scheduling; list scheduling; 90B35;
D O I：
10.1007/BF02579085
中图分类号：
学科分类号：
摘要：
In this paper we present constructive algorithms for the classical deterministic scheduling problem of minimizing the makespan on identical machines. Since the problem is known to beNP-hard in the strong sense, the approximate algorithms play a relevant role when solving this problem. The proposed algorithms are based on list scheduling procedures, but the assignment rule is not the same for the full set of jobs. Computational results show that these algorithms perform very well.
引用
收藏
页码：243 / 269
页数：26
相关论文
共 50 条
  • [41] Online Scheduling on Two Uniform Unbounded Parallel-Batch Machines to Minimize Makespan
    Jin-Jiang Yuan
    Li-Li Ren
    Ji Tian
    Ru-Yan Fu
    [J]. Journal of the Operations Research Society of China, 2019, 7 : 303 - 319
  • [42] Scheduling two-point stochastic jobs to minimize the makespan on two parallel machines
    Borst, S
    Bruno, J
    Coffman, EG
    Phillips, S
    [J]. PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES, 1997, 11 (01) : 95 - 105
  • [43] Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan
    Lancia, G
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 120 (02) : 277 - 288
  • [44] Online Scheduling on Two Uniform Unbounded Parallel-Batch Machines to Minimize Makespan
    Yuan, Jin-Jiang
    Ren, Li-Li
    Tian, Ji
    Fu, Ru-Yan
    [J]. JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA, 2019, 7 (02) : 303 - 319
  • [45] Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan
    Fu, Ruyan
    Cheng, T. C. E.
    Ng, C. T.
    Yuan, Jinjiang
    [J]. INFORMATION PROCESSING LETTERS, 2010, 110 (11) : 444 - 450
  • [46] Two Parallel Machines Scheduling with Two-Vehicle Job Delivery to Minimize Makespan
    Cao, Lisi
    Hao, Jianhong
    Jiang, Dakui
    [J]. COMPLEXITY, 2020, 2020
  • [47] Bi-objective identical parallel machine scheduling to minimize total energy consumption and makespan
    Wang, Shijin
    Wang, Xiaodong
    Yu, Jianbo
    Ma, Shuan
    Liu, Ming
    [J]. JOURNAL OF CLEANER PRODUCTION, 2018, 193 : 424 - 440
  • [48] Online scheduling on two uniform machines to minimize the makespan
    Liu, Ming
    Xu, Yinfeng
    Chu, Chengbin
    Zheng, Feifeng
    [J]. THEORETICAL COMPUTER SCIENCE, 2009, 410 (21-23) : 2099 - 2109
  • [49] Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness
    Mensendiek, Arne
    Gupta, Jatinder N. D.
    Herrmann, Jan
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 243 (02) : 514 - 522
  • [50] SCHEDULING IDENTICAL PARALLEL MACHINES TO MINIMIZE TOTAL WEIGHTED COMPLETION-TIME
    BELOUADAH, H
    POTTS, CN
    [J]. DISCRETE APPLIED MATHEMATICS, 1994, 48 (03) : 201 - 218
12345