# Optimal Scheduling of a Two-stage Hybrid Flow Shop

## Author Info

Listed author(s):
• Mohamed Haouari

()

• Lotfi Hidri
• Anis Gharbi
Registered author(s):

## Abstract

We present an exact branch-and-bound algorithm for the two-stage hybrid flow shop problem with multiple identical machines in each stage. The objective is to schedule a set of jobs so as to minimize the makespan. This is the first exact procedure which has been specifically designed for this strongly $$\mathcal{NP}$$ -hard problem. Among other features, our algorithm is based on the exact solution of identical parallel machine scheduling problems with heads and tails. We report the results of extensive computational experiments on instances which show that the proposed algorithm solves large-scale instances in moderate CPU time. Copyright Springer-Verlag 2006

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: http://hdl.handle.net/10.1007/s00186-006-0066-4

As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

## Bibliographic Info

Article provided by Springer & Gesellschaft für Operations Research (GOR) & Nederlands Genootschap voor Besliskunde (NGB) in its journal Mathematical Methods of Operations Research.

Volume (Year): 64 (2006)
Issue (Month): 1 (August)
Pages: 107-124

as
in new window

 Handle: RePEc:spr:mathme:v:64:y:2006:i:1:p:107-124 DOI: 10.1007/s00186-006-0066-4 Contact details of provider: Web page: http://www.springer.com Web page: http://www.ngb-online.nl/ Order Information: Web: http://www.springer.com/economics/journal/00186

## References

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:

as
in new window

1. Hoogeveen, J. A. & Lenstra, J. K. & Veltman, B., 1996. "Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard," European Journal of Operational Research, Elsevier, vol. 89(1), pages 172-175, February.
2. Moursli, O. & Pochet, Y., 2000. "A branch-and-bound algorithm for the hybrid flowshop," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 113-125, March.
3. Lin, Hung-Tso & Liao, Ching-Jong, 2003. "A case study in a two-stage hybrid flow shop with setup time and dedicated machines," International Journal of Production Economics, Elsevier, vol. 86(2), pages 133-143, November.
4. Carlier, Jacques, 1987. "Scheduling jobs with release dates and tails on identical machines to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 29(3), pages 298-306, June.
5. Néron, Emmanuel & Baptiste, Philippe & Gupta, Jatinder N. D., 2001. "Solving hybrid flow shop problem using energetic reasoning and global operations," Omega, Elsevier, vol. 29(6), pages 501-511, December.
6. Portmann, M. -C. & Vignier, A. & Dardilhac, D. & Dezalay, D., 1998. "Branch and bound crossed with GA to solve hybrid flowshops," European Journal of Operational Research, Elsevier, vol. 107(2), pages 389-400, June.
7. Brah, Shaukat A. & Hunsucker, John L., 1991. "Branch and bound algorithm for the flow shop with multiple processors," European Journal of Operational Research, Elsevier, vol. 51(1), pages 88-99, March.
8. Rajendran, Chandrasekharan & Chaudhuri, Dipak, 1992. "Scheduling in n-job, m-stage flowshop with parallel processors to minimize makespan," International Journal of Production Economics, Elsevier, vol. 27(2), pages 137-143, May.
9. Carlier, J. & Pinson, E., 1994. "Adjustment of heads and tails for the job-shop problem," European Journal of Operational Research, Elsevier, vol. 78(2), pages 146-161, October.
10. Joseph Adams & Egon Balas & Daniel Zawack, 1988. "The Shifting Bottleneck Procedure for Job Shop Scheduling," Management Science, INFORMS, vol. 34(3), pages 391-401, March.
11. Sriskandarajah, C. & Sethi, S. P., 1989. "Scheduling algorithms for flexible flowshops: Worst and average case performance," European Journal of Operational Research, Elsevier, vol. 43(2), pages 143-160, November.
Full references (including those not matched with items on IDEAS)

## Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

## Corrections

When requesting a correction, please mention this item's handle: RePEc:spr:mathme:v:64:y:2006:i:1:p:107-124. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)

or (Rebekah McClure)

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.

This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.