Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/24160
Title: On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times
Authors: Ng, CT 
Cheng, TCE 
Yuan, JJ
Liu, ZH
Keywords: Batches
Precedence constraints
Scheduling
Issue Date: 2003
Publisher: North-Holland
Source: Operations research letters, 2003, v. 31, no. 4, p. 323-326 How to cite?
Journal: Operations research letters 
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.
URI: http://hdl.handle.net/10397/24160
ISSN: 0167-6377
EISSN: 1872-7468
DOI: 10.1016/S0167-6377(03)00007-5
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

20
Last Week
0
Last month
0
Citations as of Oct 18, 2018

WEB OF SCIENCETM
Citations

12
Last Week
0
Last month
0
Citations as of Oct 18, 2018

Page view(s)

86
Last Week
1
Last month
Citations as of Oct 14, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.