The scheduling of batch chemical processes is studied in multiproduct serial plants. It is assumed that the processing time in each process unit is subject to random fluctuations that follow a normal distribution. The makespan, i.e., the time needed to obtain all products, is calculated using recurrence formulae for several types of batch processes that differ with respect to the sort of intermediate storage which is supposed to be available: UIS, NIS, FIS (respectively unlimited, nonexisting and finite intermediate storage), and ZW (zero wait plants). Since the processing times are uncertain, given a sequence of products, several samples are taken to find the most likely makespan and its uncertainty. The most favorable makespan is determined by the method of Simulated Annealing, which is adequate for optimization in combinatorial problems.
|Number of pages||10|
|Journal||Brazilian Journal of Chemical Engineering|
|Publication status||Published - 1 Sep 1996|
ASJC Scopus subject areas
- Chemical Engineering(all)