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 条
  • [1] MINIMIZING THE FLOW-TIME VARIANCE IN SINGLE-MACHINE SYSTEMS
    GUPTA, MC
    GUPTA, YP
    BECTOR, CR
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1990, 41 (08) : 767 - 779
  • [2] Minimizing flow-time variance in a single-machine system using genetic algorithms
    Chaudhry, Imran Ali
    Drake, Paul R.
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2008, 39 (3-4): : 355 - 366
  • [3] Minimizing flow-time variance in a single-machine system using genetic algorithms
    Chaudhry, Imran Ali
    Drake, Paul R.
    International Journal of Advanced Manufacturing Technology, 2008, 39 (3-4): : 355 - 366
  • [4] Minimizing flow-time variance in a single-machine system using genetic algorithms
    Imran Ali Chaudhry
    Paul R. Drake
    The International Journal of Advanced Manufacturing Technology, 2008, 39 : 355 - 366
  • [5] 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
  • [6] SINGLE-MACHINE FLOW-TIME SCHEDULING WITH A SINGLE BREAKDOWN
    ADIRI, I
    BRUNO, J
    FROSTIG, E
    KAN, AHGR
    ACTA INFORMATICA, 1989, 26 (07) : 679 - 685
  • [7] Minimizing Flow-Time on Unrelated Machines
    Bansal, Nikhil
    Kulkarni, Janardhan
    STOC'15: PROCEEDINGS OF THE 2015 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2015, : 851 - 860
  • [8] Minimizing makespan on a single batch processing machine with nonidentical job sizes
    Zhang, GC
    Cai, XQ
    Lee, CY
    Wong, CK
    NAVAL RESEARCH LOGISTICS, 2001, 48 (03) : 226 - 240
  • [9] Minimizing Maximum Flow-Time on Related Machines
    Bansal, Nikhil
    Cloostermans, Bouke
    THEORY OF COMPUTING, 2016, 12
  • [10] Minimizing Total Flow-Time: The Unrelated Case
    Garg, Naveen
    Kumar, Amit
    Muralidhara, V. N.
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2008, 5369 : 424 - 435
12345