Showing papers by "Chandrasekharan Rajendran published in 1990"
TL;DR: In this article, two heuristic preference relations are used as the basis for job insertion to build up a schedule by the heuristics, when evaluated over a large number of problems of various sizes, they were found to be very effective in yielding near-optimal solutions.
Abstract: In this article we present two heuristic algorithms for scheduling in the constrained or continuous flow shop to minimize total flow time of jobs. Two heuristic preference relations are used as the basis for job insertion to build up a schedule by the heuristics. When evaluated over a large number of problems of various sizes, the heuristics are found to be very effective in yielding near-optimal solutions.
109 citations