Scheduling a two-stage hybrid flow shop with parallel machines at the first stage

J.N.D. Gupta, A.M.A. Hariri and C.N. Potts

Annals of Operations Research, 1997, vol. 69, issue 0, 191 pages

Abstract: This paper considers a non-preemptive two-stage hybrid flow shop problem in which the first stage contains several identical machines, and the second stage contains a single machine. Each job is to be processed on one of the first-stage machines, and then on the second-stage machine. The objective is to find a schedule which minimizes the maximum completion time or makespan. The problem is NP-hard in the strong sense, even when there are two machines at the first stage. Several lower bounds are derived and are tested in a branch and bound algorithm. Also, constructive heuristics are presented, and a descent algorithm is proposed. Extensive computational tests with up to 250 jobs, and up to 10 machines in the first stage, indicate that some of the heuristics consistently generate optimal or near-optimal solutions. Copyright Kluwer Academic Publishers 1997

Date: 1997
References: Add references at CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018976827443 (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:spr:annopr:v:69:y:1997:i:0:p:171-191:10.1023/a:1018976827443

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018976827443

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().