Issue No. 11 - November (1974 vol. 23)
M.T. Kaufman , Digital Systems Laboratory, Stanford University
This paper considers a solution to the multiprocessor scheduling problem for the case where the ordering relation between tasks can be represented as a tree. Assume that we have n identical processors, and a number of tasks to perform. Each task T<inf>i</inf>requires an amount of time ?<inf>i</inf>to complete, 0 < ?<inf>i</inf>= k, so that k is an upper bound on task time. Tasks are indivisible, s
Assembly line problem, multiprocessing, optimal scheduling, parallel processing, tree graphs.
M.T. Kaufman, "An Almost-Optimal Algorithm for the Assembly Line Scheduling Problem", IEEE Transactions on Computers, vol. 23, no. , pp. 1169-1174, November 1974, doi:10.1109/T-C.1974.223825