Abstract
Brucker et al. (Math Methods Oper Res 56: 407–412, 2003) have given an O(n 2)-time algorithm for the problems \(P \mid p_{j} = 1, r_{j}\), outtree \(\mid \sum C_{j}\) and \(P \mid pmtn, p_{j} = 1, r_{j}\), outtree \(\mid \sum C_{j}\). In this note, we show that their algorithm admits an O(n log n)-time implementation.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aho AV, Hopcroft JE, Ullman JD (1974) The design and analysis of computer algorithms. Addison Wesley, Reading
Brucker P, Hurink J, Knust S. (2003). A polynomial algorithm for \(P \mid p_{j} = 1, r_{j}\), outtree \(\mid \sum C_{j}\) and \(P \mid pmtn, p_{j} = 1, r_{j}\), outtree \(\mid \sum C_{j}\). Math Methods Oper Res 56:407–412
Coffman EG Jr, Graham RL (1972) Optimal scheduling for two-processor systems. Acta Inform 1:200–213
Coffman EG Jr, Sethuraman J, Timkovsky VG (2003) Ideal preemptive schedules on two processors. Acta Inform 39:597–612
Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic scheduling: a survey. Ann Discrete Math 5:287–326
Huo Y, Leung JY-T (2005) Minimizing mean flow time for UET tasks, “web.njit.edu/∼leung/mft-uet/paper.ps”
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Huo, Y., Leung, J.Y.T. Minimizing total completion time for UET tasks with release time and outtree precedence constraints. Math Meth Oper Res 62, 275–279 (2005). https://doi.org/10.1007/s00186-005-0009-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00186-005-0009-5