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 条
12345