|
|||||
|
|
On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times |
|
| Authors: | C.T. Ng T.C.E. ChengJ.J. Yuan Z.H. Liu |
| Affiliation: | a Department of Management, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, People's Republic of China b Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, People's Republic of China c Department of Mathematics, East China University of Science and Technology, Shanghai 200237, People's Republic of China |
| Abstract: | 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 O(n5) time algorithm to solve this problem. |
| Keywords: | Scheduling Precedence constraints Batches |
| 本文献已被 ScienceDirect 等数据库收录！ | |