Scheduling multi-purpose batch plants with junction constraints |
| |
| Authors: | Y M DESSOUKY C A ROBERTS M M DESSOUKY G WILSONS |
| |
| Affiliation: | 1. Systems Analysis Department , Miami University , Oxford, OH, 45056, USA.;2. Department of Industrial and Management Systems Engineering , Arizona State University , Tempe, AZ, 85287-5906, USA.;3. Department of Industrial and Systems Engineering , University of Southern California , Los Angeles, CA, 90089-0193, USA. |
| |
| Abstract: | There is an increasing trend in the chemical process industry to operate flexible batch plants because of their capability to manufacture multiple products simultaneously by sharing the same process resources. In this paper, the scheduling of multi-purpose batch chemical plants with junction (header) constraints is considered. A mixed-integer non-linear model for the scheduling of multi-purpose batch chemical plants is formulated that considers the connection between equipment sets, transfer times, variable batch sizes, alternative process plans, and batch merging. Because of the computational time complexity of the batch scheduling problem, a heuristic scheduling algorithm that minimizes the total tardiness is developed lo solve the model. |
| |
| Keywords: | |
|
|
