New heuristics for flow shop problem to minimize makespan

D Bai () and L Tang ()
Additional contact information
D Bai: Northeastern University
L Tang: Northeastern University

Journal of the Operational Research Society, 2010, vol. 61, issue 6, 1032-1040

Abstract: Abstract This paper investigates the flow shop problem with the objective to minimize makespan. New algorithms are designed: one is off-line heuristic, Single Job First, for problem F m ∥C max ; and the other is on-line heuristic, Dynamic Single Job First (DSJF), for problem F m |r i |C max and its on-line version. It is proved that the two heuristics are asymptotically optimal when the size of the problem is large enough. In addition, the asymptotical optimality of First-Come, First-Served manner is obtained as a byproduct of the asymptotical analysis of DSJF heuristic. At the end of the paper, a new lower bound with performance guarantee is provided for problem F m ∥C max , and computational experiments show the effectiveness of these heuristic algorithms.

Keywords: scheduling; flow shop problem; makespan; performance analysis of algorithm (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1057/jors.2009.44 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:61:y:2010:i:6:d:10.1057_jors.2009.44

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/jors.2009.44

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 ().