Minimizing flow-time on a single machine with integer batch sizes

被引：34
|
作者：
Mosheiov, G [1 ]
Oron, D
Ritov, Y
机构：
[1] Hebrew Univ Jerusalem, Sch Business Adm, Dept Stat, IL-91905 Jerusalem, Israel
[2] Univ Sydney, Fac Econ & Business, Sydney, NSW 2006, Australia
[3] Hebrew Univ Jerusalem, Dept Stat, IL-91905 Jerusalem, Israel
来源：
OPERATIONS RESEARCH LETTERS | 2005年 / 33卷 / 05期
关键词：
deterministic batch scheduling; single machine; flow-time;
D O I：
10.1016/j.orl.2004.09.007
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We address a classical minimum flow-time, single-machine, batch-scheduling problem. Processing times and setups are assumed to be identical for all jobs and batches, respectively. Santos and Magazine (Oper. Res. Lett. 4(1985) 99) introduced an efficient solution for the relaxed (non-integer) problem. We introduce a simple rounding procedure for Santos and Magazine's solution, which guarantees optimal integer batches. (c) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码：497 / 501
页数：5
相关论文
共 50 条
  • [21] Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine
    Xing Chai
    Wenhua Li
    Yuejuan Zhu
    Annals of Operations Research, 2021, 298 : 79 - 93
  • [22] 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
  • [23] Better algorithms for minimizing average flow-time on related machines
    Garg, Naveen
    Kumar, Amit
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT 1, 2006, 4051 : 181 - 190
  • [24] 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
  • [25] 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
  • [26] MINIMIZING MEAN FLOW-TIME WITH PARALLEL PROCESSORS AND RESOURCE CONSTRAINTS
    BLAZEWICZ, J
    KUBIAK, W
    ROCK, H
    SZWARCFITER, J
    ACTA INFORMATICA, 1987, 24 (05) : 513 - 524
  • [27] Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine
    Chai, Xing
    Li, Wenhua
    Zhu, Yuejuan
    ANNALS OF OPERATIONS RESEARCH, 2021, 298 (1-2) : 79 - 93
  • [28] On-line problems of minimizing makespan on a single batch processing machine with nonidentical job sizes
    Yongqiang S.
    Enyu Y.
    Applied Mathematics-A Journal of Chinese Universities, 2005, 20 (3) : 297 - 304
  • [29] A PTAS for Minimizing Weighted Flow Time on a Single Machine
    Armbruster, Alexander
    Rohwedder, Lars
    Wiese, Andreas
    PROCEEDINGS OF THE 55TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2023, 2023, : 1335 - 1344
  • [30] Minimizing total flow time on a single flexible machine
    Karakayali, Ibrahim
    Azizoglu, Meral
    INTERNATIONAL JOURNAL OF FLEXIBLE MANUFACTURING SYSTEMS, 2006, 18 (01): : 55 - 73
12345