メタ戦略によるプラスチック成型工程スケジューリング(数理的最適化(1))

概要

論文の詳細を見る
In this paper, a scheduling problem in a plastics forming plant is studied. This problem basically belongs to the class of unrelated parallel machine problems, but includes several restrictions which originate from the necessity to use auxiliary equipments. We have introduced a method to solve them without relying upon dispatching rules by transforming the scheduling problem to a mathematical programming problem, and by representing feasible schedules by binary strings. This formulation enables to use the search methods (such as simulated annealing methods, genetic algorithms, etc.). Moreover, in this paper, we propose ways for improving a serch of the simulated annealing method by using the structural neighborhood of solutions. We actually carrie out computational experimetns for the problems of practical size, which shows that our methods can give satisfactory solutions to the considered scheduling problem.
社団法人日本オペレーションズ・リサーチ学会の論文
1994-10-11