Skip to main content
SpringerLink
Log in

Hybrid Flow Shop Scheduling: Heuristic Solutions and LP-Based Lower Bounds

  • Conference paper
  • First Online:
Operations Research Proceedings 2010

Part of the book series: Operations Research Proceedings ((ORP))

Abstract

This paper is concerned with hybrid flow shop scheduling taking account of different additional constraints, especially transportation requests. Our objective is total weighted completion time minimization. We develop a fast (two phase) heuristic solution technique, which is based on simple dispatching rules. To evaluate our approach empirically, we introduce and analyze lower bounds based on the LP relaxation of time-indexed mixed-integer formulations.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Azizoğlu, E. çakmak, and S. Kondakci. A flexible flowshop problem with total flow time minimization. Eur. J. Oper. Res., 132(3): 528–538, 2001.

    Article  Google Scholar 

  2. J. Carlier, M. Haouari, M. Kharbeche, and A. Moukrim. An optimization-based heuristic for the robotic cell problem. Eur. J. Oper. Res., 202: 636–645, 2010.

    Article  Google Scholar 

  3. M.E. Dyer and L.A. Wolsey. Formulating the single machine sequencing problem with release dates as a mixed integer program. Discrete Appl. Math., 26: 255–270, 1990.

    Article  Google Scholar 

  4. M.X. Goemans. A supermodular relaxation for scheduling with release dates. In Queyranne (Eds.), Integer Programming and Combinatorial Optimization, Lect. Notes Comput. Sci., pages 288–300. Springer, 1996.

    Google Scholar 

  5. J. Hurink and S. Knust. List scheduling in a parallel machine environment with precedence constraints and setup times. Oper. Res. Lett., 29: 231–239, 2001.

    Article  Google Scholar 

  6. G.J. Kyparisis and C. Koulamas. A note on weighted completion time minimization in a flexible flow shop. Oper. Res. Lett., 29: 5–11, 2001.

    Article  Google Scholar 

  7. M. Queyranne and A.S. Schulz. Approximation bounds for a general class of precedence constrained parallel machine scheduling problems. SIAM J. Comp., 35(5): 1241–1253, 2006.

    Article  Google Scholar 

  8. A.S. Schulz. Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds. Lect. Notes Comput. Sci., 1084: 301–315, 1996.

    Google Scholar 

  9. M.X. Weng, J. Lu, and H. Ren. Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective. Int. J. Prod. Eco., 70: 215–226, 2001.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Duisburg-Essen, Essen, Germany

    Verena Gondek

Authors
  1. Verena Gondek
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Verena Gondek .

Editor information

Editors and Affiliations

  1. , Fakultät für Betriebswirtschaft, Universität der Bundeswehr München, Werner-Heisenberg-Weg 39, Neubiberg, 85577, Bayern, Germany

    Bo Hu

  2. , Fakultät für Wirtschafts- und Organisati, Universität der Bundeswehr München, Werner-Heisenberg-Weg 39, Neubiberg, 85577, Bayern, Germany

    Karl Morasch

  3. Fakultät für Informatik, Universität der Bundeswehr München, Werner-Heisenberg-Weg 39, Neubiberg, 85577, Germany

    Stefan Pickl

  4. , Fakultät für Informatik, Universität der Bundeswehr München, Werner-Heisenberg-Weg 39, Neubiberg, 85577, Bayern, Germany

    Markus Siegle

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gondek, V. (2011). Hybrid Flow Shop Scheduling: Heuristic Solutions and LP-Based Lower Bounds. In: Hu, B., Morasch, K., Pickl, S., Siegle, M. (eds) Operations Research Proceedings 2010. Operations Research Proceedings. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20009-0_77

Download citation

Publish with us

Policies and ethics

Search

Navigation