An almost-optimal algorithm for the assembly line scheduling problem
Digital Systems Laboratory, Stanford Electronics Laboratories, Stanford University, 1973 - Multiprocessors - 24 pages
The paper considers a solution to the multiprocessor scheduling problem for the case where the ordering relation between tasks can be represented as a tree. (Modified author abstract).
6 pages matching JSEP in this book
Results 1-3 of 6
What people are saying - Write a review
We haven't found any reviews in the usual places.
246l Eisenhower Avenue Air Force algorithm G ALMOST-OPTIMAL ALGORITHM Andrews AFB Andrews AFB Washington arbitrary preemption Arlington Army Electronics Command assembly line problem ASSEMBLY LINE SCHEDULING Brooks AFB California Center Attn chain-task Code Command Attn Command Fort Monmouth Commander Naval e/ns Eisenhower Avenue Electrical Eng execute the graph fk/n Georgia Avenue Hanscom Field Bedford head node Headquarters Hu's algorithm Hughes Aircraft Company Institute of Technology JSEP KEY WORDS L.G. Hanscom Field leaf nodes LINE SCHEDULING PROBLEM longest path algorithm longest-path schedule multi-unit task Multiprocessing multiprocessor scheduling Naval Research Laboratory nodes at levels number of processors Office of Naval Ohio Range New Mexico remove one level Research Lab Schenley Park Pittsburgh Science Security Classification SPONSORING MILITARY system that illustrates task-head tasks of length Technical Library Texas Tree of Tasks U.S. Army U.S. Navy unit tasks University Dept University Schenley Park Walter Reed Army Wright-Patterson AFB York