zbMATH — the first resource for mathematics

Optimal scheduling for two-processor systems. (English) Zbl 0248.68023

68Q25 Analysis of algorithms and problem complexity
68Q45 Formal languages and automata
Full Text: DOI
[1] Fulkerson, D. R.: Scheduling in project networks. Proc. IBM Scientific Computing Symposium on Combinatorial Problems. New York: IBM Corporation 1966. · Zbl 0168.40706
[2] Clark, W.: The Gantt chart (3rd Edition). London: Pitman and Sons 1952.
[3] Hu, T. C.: Parallel sequencing and assembly line problems. Operations Research 9, No. 6 (Nov. 1961).
[4] Muntz, R. R., Coffman, E. G., Jr.: Optimal preemptive scheduling on twoprocessor systems. IEEE Trans. on Computers C 18, No. 11, 1014-1020, Nov. 1969. · Zbl 0184.20504
[5] - Scheduling of computations on multiprocessor systems: The preemptive assignment discipline. PhD. Thesis, Electrical Eng. Dept., Princeton University, April 1969.
[6] Graham, R. L.: Bounds for certain multiprocessing anomalies. BSTJ, Nov. 1966, pp. 1563-1581. · Zbl 0168.40703
[7] ? Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17, No.2, 416-429 (1969). · Zbl 0188.23101
[8] Fujii, M., Kasami, T., Ninomiya, K.: Optimal sequence of two equivalent processors. SIAM J. Appl. Math. 17, No. 3, 784-789 (1969). · Zbl 0205.48603
[9] ? Erratum. SIAM J. Appl. Math. 20, No. 1, 141 (1971). · Zbl 0222.90045
[10] Edmonds, J.: Paths, trees and flowers. Canad. J. Math. 17, 449-467 (1965). · Zbl 0132.20903
[11] Lawler, E. L. (personal communication).
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.