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 条
  • [1] Scheduling parallel identical machines to minimize makespan: A parallel approximation algorithm
    Ghalami, Laleh
    Grosu, Daniel
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2019, 133 : 221 - 231
  • [2] A GPU Parallel Approximation Algorithm for Scheduling Parallel Identical Machines to Minimize Makespan
    Li, Yuanzhe
    Ghalami, Laleh
    Schwiebert, Loren
    Grosu, Daniel
    [J]. 2018 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW 2018), 2018, : 619 - 628
  • [3] Approximation schemes for scheduling jobs on identical parallel machines to minimize the maximum lateness and makespan
    Alhadi, Gais
    Kacem, Imed
    Laroche, Pierre
    Osman, Izzeldin M.
    [J]. RAIRO-OPERATIONS RESEARCH, 2024, 58 (03) : 2393 - 2419
  • [4] On-Line Scheduling on Parallel Machines to Minimize the Makespan
    Songsong Li
    Yuzhong Zhang
    [J]. Journal of Systems Science and Complexity, 2016, 29 : 472 - 477
  • [5] On-Line Scheduling on Parallel Machines to Minimize the Makespan
    Li Songsong
    Zhang Yuzhong
    [J]. JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2016, 29 (02) : 472 - 477
  • [6] On-Line Scheduling on Parallel Machines to Minimize the Makespan
    LI Songsong
    ZHANG Yuzhong
    [J]. Journal of Systems Science & Complexity, 2016, 29 (02) : 472 - 477
  • [7] Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan
    Zhao, Kejun
    Lu, Xiwen
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 31 (01) : 260 - 278
  • [8] Optimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraint
    Liu, Ming
    Zheng, Feifeng
    Chu, Chengbin
    Xu, Yinfeng
    [J]. THEORETICAL COMPUTER SCIENCE, 2011, 412 (39) : 5225 - 5231
  • [9] Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan
    Kejun Zhao
    Xiwen Lu
    [J]. Journal of Combinatorial Optimization, 2016, 31 : 260 - 278
  • [10] Non-identical parallel machines batch processing problem to minimize the makespan: Models and algorithms
    Beldar, Pedram
    Battarra, Maria
    Laporte, Gilbert
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2024, 168
12345