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 条
  • [41] A PTAS for Minimizing Total Completion Time of Batch Scheduling Under Tree Precedence Constraints
    Ma Ran
    Han Xuefeng
    2009 WASE INTERNATIONAL CONFERENCE ON INFORMATION ENGINEERING, ICIE 2009, VOL II, 2009, : 361 - 363
  • [42] Online Scheduling on Bounded Batch Machines to Minimize the Maximum Weighted Completion Time
    Li W.-H.
    Chai X.
    Journal of the Operations Research Society of China, 2018, 6 (3) : 455 - 465
  • [43] On minimizing the maximum flow time in the online dial-a-ride problem
    Krumke, SO
    de Paepe, WE
    Poensgen, D
    Lipmann, M
    Marchetti-Spaccamela, A
    Stougie, L
    APPROXIMATION AND ONLINE ALGORITHMS, 2006, 3879 : 258 - 269
  • [44] Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines
    Anand, S.
    Bringmann, Karl
    Friedrich, Tobias
    Garg, Naveen
    Kumar, Amit
    AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I, 2013, 7965 : 13 - 24
  • [45] Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines
    Anand, S.
    Bringmann, Karl
    Friedrich, Tobias
    Garg, Naveen
    Kumar, Amit
    ALGORITHMICA, 2017, 77 (02) : 515 - 536
  • [46] Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines
    S. Anand
    Karl Bringmann
    Tobias Friedrich
    Naveen Garg
    Amit Kumar
    Algorithmica, 2017, 77 : 515 - 536
  • [47] Scheduling hybrid flow shop for minimizing total weight completion time
    Gao, Cong
    Tang, Lixin
    2007 IEEE INTERNATIONAL CONFERENCE ON AUTOMATION AND LOGISTICS, VOLS 1-6, 2007, : 809 - 813
  • [48] Parallel machine scheduling for minimizing the makespan and the average flow-time
    Ruiz-Torres, AJ
    Enscore, EE
    Barton, RR
    6TH INDUSTRIAL ENGINEERING RESEARCH CONFERENCE PROCEEDINGS: (IERC), 1997, : 186 - 191
  • [49] Minimizing total flow time subject to preemption penalties in online scheduling
    Heydari, Mehdi
    Sadjadi, Seyed Jafar
    Mohammadi, Emran
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2010, 47 (1-4): : 227 - 236
  • [50] ANALYSIS FOR MINIMIZING WEIGHTED MEAN FLOW-TIME IN FLOWSHOP SCHEDULING
    MIYAZAKI, S
    NISHIYAMA, N
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1980, 23 (02) : 118 - 132
12345