Please use this identifier to cite or link to this item:
|Title:||Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times|
|Authors:||Cheng, T. C. Edwin|
Yuan, J. J.
Yang, A. F.
Identical processing times
|Source:||Computers & operations research, Apr. 2005, v. 32, no. 4, p. 849-859.|
|Abstract:||We consider the single machine parallel-batching scheduling problem with precedence relations, release dates and identical processing times to minimize a regular objective function. When the processing times are unit, we give an O(n²) time optimal algorithm. When there are no precedence relations, we solve this problem by dynamic programming in O(n³) time. When the precedence relations are "layerly complete", we solve this problem by a dynamic programming algorithm that runs in O(n[sup 7]) time. For the total weighted completion time minimization problem, we give an O(n²) time [3/2]-approximation algorithm. For the makespan minimization problem, we give an O(n²) time optimal algorithm and an expression of the minimum makespan.|
|Rights:||Computers & Operations Research © 2003 Elsevier Ltd. The journal web site is located at http://www.sciencedirect.com.|
|Appears in Collections:||LMS Journal/Magazine Articles|
Files in This Item:
|p-batch-identical.pdf||Pre-published version||125.1 kB||Adobe PDF||View/Open|
All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated. No item in the PolyU IR may be reproduced for commercial or resale purposes.