An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time

被引：13
|
作者：
Tao, Jiping [1 ]
Chao, Zhijun [1 ]
Xi, Yugeng [1 ]
Tao, Ye [1 ]
机构：
[1] Shanghai Jiao Tong Univ, Dept Automat, Shanghai 200030, Peoples R China
来源：
INFORMATION PROCESSING LETTERS | 2010年 / 110卷 / 8-9期
基金：
美国国家科学基金会;
关键词：
Analysis of algorithms; Semi-online algorithms; Single machine scheduling; Total weighted completion time; Competitive ratio; ASYMPTOTIC PERFORMANCE RATIO; AVERAGE COMPLETION-TIME; RELEASE DATES;
D O I：
10.1016/j.ipl.2010.02.013
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The single machine semi-online scheduling problem is considered with the assumption that the ratio of the longest processing time to the shortest one is not greater than gamma. The goal is to minimize the total weighted completion time. We design a semi-online algorithm and prove that it has a competitive ratio of 1 + root 4 gamma(2)+1-1/2 gamma, which is also shown to be the best performance achieved by any deterministic semi-online algorithm for the problem. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码：325 / 330
页数：6
相关论文
共 50 条
  • [1] A SEMI-ONLINE ALGORITHM AND ITS COMPETITIVE ANALYSIS FOR A SINGLE MACHINE SCHEDULING PROBLEM WITH BOUNDED PROCESSING TIMES
    Tao, Jiping
    Chao, Zhijun
    Xi, Yugeng
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2010, 6 (02) : 269 - 282
  • [2] OPTIMAL SEMI-ONLINE ALGORITHM FOR SCHEDULING ON A BATCH PROCESSING MACHINE
    Liu, Ming
    Xu, Yinfeng
    Chu, Chengbin
    Wang, Lu
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2009, 1 (02) : 219 - 226
  • [3] Optimal Semi-online Algorithm for Scheduling on a Batch Processing Machine
    Liu, Ming
    Xu, Yinfeng
    Chu, Chengbin
    Wang, Lu
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PROCEEDINGS, 2009, 5573 : 346 - +
  • [4] A Semi-Online Algorithm for Single Machine Scheduling with Rejection
    Guo, Sainan
    Ma, Ran
    Zhang, Yuzhong
    Fan, Baoqiang
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2021, 38 (05)
  • [5] Minimising total weighted completion time for semi-online single machine scheduling with known arrivals and bounded processing times
    Nouinou, Hajar
    Arbaoui, Taha
    Yalaoui, Alice
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2024, 62 (06) : 2272 - 2285
  • [6] An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown
    Tian, Ji
    Zhou, Yan
    Fu, Ruyan
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2020, 40 (01) : 170 - 180
  • [7] An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown
    Ji Tian
    Yan Zhou
    Ruyan Fu
    Journal of Combinatorial Optimization, 2020, 40 : 170 - 180
  • [8] Extension of algorithm list scheduling for a semi-online scheduling problem
    Yong He
    György Dósa
    Central European Journal of Operations Research, 2007, 15 : 97 - 104
  • [9] An optimal semi-online algorithm for 2-machine scheduling with an availability constraint
    Hongying Li
    Chunjie Su
    Journal of Combinatorial Optimization, 2011, 22 : 153 - 165
  • [10] An optimal semi-online algorithm for 2-machine scheduling with an availability constraint
    Li, Hongying
    Su, Chunjie
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2011, 22 (02) : 153 - 165
12345