Parallel solutions for preemptive makespan scheduling on two identical machines

被引：4
|
作者：
Epstein, Leah [1 ]
机构：
[1] Univ Haifa, Dept Math, Haifa, Israel
来源：
JOURNAL OF SCHEDULING | 2023年 / 26卷 / 01期
关键词：
Parallel solutions; Preemptive scheduling; Jobs arriving over a list; Competitive ratio; ONLINE ALGORITHMS; BOUNDS; ADVICE; LPT;
D O I：
10.1007/s10951-022-00764-4
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
We consider online preemptive scheduling of jobs arriving one by one, to be assigned to two identical machines, with the goal of makespan minimization. We study the effect of selecting the best solution out of two independent solutions constructed in parallel in an online fashion. Two cases are analyzed, where one case is purely online, and in the other one jobs are presented sorted by non-increasing sizes. We show that using two solutions rather than one improves the performance significantly, but that an optimal solution cannot be obtained for any constant number of solutions constructed in parallel. Our algorithms have the best possible competitive ratios out of algorithms for each one of the classes.
引用
收藏
页码：61 / 76
页数：16
相关论文
共 50 条
  • [1] Parallel solutions for preemptive makespan scheduling on two identical machines
    Leah Epstein
    [J]. Journal of Scheduling, 2023, 26 : 61 - 76
  • [2] Preemptive scheduling on two identical parallel machines with a single transporter
    Kellerer, Hans
    Soper, Alan J.
    Strusevich, Vitaly A.
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2013, 25 (02) : 279 - 307
  • [3] Preemptive scheduling on two identical parallel machines with a single transporter
    Hans Kellerer
    Alan J. Soper
    Vitaly A. Strusevich
    [J]. Journal of Combinatorial Optimization, 2013, 25 : 279 - 307
  • [4] Preemptive scheduling on identical parallel machines subject to deadlines
    Azizoglu, M
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 148 (01) : 205 - 210
  • [5] 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
  • [6] List scheduling algorithms to minimize the makespan on identical parallel machines
    Ethel Mokotoff
    José Luis Jimeno
    Ana Isabel Gutiérrez
    [J]. Top, 2001, 9 (2) : 243 - 269
  • [7] 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
  • [8] Optimal preemptive scheduling on a fixed number of identical parallel machines
    Moukrim, A
    Quilliot, A
    [J]. OPERATIONS RESEARCH LETTERS, 2005, 33 (02) : 143 - 150
  • [9] 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
  • [10] 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,
12345