This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Almost-Optimal Algorithm for the Assembly Line Scheduling Problem
November 1974 (vol. 23 no. 11)
pp. 1169-1174
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 Tirequires an amount of time ?ito complete, 0 < ?i= k, so that k is an upper bound on task time. Tasks are indivisible, s
Index Terms:
Assembly line problem, multiprocessing, optimal scheduling, parallel processing, tree graphs.
Citation:
M.T. Kaufman, "An Almost-Optimal Algorithm for the Assembly Line Scheduling Problem," IEEE Transactions on Computers, vol. 23, no. 11, pp. 1169-1174, Nov. 1974, doi:10.1109/T-C.1974.223825
Usage of this product signifies your acceptance of the Terms of Use.