General Reordering Algorithm for Scheduling of Batch Processes

JOURNAL OF CHEMICAL ENGINEERING OF JAPAN

Shinji Hasebe¹  Iori Hashimoto¹  Akio Ishikawa² 

[1] Department of Chemical Engineering, Kyoto University;Kurosaki Plant, Mitsubishi Kasei Corp.

关键词: Process System;    Batch Process;    Scheduling;    Combinatorial Optimization Problem;   

DOI  :  10.1252/jcej.24.483

来源: Maruzen Company Ltd

【 摘 要 】

References(5)Cited-By(8)A sequencing algorithm applicable to various scheduling problems is proposed. It consists of two reordering operations, the insertion of a job and the exchange of two jobs. We propose a new reordering algorithm which can be used to solve scheduling problems of multiproduct processes with network structure.The proposed reordering algorithm is applied to the scheduling problem of a multiproduct batch process consisting of parallel production lines with a shared unit. It is shown that the simultaneous reordering of several jobs effectively avoids becoming trapped in a bad local optimum. To execute simultaneous reordering of jobs, an algorithm consisting of two steps, the aggregation of jobs and the reordering of aggregated jobs, is proposed.

【 授权许可】

Unknown