C Rajendran

We consider the flowshop scheduling problem with the twin-objective of minimizing makespan and total flowtime. We apply the Simulated Annealing (SA) technique to develop the proposed heuristic. Two new heuristics are proposed to provide the seed sequences for the SA heuristic. When compared with the existing heuristics, the proposed SA heuristic is found to perform much better. © 1994.

We present two simple heuristic algorithms for scheduling to minimize makespan in the constrained (or no-wait) flowshop. While developing the heuristics, we first present the methods to obtain the initial seed sequences, and subsequently obtain better solutions by an improvement technique. When evaluated over a large number of problems of various sizes, the solutions yielded by the proposed heuristic algorithms are found to be reasonably accurate, and superior to the ones given by the existing heuristics. © 1993.