Research Scheduling Problem Of Job-shop Robotic Manufacturing Cell

Chinese manufacturing converts from the traditional labor-intensive to the technology-intensive in the period of the economic transition of China and the intelligent equipment plays an important role. High precision machine tool and industrial robot appear in the manufacturing enterprises more and more and manufacturing show a high automation and intelligent. Cell that is composed of the CNC machine and the robot has been used more and more widely. The planning of cell’s machining path and robotic transport path play a very vital role in production efficiency. This paper mainly studies the scheduling problems of job-shop robotic manufacturing cell and includes the following aspects:(1) The job-shop robotic manufacturing cell has been introduced and analyzed from the several aspects of components, functioning, deadlock, scheduling flexibility and constraint in the round.(2) The mathematical optimization model is established according the characteristic of job-shop robotic manufacturing cell with one transport robot and several transport robots and the optimization is to minimize the maximum completion time. For problem of one transport robot, the disjunctive graph model is established and the critical path and the blocks(machine block and robot block) are analyzed and a conclusion is drawn that only the shift of the block’s operation may possible improve the maximum completion time. For that. an improved tabu search algorithm is built and then verified by the benchmark. Moreover, the improved disjunctive graph model is established for the problem of several transport robots and a genetic algorithm is built after encoding the problem and then verified by the benchmark.(3) A scheduling prototype system is developed by combining the software system of the robotic manufacturing cell that is developed by the research group. The job lays the foundations for developing the actual scheduling system.