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 条
  • [31] Approximation SR1-based algorithms for nonlinear image processing
    Khiyabani, Farzin Modarres
    2016 THIRD INTERNATIONAL CONFERENCE ON DIGITAL INFORMATION PROCESSING, DATA MINING, AND WIRELESS COMMUNICATIONS (DIPDMWC), 2016, : 327 - 331
  • [32] APPROXIMATION ALGORITHMS FOR GEOMETRIC EMBEDDINGS IN THE PLANE WITH APPLICATIONS TO PARALLEL PROCESSING PROBLEMS
    HANSEN, MD
    30TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 1989, : 604 - 609
  • [33] Batch processing
    不详
    CHEMICAL ENGINEERING PROGRESS, 2003, 99 (08) : 20 - 20
  • [34] Approximation algorithms
    Letchford, AN
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2002, 53 (07) : 807 - 808
  • [35] Approximation algorithms
    Schulz, A. S.
    Shmoys, D. B.
    Williamson, D. P.
    Proceedings of the National Academy of Sciences of the United States of America, 94 (24):
  • [36] Approximation algorithms
    Lee, RCT
    THIRD INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS, AND NETWORKS, PROCEEDINGS (I-SPAN '97), 1997, : 232 - 232
  • [37] Approximation algorithms
    Schulz, AS
    Shmoys, DB
    Williamson, DP
    PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 1997, 94 (24) : 12734 - 12735
  • [38] Scheduling identical parallel batch processing machines to minimise makespan using genetic algorithms
    Damodaran, Purushothaman
    Hirani, Neal S.
    Velez-Gallego, Mario C.
    EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING, 2009, 3 (02) : 187 - 206
  • [39] Genetic algorithms for minimizing makespan in a flow shop with two capacitated batch processing machines
    Manjeshwar, Praveen Kumar
    Damodaran, Purushothaman
    Srihari, Krishnaswami
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2011, 55 (9-12): : 1171 - 1182
  • [40] Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system
    Parsa, N. Rafiee
    Karimi, B.
    Husseini, S. M. Moattar
    COMPUTERS & OPERATIONS RESEARCH, 2017, 80 : 173 - 183
12345