A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling

Shijin Wang, Ming Liu and Chengbin Chu

International Journal of Production Research, 2015, vol. 53, issue 4, 1143-1167

Abstract: This research investigates a two-stage no-wait hybrid flow-shop scheduling problem in which the first stage contains a single machine, and the second stage contains several identical parallel machines. The objective is to minimise the makespan. For this problem, existing literature emphasises on heuristics or optimal solutions for special cases, whereas this paper proposes a branch-and-bound algorithm. Several lower bounds for optimal and partial schedules are derived. Also, three dominance rules are deduced, and seven constructive heuristics are used to obtain initial upper bounds. Extensive computational tests on randomly generated problems are conducted. The results with comparisons indicate that the proposed bounds (especially partial lower bounds), dominance rules and the branch-and-bound algorithm are efficient.

Date: 2015
References: Add references at CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://hdl.handle.net/10.1080/00207543.2014.949363 (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:taf:tprsxx:v:53:y:2015:i:4:p:1143-1167

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/TPRS20

DOI: 10.1080/00207543.2014.949363

Access Statistics for this article

International Journal of Production Research is currently edited by Professor A. Dolgui

More articles in International Journal of Production Research from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().