On-line scheduling of two parallel machines with a single server

被引：19
|
作者：
Zhang, Lele [1 ]
Wirth, Andrew [1 ]
机构：
[1] Univ Melbourne, Dept Mech Engn, Melbourne, Vic 3010, Australia
来源：
COMPUTERS & OPERATIONS RESEARCH | 2009年 / 36卷 / 05期
关键词：
On-line scheduling; Parallel machines; Server; List scheduling;
D O I：
10.1016/j.cor.2008.02.015
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
In this paper, we consider the on-line scheduling of two parallel identical machines sharing a single server with the objective of minimizing the latest completion time of all jobs. Each job has to be setup by the server before being processed oil one of the machines. Three special cases: equal length jobs, equal processing times and regular equal setup times are considered and the asymptotic competitive ratios of list scheduling are determined. Also, a lower bound for the equal length job case is given. and two heuristics with tight asymptotic competitive ratios for the other two cases are proposed. (c) 2008 Elsevier Ltd. All rights reserved.
引用
收藏
页码：1529 / 1553
页数：25
相关论文
共 50 条
  • [41] On-line preemptive machine scheduling with lp norm on two uniform machines
    Shuai, Tianping
    Du, Donglei
    Jiang, Xiaoyue
    [J]. JOURNAL OF SCHEDULING, 2015, 18 (02) : 185 - 194
  • [42] On-line scheduling of parallel jobs in a list
    Deshi Ye
    Guochuan Zhang
    [J]. Journal of Scheduling, 2007, 10 : 407 - 413
  • [43] On an on-line scheduling problem for parallel jobs
    Naroska, E
    Schwiegelshohn, U
    [J]. INFORMATION PROCESSING LETTERS, 2002, 81 (06) : 297 - 304
  • [44] On-line scheduling of parallel jobs in a list
    Ye, Deshi
    Zhang, Guochuan
    [J]. JOURNAL OF SCHEDULING, 2007, 10 (06) : 407 - 413
  • [45] Randomized on-line scheduling of parallel jobs
    Sgall, J
    [J]. JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1996, 21 (01): : 149 - 175
  • [46] The optimal on-line parallel machine scheduling
    He, Y
    [J]. COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2000, 39 (7-8) : 117 - 121
  • [47] A HYBRIT APPROACH ON SINGLE SERVER PARALLEL MACHINES SCHEDULING PROBLEM WITH SEQUENCE DEPENDENT SETUP TIMES
    Tuerker, A. Kuersad
    Sel, Cagri
    [J]. JOURNAL OF THE FACULTY OF ENGINEERING AND ARCHITECTURE OF GAZI UNIVERSITY, 2011, 26 (04): : 731 - 740
  • [48] Server scheduling on parallel dedicated machines with fixed job sequences
    Cheng, T. C. E.
    Kravchenko, Svetlana A.
    Lin, Bertrand M. T.
    [J]. NAVAL RESEARCH LOGISTICS, 2019, 66 (04) : 321 - 332
  • [49] MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server
    Kim, Mi-Yi
    Lee, Young Hoon
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (11) : 2457 - 2468
  • [50] An optimal on-line algorithm for preemptive scheduling on two uniform machines in the lp norm
    Shuai, Tianping
    Du, Donglei
    Jiang, Xiaoyue
    [J]. ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, PROCEEDINGS, 2008, 5034 : 316 - +
12345