Parallel Branch and Bound Algorithm for Product Testing Job Scheduling Problems using MapReduce

Yu Yu, Institute of Ocean Instruments and Metrology, Qilu University of Technology (Shandong Academy of Sciences), Qingdao, China
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
more » ... test scheduling, this paper proposes the constraints of the job parallelization scheduling mode, solves the job parallelization scheduling problem under certain constraints and gives the Gantt chart and the assignment table corresponding to the optimal solution. The optimal solution can provide calibration and comparison for various artificial intelligence scheduling algorithms. Index Terms-MapReduce, Job shop, parallel algorithm.
doi:10.18178/ijmlc.2020.10.2.934 fatcat:2zujcxi2angzrnidnjxpusrfbi