制約論理プログラミングによるバッチ反応機の最適生産計画

概要

論文の詳細を見る
In this paper the efficient production scheduling of batch reactors is presented using a Constraint Logic Programming (CLP). It is difficult to solve the industrial scheduling problem because of several constraints. And the computation should be fast, since the customers often change and cancel orders, and put new orders frequently. The main merit of this system is to save production cost and to realize better order fulfillment, such as to keep deadlines of deliveries. Besides the planner has great flexibility to simulate plans, to respond the customer's request because of the performance of this system, and also the planner is relieved from the routine work. CLP is one of the powerful tools to solve the discrete scheduling problem, which enabled us to consider several difficult constraints easily. After the explanation of this system, as the example, the application to the scheduling of batch reactors is presented and the effectiveness of this system is confirmed.
社団法人電子情報通信学会の論文
2004-06-03