Heuristic algorithms for continuous flow‐shop problem

Chandrasekharan Rajendran and Dipak Chaudhuri

Naval Research Logistics (NRL), 1990, vol. 37, issue 5, 695-705

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.

Date: 1990
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199010)37:53.0.CO;2-L

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:37:y:1990:i:5:p:695-705

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().