An Effective MILP-Based Decomposition Algorithm for Integrated Scheduling and Redesign of Flexible Job-Shop Plants

BASÁN, NATALIA PAOLA; COCCOLA MARIANA EVANGELINA; GARCÍA DEL VALLE, ALEJANDRO; MENDEZ CARLOS ALBERTO

Bologna

Congreso; 14th International Congress on Chemical and Process Engineering; 2019

This paper presents a decomposition algorithm for the integrated scheduling and redesign problem of a multistage batch plant dealing with multipurpose units and heterogeneous recipes. First, the procedure solves the scheduling problem considering the existing plant configuration with the main goal of minimizing the makespan. Then, a second objective of minimizing the number of units utilized without worsen the makespan achieved in the first stage is considered. The units released can be reallocated to other compatible processing stages in order to minimize the initial makespan value. In order to tackle large industrial examples, both scheduling and redesign problems are solved through a decomposition algorithm, which has a MILP model asits core. The procedure is tested on several realistic instances, demonstrating its robustness and applicability.