A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling Academic Article

abstract

• Recently, there have been considerable interests in the multiprocessor job scheduling problem, in which a job can be processed in parallel on one of several alternative subsets of processors. In this paper, a polynomial time approximation scheme is presented for the problem in which the number of processors in the system is a fixed constant. This result is the best possible because of the strong NP-hardness of the problem and is a significant improvement over the past results: the best previous result was an approximation algorithm of ratio 7/6 + for 3-processor systems based on Goemans's algorithm for a restricted version of the problem. 2001 Society for Industrial and Applied Mathematics.

authors

• Chen, Jianer

published proceedings

• SIAM Journal on Computing

author list (cited authors)

• Chen, J., & Miranda, A.

citation count

• 30

complete list of authors

• Chen, Jianer||Miranda, Antonio

publication date

• January 2001

publisher

• Society for Industrial & Applied Mathematics (SIAM)  Publisher

published in

• SIAM Journal on Computing  Journal

Digital Object Identifier (DOI)

• 10.1137/s0097539798348110

URI

• https://hdl.handle.net/1969.1/178674

start page

• 1

end page

• 17

volume

• 31

issue

• 1

URL

• http%3A%2F%2Fdx.doi.org%2F10.1137%2Fs0097539798348110