Abstract
We present a parallel algorithm for solving the minimum weighted completion time scheduling problem for transitive series parallel graphs. The algorithm takesO(log2 n) time withO(n 3) processors on a CREW PRAM, wheren is the number of vertices of the input graph. This is the first NC algorithm for solving the problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K. Abrahamson, N. Dadoun, D. G. Kirkpatrick, and T. Przytycka, A simple parallel tree contraction algorithm,Journal of Algorithms,10 (1987), 287–302.
D. Adolphson and T. C. Hu, Optimal linear ordering,SIAM Journal on Applied Mathematics,25 (1973), 403–423.
M. Chrobak, J. Naor, and M. B. Novick, Using bounded degree spanning trees in the design of efficient algorithms on claw-free graphs,Proceedings of Workshop on Algorithms and Data Structures (LNCS, vol. 382), 1989, Springer-Verlag, Berlin, pp. 147–163.
R. W. Conway, W. L. Maxwell, and L. W. Miller,Theory Of Scheduling, Addison-Wesley, Reading, MA, 1967.
E. Dekel and S. Sahni, A parallel matching algorithm for convex bipartite graphs and applications toscheduling, Journal of Parallel and Distributed Computing,1 (1984), 185–205.
D. Dolev, E. Upfal, and M. Warmuth, Scheduling trees in parallel, inVLSI: Algorithms and Architectures, P. Bertolazzi and F. Luccio, eds., 1985.
R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. R. Kan, Optimization and approximation in deterministic sequencing and scheduling: a survey,Annals of Discrete Mathematics,5 (1979), 287–326.
X. He, Parallel recognition and decomposition of two terminal series parallel graphs,Information and Computation,75 (1987), 15–38.
D. Helmbold and E. Mayr, Fast scheduling algorithms on parallel computers, inAdvances in Computing Research, F. Preparata, ed., Jai Press, Greenwich, CT, 1987.
D. Helmbold and E. Mayr, Two processor scheduling is in NC,SIAM Journal on Computing,16 (1987), 747–759.
W. A. Horn, Single machine job sequencing with treelike precedence ordering and linear delay penalties,SIAM Journal on Applied Mathematics,23 (1972), 189–202.
H. Jung, P. Spirakis, and M. Sema, A parallel algorithm for two processors precedence constrained scheduling,Proceedings of 18th ICALP, 1991, pp. 417–425.
E. L. Lawler,Sequencing Jobs To Minimize Total Weighted Completion Time Subject to Precedence Constraints, Annals of Discrete Mathematics, vol. 2, North-Holland, Amsterdam, 1978, pp. 75–90.
G. L. Miller and J. Reif, Parallel tree contraction and its application, inProceedings of 26th FOCS, 1985, pp. 478–489.
J. B. Sidney, Decomposition algorithms for single-machine sequencing with precedence relations and deferral costs,Operations Research,23 (1975), 283–298.
W. E. Smith, Various optimizers for single stage production,Naval Research Logistics Quarterly,3 (1956), 59–66.
J. Valdez, R. E. Tarjan, and E. L. Lawler, The recognition of series parallel graphs,SIAM Journal on Computing,11 (1982), 298–313.
U. V. Vazirani and V. V. Vazirani, The two processor scheduling Is In random NC,SIAM Journal on Computing,18 (1989), 1140–1148.
Author information
Authors and Affiliations
Additional information
Communicated by F. T. Leighton.
Research supported in part by NSF Grants CCR-9011214 and CCR-9205982.
Rights and permissions
About this article
Cite this article
Sunder, S., He, X. An NC algorithm for finding a minimum weighted completion time schedule on series parallel graphs. Algorithmica 16, 243–262 (1996). https://doi.org/10.1007/BF01955675
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01955675