Minimizing total completion time for UET tasks with release time and outtree precedence constraints
Document Type
Article
Publication Date
11-1-2005
Abstract
Brucker et al. (Math Methods Oper Res 56: 407-412, 2003) have given an O(n 2)-time algorithm for the problems P | pj = 1, r j , outtree |∑ Cj and P | pmtn, pj = 1, rj, outtree | ∑ Cj . In this note, we show that their algorithm admits an O(n log n)-time implementation. © Springer-Verlag 2005.
Identifier
27844527883 (Scopus)
Publication Title
Mathematical Methods of Operations Research
External Full Text Location
https://doi.org/10.1007/s00186-005-0009-5
e-ISSN
14325217
ISSN
14322994
First Page
275
Last Page
279
Issue
2
Volume
62
Grant
0300156
Fund Ref
National Science Foundation
Recommended Citation
Huo, Yumei and Leung, Joseph Y.T., "Minimizing total completion time for UET tasks with release time and outtree precedence constraints" (2005). Faculty Publications. 19498.
https://digitalcommons.njit.edu/fac_pubs/19498
COinS
