Options
A simulated annealing heuristic for scheduling in a flowshop with bicriteria
Date Issued
01-01-1994
Author(s)
Gangadharan, Rajesh
Indian Institute of Technology, Madras
Abstract
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.
Volume
27