主催: 一般社団法人 日本機械学会
会議名: 2016年度 年次大会
開催日: 2016/09/11 - 2016/09/14
Job shop scheduling problem is one of the most diffficult problem to find the optimum solution. Especially in those cases when the process delay occurred, we need to find solution in less time than planning phase. Many metaheuristic approaches were proposed to deel with combinatorial explosion problem of job shop scheduling. In this research, we propose a method for modification of a process schedule with partial rearrangement as specialized method for scheduling problems. The purpose of this research is reducing delays in delivery by moving processes on a gantt chart. An experiment shows this approach is effective on tight schedules. There are also benefits to modify schedule partially.