A new completion time algorithm considering an out-of-phase policy in batch processes

Abstract

To raise the scheduling efficiency in batch processes, we propose a new approach is to consider an out-of-phase operating mode. Previous scheduling algorithms which have been concerned only with single-unit single-stage case problems are extended. We suggest new completion time algorithms of single-product and multiproduct batch processes for the unlimited intermediate storage (UIS) and no intermediate storage (NIS) case from the single-product multicampaign model. To check out the effect of our algorithm and to visualize processing progress, we develop the program calculating and displaying the Gantt chart mapping-Gantt Man. Five simple examples are presented to show the effectiveness of the proposed algorithms.