メタ戦略によるプラスチック成型工程スケジューリング問題の解法

DOI Web Site Web Site 被引用文献3件 参考文献14件

書誌事項

タイトル別名
  • Application of Search Methods to Scheduling Problem in Plastics Forming Plant
  • メタ戦略によるプラスチック成型工程スケジューリング問題の解法--バイナリ記号表現によるアプローチ
  • メタ センリャク ニ ヨル プラスチック セイケイ コウテイ スケジューリング
  • A Binary Representation Approach
  • バイナリ記号表現によるアプローチ

この論文をさがす

抄録

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 equipment. Thus it can be regarded as an example of complex scheduling problems arising in industries. The paper presents a new scope for the study of practical scheduling problems by proposing a method to solve them without relying upon dispatching rules. First, we transform the scheduling problem to a mathematical programming problem, and represent feasible schedules by binary strings. This formulation enables to use the search methods (such as simulated annealing methods, genetic algorithms, etc.). We actually coded several search methods and carried out computational experiments for the problems of practical size. Results indicate that our methods can give satisfactory solutions to the considered scheduling problem.

収録刊行物

被引用文献 (3)*注記

もっと見る

参考文献 (14)*注記

もっと見る

キーワード

詳細情報 詳細情報について

問題の指摘

ページトップへ