Minimizing the maximum flow time in batch scheduling

被引：1

作者：

Im, Sungjin ^{[1
]}

Oh, Hoon ^{[2
]}

Shadloo, Maryam ^{[1
]}

机构：

[1] Univ Calif Merced, Merced, CA 95340 USA

[2] Rutgers Univ Camden, Camden, NJ USA

来源：

OPERATIONS RESEARCH LETTERS | 2016年 / 44卷 / 06期

关键词：

Batch scheduling; Broadcast scheduling; Maximum flow time; Approximation; Resource augmentation;

D O I：

10.1016/j.orl.2016.09.016

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

We consider the maximum flow time minimization problem in batch scheduling, which is a capacitated version of broadcast scheduling. In this setting, n different pages of information are available at the server which receives requests from clients over time for specific pages. The server can transmit at most one page p at each time to satisfy a batch of requests for the same page p, up to a certain capacity B-p. In this paper we give the first (1 + epsilon)-approximations for this problem with arbitrarily small resource augmentation, using either more capacity or more speed. (C) 2016 Elsevier B.V. All rights reserved.

引用

页码：784 / 789

页数：6

共 50 条

[31] Minimizing maximum earliness in single-machine scheduling with flexible maintenance time
Ganji, F.
Moslehi, Gh.
Jeddi, B. Ghalebsaz
SCIENTIA IRANICA, 2017, 24 (04) : 2082 - 2094
[32] Three parallel machines scheduling with minimizing the maximum inter-completion time
Zheng, Feifeng
Sui, Yang
Xu, Yinfeng
Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice, 2021, 41 (04): : 1025 - 1036
[33] Minimizing flow-time on a single machine with integer batch sizes
Mosheiov, G
Oron, D
Ritov, Y
OPERATIONS RESEARCH LETTERS, 2005, 33 (05) : 497 - 501
[34] Batch scheduling to minimize maximum lateness
Ghosh, JB
Gupta, JND
OPERATIONS RESEARCH LETTERS, 1997, 21 (02) : 77 - 80
[35] BATCH SCHEDULING TO MINIMIZE CYCLE TIME, FLOW TIME, AND PROCESSING COST
STEINER, G
TRUSCOTT, WG
IIE TRANSACTIONS, 1993, 25 (05) : 90 - 97
[36] Flow shop scheduling with multiple objective of minimizing makespan and total flow time
D. Ravindran
S.J. Selvakumar
R. Sivaraman
A. Noorul Haq
The International Journal of Advanced Manufacturing Technology, 2005, 25 : 1007 - 1012
[37] Flow shop scheduling with multiple objective of minimizing makespan and total flow time
Ravindran, D
Haq, AN
Selvakuar, SJ
Sivaraman, R
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2005, 25 (9-10): : 1007 - 1012
[38] Scheduling Problems with Rejection to Minimize the Maximum Flow Time
Zhang Liqi
Lu Lingfa
JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2016, 29 (05) : 1293 - 1301
[39] Scheduling problems with rejection to minimize the maximum flow time
Liqi Zhang
Lingfa Lu
Journal of Systems Science and Complexity, 2016, 29 : 1293 - 1301
[40] Scheduling Problems with Rejection to Minimize the Maximum Flow Time
ZHANG Liqi
LU Lingfa
JournalofSystemsScience&Complexity, 2016, 29 (05) : 1293 - 1301

← 1 2 3 4 5 →