SCHEDULING ALGORITHMS FOR SERIAL MULTIPRODUCT BATCH PROCESSES WITH TARDINESS PENALTIES

Customer satisfaction is one of the most important considerations in the operation of many batch processes, but has received very little attention in research. In this paper, we consider the serial multiproduct process with a single batch unit in each stage and with arbitrary intermediate storage policies. We present four heuristic algorithms for sequencing the production of a list of batches so as to minimize the total penalty due to late deliveries. Two algorithms employ an iterative improvement strategy, one uses simulated annealing, and one builds a good sequence from partial sequences. Simulated annealing gives the best results at the expense of large computation time, while an iterative algorithm is a close second.