リエントラントフローショップスケジューリング問題に関する研究(第2報) : 発見的なスケジューリング手法の提案

概要

論文の詳細を見る
Two new heuristic procedures for re-entrant flow shop scheduling problem are proposed to plan a feasible production schedule in industrial manufacturing factories. Each job is assigned to one of idle periods within a limited time on a cyclic Gantt chart. One heuristic procedure is for an assignment of a target job on the machine while an adequate the idle time is remained for undecided jobs. Another heuristic procedure is based on solutions for two classical optimization problems, or a job assignment problem and a knapsack problem. The starting time of the target job is optimally determined at each step in the scheduling. The results indicate that the proposed procedures give a good schedule in comparison with the optimal schedule derived theoretically. The Calculation times are also evaluated and verified a validity of the use in actual manufacturing factories.
2008-11-05