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 条

[11] Approximation algorithms for scheduling single batch machine with incompatible deteriorating jobs
Cheng, Bayi
Yuan, Haimei
Zhou, Mi
Qi, Tan
RAIRO-OPERATIONS RESEARCH, 2023, 57 (03) : 1267 - 1284
[12] BATCH PROCESSING ALGORITHMS FOR COMPLEX JOBS IN HOMOGENEOUS COMPUTING SYSTEMS
KALYAEV, AV
BAKENROT, VY
MAKAREVICH, OB
CYBERNETICS, 1982, 18 (03): : 347 - 351
[13] Fast exponentiation algorithms based on batch-processing and precomputation
Tsuruoka, Y
Koyama, K
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1997, E80A (01) : 34 - 39
[14] On-line algorithms for minimizing makespan on batch processing machines
Zhang, GC
Cai, XQ
Wong, CK
NAVAL RESEARCH LOGISTICS, 2001, 48 (03) : 241 - 258
[15] Near-Linear Approximation Algorithms for Scheduling Problems with Batch Setup Times
Deppert, Max A.
Jansen, Klaus
SPAA'19: PROCEEDINGS OF THE 31ST ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURESS, 2019, 2019, : 155 - 164
[16] Efficient Batch and Adaptive Approximation Algorithms for Joint Multicast Beamforming and Admission Control
Matskani, Evaggelia
Sidiropoulos, Nicholas D.
Luo, Zhi-Quan
Tassiulas, Leandros
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2009, 57 (12) : 4882 - 4894
[17] Optimal on-line algorithms for scheduling on parallel batch processing machines
Zhang, GC
Cai, XQ
Wong, CK
IIE TRANSACTIONS, 2003, 35 (02) : 175 - 181
[18] Exact algorithms to minimize makespan on single and parallel batch processing machines
Muter, Ibrahim
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 285 (02) : 470 - 483
[19] Fast approximation algorithms for job scheduling with processing set restrictions
Huo, Yumei
Leung, Joseph Y-T
THEORETICAL COMPUTER SCIENCE, 2010, 411 (44-46) : 3947 - 3955
[20] Approximation algorithms for two-machine flow shop scheduling with batch setup times
Chen, Bo
Potts, Chris N.
Strusevich, Vitaly A.
Mathematical Programming, Series B, 1998, 82 (1-2): : 255 - 271

← 1 2 3 4 5 →