Skip to main content
SpringerLink
Log in

Heuristic Solution Algorithm for Routing Flow Shop with Buffers and Ready Times

  • Conference paper
Advances in Systems Science

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 240))

Abstract

This work discusses the routing flow shop which means that jobs, located at workstations represented by nodes of a transportation network, are performed by movable machines travelling among the workstations. The version with buffers, ready times and different speeds of machines to minimize the makespan is considered. The heuristic constructive solution algorithm and its analytical assessment are presented. Results of simulation experiments evaluating the algorithm are also given.

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. Allahverdi, A., Ng, C.T., Cheng, T.C.E., Kovalyov, M.Y.: A survey of scheduling problems with setup times or costs. European Journal of Operational Research 187, 985–1032 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  2. Averbakh, I., Berman, O.: A simple heuristic for m-machine flow-shop and its applications in routing-scheduling problems. Operations Research 47, 165–170 (1999)

    Article  MATH  Google Scholar 

  3. Averbakh, I., Berman, O., Chernykh, I.: A 6/5 -approximation algorithm for the two-machine routing open-shop problem on a two-node network. European Journal of Operational Research 166, 3–244 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  4. Cheng, J., Steiner, G., Stephenson, P.: A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times. European Journal of Operational Research 130, 559–575 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  5. Christofides, N.: Worst-case analysis of a new heuristic for the traveling salesman problem. Technical Report, GSIA, Carnegie-Mellon University, Pittsburgh, PA (1976)

    Google Scholar 

  6. Framinan, J.M., Gupta, J.N.D., Leisten, R.: A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. Journal of the Operational Research Society 55, 1243–1255 (2004)

    Article  MATH  Google Scholar 

  7. Gupta, J.N.D., Stafford, E.F.: Flowshop scheduling research after five decades. European Journal of Operational Research 169, 699–711 (2006)

    Article  MATH  Google Scholar 

  8. Johnson, S.M.: Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1, 61–68 (1954)

    Article  Google Scholar 

  9. Józefczyk, J., Markowski, M.: Heuristic Algorithms for Solving Uncertain Routing-Scheduling Problem. In: Rutkowski, L., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2008. LNCS (LNAI), vol. 5097, pp. 1052–1063. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  10. Józefczyk, J., Markowski, M.: Simulated annealing based robust algorithm for routing-scheduling problem with uncertain execution times. Information Control Problems in Manufacturing 13 (2009)

    Google Scholar 

  11. Józefczyk, J., Markowski, M.: Integrated Optimization Problems in Operations Research. In: Proceedings of 23rd Int. Conf. on Systems Research, Informatics and Cybernetics, Analysis and Decision Making for Complex and Uncertain Systems, Baden-Baden, Germany, vol. 1, pp. 39–43 (2011)

    Google Scholar 

  12. Potts, C.N., Kovalyov, M.Y.: Scheduling with batching: a review. European Journal of Operational Research 120, 228–249 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  13. Rajendran, C.H., Ziegler, H.: Scheduling to minimize the sum of weighted flow time and weighted tardiness of jobs in a flowshop with sequence -dependent setup times. European Journal of Operational Research 149, 513–522 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  14. Rebaine, D.: Flow shop vs. permutation shop with time delays. Computers & Industrial Engineering 48, 357–362 (2005)

    Article  Google Scholar 

  15. Ruiz, R., Allahverdi, A.: No-wait flowshop with separate setup times to minimize maximum lateness. International Journal of Advanced Manufacturing Technology 35, 551–565 (2007)

    Article  Google Scholar 

  16. Ruiz, R., Stutzle, T.: An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. IRIDIA, Technical report number TR/IRIDIA/2006-02 (2006)

    Google Scholar 

  17. Syslo, M.M., Deo, N., Kowalik, J.S.: Algorithms of discrete optimization. In: PWN, p. 299 (1999) (in Polish)

    Google Scholar 

  18. Yu, W., Liu, Z., Wang, L., Fan, T.: Routing open shop and flow shop scheduling problems. European Journal of Operational Research 213, 24–36 (2011)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Intelligent Decision Support Systems, Wrocław University of Technology, wyb. Wyspianskiego 27, 50-370, Wrocław, Poland

    Jerzy Józefczyk & Michał Markowski

Authors
  1. Jerzy Józefczyk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michał Markowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jerzy Józefczyk .

Editor information

Editors and Affiliations

  1. Institute of Informatics, Wroclaw University of Technology, Wrocław, Poland

    Jerzy Swiątek

  2. Institute of Informatics, Wroclaw University of Technology, Wrocław, Poland

    Adam Grzech

  3. Institute of Informatics, Wroclaw University of Technology, Wrocław, Poland

    Paweł Swiątek

  4. Institute of Informatics, Wroclaw University of Technology, Wrocław, Poland

    Jakub M. Tomczak

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Józefczyk, J., Markowski, M. (2014). Heuristic Solution Algorithm for Routing Flow Shop with Buffers and Ready Times. In: Swiątek, J., Grzech, A., Swiątek, P., Tomczak, J. (eds) Advances in Systems Science. Advances in Intelligent Systems and Computing, vol 240. Springer, Cham. https://doi.org/10.1007/978-3-319-01857-7_52

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-01857-7_52

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-01856-0

  • Online ISBN: 978-3-319-01857-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation