A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
J M Framinan (),
J N D Gupta and
R Leisten
Additional contact information
J M Framinan: University of Seville
J N D Gupta: University of Alabaman in Huntsville
R Leisten: University of Duisburg-Essen in Duisburg
Journal of the Operational Research Society, 2004, vol. 55, issue 12, 1243-1255
Abstract:
Abstract Makespan minimization in permutation flow-shop scheduling is an operations research topic that has been intensively addressed during the last 40 years. Since the problem is known to be NP-hard for more than two machines, most of the research effort has been devoted to the development of heuristic procedures in order to provide good approximate solutions to the problem. However, little attention has been devoted to establish a common framework for these heuristics so that they can be effectively combined or extended. In this paper, we review and classify the main contributions regarding this topic and discuss future research issues.
Keywords: scheduling; sequencing; heuristics; makespan (search for similar items in EconPapers)
Date: 2004
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (43)
Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2601784 Abstract (text/html)
Access to full text is restricted to subscribers.
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:pal:jorsoc:v:55:y:2004:i:12:d:10.1057_palgrave.jors.2601784
Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274
DOI: 10.1057/palgrave.jors.2601784
Access Statistics for this article
Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook
More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().