Approximation algorithms in batch processing

被引：113
|
作者：
Deng, XT [1 ]
Poon, CK
Zhang, YZ
机构：
[1] City Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China
[2] Qufu Noram Univ, Inst Operat Res, Shandong, Peoples R China
来源：
JOURNAL OF COMBINATORIAL OPTIMIZATION | 2003年 / 7卷 / 03期
关键词：
scheduling; batch; release time; makespan; on-line;
D O I：
10.1023/A:1027316504440
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
A polynomial approximation scheme for minimizing makespan in a batch processing system under dynamic job arrivals is presented. A lower bound of (root5 + 1)/2 on the competitive ratio of any on-line algorithm is proved. This is matched by an on-line algorithm for the special case of unbounded machine capacity.
引用
收藏
页码：247 / 257
页数：11
相关论文
共 50 条
  • [41] Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs
    Wang, Qian
    Tian, Ji
    Fu, Ruyan
    Yao, Xiangjuan
    THEORETICAL COMPUTER SCIENCE, 2017, 700 : 37 - 44
  • [42] Genetic algorithms for minimizing makespan in a flow shop with two capacitated batch processing machines
    Praveen Kumar Manjeshwar
    Purushothaman Damodaran
    Krishnaswami Srihari
    The International Journal of Advanced Manufacturing Technology, 2011, 55 : 1171 - 1182
  • [43] Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times
    Oron, Daniel
    Shabtay, Dvir
    Steiner, George
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 256 (02) : 384 - 391
  • [44] Approximation of a Batch Consolidation Problem
    Chang, Junho
    Chang, Soo Y.
    Hong, Sung-Pil
    Min, Yun-Hong
    Park, Myoung-Ju
    NETWORKS, 2011, 58 (01) : 12 - 19
  • [45] BPA: Approximation Batch-Processing Algorithm for Static Lightpath Requests in Elastic Optical Networks
    Chatterjee, Bijoy Chand
    Basavaprabhu, S.
    Oki, Eiji
    IEEE Networking Letters, 2022, 4 (04): : 189 - 193
  • [46] Approximation algorithms for graph approximation problems
    Il'ev V.P.
    Il'eva S.D.
    Navrotskaya A.A.
    Journal of Applied and Industrial Mathematics, 2011, 5 (4) : 569 - 581
  • [47] The openshop batch processing problem with non-identical processing times, using simulated annealing and genetic algorithms approaches
    A. Khormali
    A. Mirzazadeh
    F. Faez
    The International Journal of Advanced Manufacturing Technology, 2012, 59 : 1157 - 1165
  • [48] The openshop batch processing problem with non-identical processing times, using simulated annealing and genetic algorithms approaches
    Khormali, A.
    Mirzazadeh, A.
    Faez, F.
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2012, 59 (9-12): : 1157 - 1165
  • [49] COMMINGLED BATCH PROCESSING
    LEHRMAN, B
    ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 1991, 202 : 26 - IEC
  • [50] Utility-aware Batch-processing Algorithms for Dynamic Carpooling Based on Double Auction
    Huang, Jiale
    Wu, Jigang
    Chen, Long
    Yan, Jiaquan
    2019 IEEE INTL CONF ON PARALLEL & DISTRIBUTED PROCESSING WITH APPLICATIONS, BIG DATA & CLOUD COMPUTING, SUSTAINABLE COMPUTING & COMMUNICATIONS, SOCIAL COMPUTING & NETWORKING (ISPA/BDCLOUD/SOCIALCOM/SUSTAINCOM 2019), 2019, : 1059 - 1063
12345