Continuous Time Representation Approach to Batch and Continuous Process Scheduling. 2. Computational Issues

A technique that exploits the characteristics of the problem in order to reduce the amount of required computation is reported, based on the Bayesian heuristic (BH) approach to discrete optimization.

Abstract

The first part of this series presented a general mathematical framework for describing a wide variety of scheduling problems arising in multiproduct/multipurpose batch and continuous chemical plants. The problem was formulated as a large mixed integer nonlinear programming model (MINLP). A technique that exploits the characteristics of the problem in order to reduce the amount of required computation is reported. The technique is based on the Bayesian heuristic (BH) approach to discrete optimization. The BH approach allows incorporation of different heuristics into the solution process. A material requirement planning (MRP) heuristic is employed in the work reported herein. Computational examples are presented to illustrate the applicability of the method to the scheduling of multipurpose plants under a variety of operational conditions.