Please use this identifier to cite or link to this item:
|Title:||A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times|
|Authors:||Yuan, J. J.|
Yang, A. F.
Cheng, T. C. Edwin
|Source:||European journal of operational research, 16 Oct. 2004, v. 158, no. 2, p. 525-528.|
|Abstract:||We consider the single machine, serial batching scheduling problem 1|prec;p[sub j]=p;s-batch;r[sub j]|L[sub max]. The complexity of this problem is reported as open in the literature. By reducing this problem to the version without precedence constraints, we show that the problem is polynomially solvable.|
|Rights:||European Journal of Operational Research © 2003 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com.|
|Appears in Collections:||LMS Journal/Magazine Articles|
Files in This Item:
|s-batch--release--lateness-v3.pdf||Pre-published version||119.21 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.