抄録
In recent production system, transportation among processing machines should be included to generate effective schedules. In this study, we focus on Lagrangian Decomposition and Coordination (LDC) method, as one of the distributed cooperative scheduling methods, and apply it to job shop scheduling problem with the transportation. We propose a new method using LDC to solve the production and transport vehicles scheduling problem, in this paper. In the proposed method, firstly we solve Lagrangian relaxation problem and obtain the completion time of each job. Secondly, we apply a heuristic which allocates transport tasks to vehicles, and decides routes of vehicles in the list scheduling which generates a feasible schedule. We show the effectiveness of the proposed method in several simulation experiments.
