A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Parallel Branch and Bound Algorithm for Product Testing Job Scheduling Problems using MapReduce
2020
International Journal of Machine Learning and Computing
This paper analysis the similarities and differences between test scheduling and production scheduling. A job parallelization scheduling model based on characteristics of test scheduling is proposed. Further, the branch and bound search algorithm of job shop scheduling problem is studied. The MR-WFBB algorithm based on cloud computing MapReduce computing model is proposed. This algorithm is a novel job shop scheduling parallelization breadth-first branch and bound algorithm. Based on the actual
doi:10.18178/ijmlc.2020.10.2.934
fatcat:2zujcxi2angzrnidnjxpusrfbi