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 条
  • [31] Minimizing total flow time on a single flexible machine
    İbrahim Karakayalı
    Meral Azizoğlu
    International Journal of Flexible Manufacturing Systems, 2006, 18 : 55 - 73
  • [32] ON-LINE PROBLEMS OF MINIMIZING MAKESPAN ON A SINGLE BATCH PROCESSING MACHINE WITH NONIDENTICAL JOB SIZES
    Shi Yongqiang Yao Enyu Dept.of Math.
    Applied Mathematics:A Journal of Chinese Universities, 2005, (03) : 297 - 304
  • [33] SINGLE MACHINE SEQUENCING TECHNIQUES WITH BOTH TARDINESS AND FLOW-TIME CRITERIA.
    Litteral, Lewis A.
    Production and inventory management Washington, D.C., 1987, 28 (02): : 59 - 64
  • [34] 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
  • [35] Batch scheduling on uniform machines to minimize total flow-time
    Mor, Baruch
    Mosheiov, Gur
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (03) : 571 - 575
  • [36] MINIMIZING VARIATION OF FLOW TIME IN SINGLE-MACHINE SYSTEMS
    KANET, JJ
    MANAGEMENT SCIENCE, 1981, 27 (12) : 1453 - 1459
  • [37] An algorithm for minimizing flow time and maximum earliness on a single machine
    Huang, R-H
    Yang, C-L
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2009, 60 (06) : 873 - 877
  • [38] Minimizing the total completion time on a single batch processing machine with non-identical job sizes using ant colony optimization
    Xu, Rui
    Chen, Hua-Ping
    Huang, George Q.
    Shao, Hao
    Cheng, Ba-Yi
    Liu, Bo-Wen
    ICIEA 2008: 3RD IEEE CONFERENCE ON INDUSTRIAL ELECTRONICS AND APPLICATIONS, PROCEEDINGS, VOLS 1-3, 2008, : 2211 - 2215
  • [39] MINIMIZING FLOW-TIME AND TIME-TO-FIRST-TREATMENT IN AN EMERGENCY DEPARTMENT THROUGH SIMULATION
    Chonde, Seifu
    Parra, Carlos
    Chang, Chia-Jung
    2013 WINTER SIMULATION CONFERENCE (WSC), 2013, : 2374 - 2385
  • [40] Single-machine batch scheduling minimizing weighted flow times and delivery costs
    Mazdeh, Mohammad Mandavi
    Shashaani, Sara
    Ashouri, Armin
    Hindi, Khalil S.
    APPLIED MATHEMATICAL MODELLING, 2011, 35 (01) : 563 - 570
12345