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 条
  • [21] Exact algorithms to minimize makespan on single and parallel batch processing machines
    Muter, Ibrahim
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 285 (02) : 470 - 483
  • [22] A genetic algorithm for minimizing the makespan in the case of scheduling identical parallel machines
    Min, L
    Cheng, W
    [J]. ARTIFICIAL INTELLIGENCE IN ENGINEERING, 1999, 13 (04): : 399 - 403
  • [23] Metaheuristics for Identical Parallel Machines Scheduling to Minimize Mean Tardiness
    Kaid, Husam
    Alharkan, Ibrahim
    Ghaleb, Atef
    Ghaleb, Mageed A.
    [J]. 2015 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND OPERATIONS MANAGEMENT (IEOM), 2015,
  • [24] Minimizing Makespan on Identical Parallel Machines
    Habiba, Houari
    Hassam, Ahmed
    Sari, Zaki
    Amine, Cherier Mohamed
    Souad, Tahraoui
    [J]. 2019 3RD INTERNATIONAL CONFERENCE ON APPLIED AUTOMATION AND INDUSTRIAL DIAGNOSTICS (ICAAID 2019), 2019,
  • [25] Scheduling parallel jobs to minimize the makespan
    Johannes, Berit
    [J]. JOURNAL OF SCHEDULING, 2006, 9 (05) : 433 - 452
  • [26] Scheduling parallel jobs to minimize the makespan
    Berit Johannes
    [J]. Journal of Scheduling, 2006, 9 : 433 - 452
  • [27] Lagrangian approach to minimize makespan of non-identical parallel batch processing machines
    Suhaimi, Nurul
    Nguyen, Christine
    Damodaran, Purushothaman
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 101 : 295 - 302
  • [28] An algorithm for multi-agent scheduling to minimize the makespan on m parallel machines
    Manzhan Gu
    Jinwei Gu
    Xiwen Lu
    [J]. Journal of Scheduling, 2018, 21 : 483 - 492
  • [29] Metaheuristics for optimizing unrelated parallel machines scheduling with unreliable resources to minimize makespan
    Kaid, Husam
    Al-Ahmari, Abdulrahman
    Al-Shayea, Adel
    Abouel Nasr, Emad
    Kamrani, Ali K.
    Mahmoud, Haitham A.
    [J]. ADVANCES IN MECHANICAL ENGINEERING, 2022, 14 (05)
  • [30] An algorithm for multi-agent scheduling to minimize the makespan on m parallel machines
    Gu, Manzhan
    Gu, Jinwei
    Lu, Xiwen
    [J]. JOURNAL OF SCHEDULING, 2018, 21 (05) : 483 - 492
12345