For P-complete problems such as traveling salesperson, cycle covers, 0-1 integer programming, multicommodity network flows, quadratic assignment, etc., it is shown that the approximation problem isâ€¦ (More)

A linear time algorithm to obtain a minimum finish time schedule for the two-processor open shop together with a polynomial time algorithm to obtain a minimum finish time preemptive schedule for openâ€¦ (More)

Exact and approximate algorithms are presented for scheduling independent tasks in a multiprocessor environment in which the processors have different speeds. Dynamic programming type algorithms areâ€¦ (More)

Given <italic>r</italic> numbers <italic>s</italic><subscrpt>1</subscrpt>, Â·Â·Â·, <italic>s<subscrpt>r</subscrpt></italic>, algorithms are investigated for finding all possible combinations of theseâ€¦ (More)

AaSTRACT An O(n) t~me algorithm is presented to obtain an opt,mal fimsh time preemptive schedule for n independent tasks on m uniform processors This algorithm assumes that the tasks are lnmallyâ€¦ (More)

Considers the data broadcasting problem for single instruction stream, multiple data stream (SIMD) computers. Two versions of this problem, i.e., random access read (RAR) and random access writeâ€¦ (More)