Premium
Heuristic algorithms for continuous flow‐shop problem
Author(s) -
Rajendran Chandrasekharan,
Chaudhuri Dipak
Publication year - 1990
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(199010)37:5<695::aid-nav3220370508>3.0.co;2-l
Subject(s) - heuristics , mathematical optimization , flow shop scheduling , heuristic , job shop scheduling , computer science , schedule , scheduling (production processes) , flow (mathematics) , algorithm , mathematics , geometry , operating system
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.