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 条
  • [31] Tabu search and particle swarm optimization algorithms for two identical parallel machines scheduling problem with a single server
    Alharkan, Ibrahim
    Saleh, Mustafa
    Ghaleb, Mageed A.
    Kaid, Husam
    Farhan, Abdulsalam
    Almarfadi, A.
    [J]. Journal of King Saud University - Engineering Sciences, 2020, 32 (05): : 330 - 338
  • [32] ON-LINE PREEMPTIVE SCHEDULING ON UNIFORM MACHINES
    ZHANG Yuzhong (Institute of Operations Research
    [J]. Journal of Systems Science & Complexity, 2001, (04) : 373 - 377
  • [33] A best possible on-line algorithm for scheduling on uniform parallel-batch machines
    Li, Wenhua
    Chai, Xing
    Song, Yali
    [J]. THEORETICAL COMPUTER SCIENCE, 2018, 740 : 68 - 75
  • [34] Scheduling reentrant jobs on parallel machines with a remote server
    Chakhlevitch, K.
    Glass, C. A.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (09) : 2580 - 2589
  • [35] 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
  • [36] 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
  • [37] 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
  • [38] Equal processing and equal setup time cases of scheduling parallel machines with a single server
    Abdekhodaee, AH
    Wirth, A
    Gan, HS
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2004, 31 (11) : 1867 - 1889
  • [39] A branch-and-price algorithm for the general case of scheduling parallel machines with a single server
    Gan, Heng-Soon
    Wirth, Andrew
    Abdekhodaee, Amir
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (09) : 2242 - 2247
  • [40] On-line scheduling of parallel jobs in a list
    Ye, Deshi
    Zhang, Guochuan
    [J]. JOURNAL OF SCHEDULING, 2007, 10 (06) : 407 - 413
12345