PARALLEL BRANCH-AND-BOUND METHODS FOR THE JOB-SHOP SCHEDULING PROBLEM

Job-Shop Scheduling (JSS) problems are among the more difficult to sol ve in the class of NP-complete problems. The only successful approach has been branch-and-bound based algorithms, but such algorithms depend heavily on good bound functions. Much work has been done to identify such functions for the JSS problem, but with limited success. Even wit h recent methods, it is still not possible to solve problems substanti ally larger than 10 machines and 10 jobs. In the current study, we foc us on parallel methods for solving JSS problems. We implement two diff erent parallel branch-and-bound algorithms for JSS on a 16-processor M EIKO Computing Surface with Intel i860 processors and perform extensiv e computational testing using classical publicly available benchmark p roblems. The parallel part of one of the implementations is based on a similar parallel code for Quadratic Assignment Problems. Results are reported for different branching rules proposed in the literature.