Batch process makespan

A batch process manufactures Product 1 and Product 2 in the same process. The manufacture of both products involves three steps with durations given in Table 14.9. Calculate the cycle time and makespan for one batch each of Product 1 and Product 2 with no delay between the two batches for ... 

We chose the above problem merely to evaluate the potential of SA for the batch process scheduling problems. It was an obvious choice, because it has been studied extensively (Ku et al. 1987) in the literature, thus algorithms for comparison already exist in the literature. This problem of finding a sequence with minimum total time (called makespan) to produce all N batches has been shown to be NP-complete for M>2 by Garey et al. (1976), thus no polynomialtime algorithms exist for getting optimal solutions. We now describe our implementation of the SA algorithm. 

Expected profit value Shortfall Inventory Makespan Number of batches Profit value Processing time Final time Initial time Sales of product p Batch b assigned to prod. p (Binary variable) Binary variable... 

---