On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs

被引：18
|
作者：
Fu, Ruyan [1 ]
Tian, Ji [1 ]
Yuan, Jinjiang [1 ]
机构：
[1] Zhengzhou Univ, Dept Math, Zhengzhou 450052, Henan, Peoples R China
来源：
JOURNAL OF SCHEDULING | 2009年 / 12卷 / 01期
关键词：
On-line scheduling; Batch machine; Job families; Competitive ratio; PROCESSING MACHINES; ALGORITHMS;
D O I：
10.1007/s10951-008-0084-6
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
We study the on-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs. In this model, jobs arrive over time and jobs from different families cannot be scheduled in a common batch. We provide a best possible on-line algorithm for the problem with competitive ratio (root 17+ 3)/4 approximate to 1.7808.
引用
收藏
页码：91 / 97
页数：7
相关论文
共 50 条
  • [41] Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost
    Yuan Gao
    Jinjiang Yuan
    C. T. Ng
    T. C. E. Cheng
    [J]. 4OR, 2022, 20 : 273 - 287
  • [42] Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan
    Lancia, G
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 120 (02) : 277 - 288
  • [43] On-line scheduling of parallel jobs
    Ye, D
    Zhang, GC
    [J]. STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, PROCEEDING, 2004, 3104 : 279 - 290
  • [44] Scheduling Piecewise Linear Deteriorating Jobs to Minimize Makespan in a Two-Machine Flowshop
    Jafari-Nodoushan A.
    Zare H.K.
    Lotfi M.M.
    Tavakkoli-Moghaddam R.
    [J]. Operations Research Forum, 2 (4)
  • [45] Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan
    Xu, Dehua
    Sun, Kaibiao
    Li, Hongxing
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (04) : 1344 - 1349
  • [46] Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness
    Geng, Zhichao
    Yuan, Jinjiang
    [J]. THEORETICAL COMPUTER SCIENCE, 2015, 570 : 22 - 29
  • [47] Scheduling deteriorating jobs to minimize makespan
    Kubiak, W
    van de Velde, S
    [J]. NAVAL RESEARCH LOGISTICS, 1998, 45 (05) : 511 - 523
  • [48] Scheduling an unbounded batch machine to minimize maximum lateness
    Bai, Shuyan
    Zhang, Fuzeng
    Li, Shuguang
    Liu, Qiming
    [J]. FRONTIERS IN ALGORITHMICS, PROCEEDINGS, 2007, 4613 : 172 - +
  • [49] Scheduling a capacitated batch-processing machine to minimize makespan
    Damodaran, Purushothaman
    Srihari, Krishnaswami
    Lam, Sarah S.
    [J]. ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING, 2007, 23 (02) : 208 - 216
  • [50] Online-List Scheduling on a Single Bounded Parallel-Batch Machine to Minimize Makespan
    Li, Wenhua
    Gao, Jie
    Yuan, Jinjiang
    [J]. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2015, 32 (04)
12345