A Mixed Genetic Algorithm for Job-Shop Scheduling Problem of Robotic Manufacturing Cell with Multirobot

Abstract

Under the consideration of the transporting time and the idle time of the robot among loading stations, machine tool and unloading station, to solve job-shop scheduling problem of robotic manufacturing cell with multirobot, this paper aims to figure out the minimum time that all work pieces are completed by the machine tool and transported to the unloading station. Firstly, this paper establishes a new scheduling method that robot transport process compose transport sequence matrix. Robot transports the work pieces to machine tool by transport sequence vector while machine tool manufacture processes it in accordance with the rules of First Come First Service (FCFS). Then, a mixed algorithm combining traditional genetic algorithm with heuristic adjustment algorithm is proposed to solve the scheduling problem. The effectiveness of algorithm will be verified by the result of experiment.