On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times

被引：39

作者：

Ng, CT

Cheng, TCE

Yuan, JJ

Liu, ZH

机构：

[1] Hong Kong Polytech Univ, Dept Management, Kowloon, Hong Kong, Peoples R China

[2] Zhengzhou Univ, Dept Math, Zhengzhou 450052, Peoples R China

[3] E China Univ Sci & Technol, Dept Math, Shanghai 200237, Peoples R China

来源：

OPERATIONS RESEARCH LETTERS | 2003年 / 31卷 / 04期

关键词：

scheduling; precedence constraints; batches;

D O I：

10.1016/S0167-6377(03)00007-5

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 [运筹学与控制论]; 12 [管理学]; 1201 [管理科学与工程]; 1202 [工商管理学]; 120202 [企业管理];

摘要：

We consider the single machine, serial batching, total completion time scheduling problem with precedence constraints, release dates and identical processing times in this paper. The complexity of this problem is reported as, open in the literature. We provide an 0(n(5)) time algorithm to solve this problem. (C) 2003 Elsevier Science B.V. All rights reserved.

引用

页码：323 / 326

页数：4

共 7 条

[1]

THE COMPLEXITY OF ONE-MACHINE BATCHING PROBLEMS [J].