Skip to main content
SpringerLink
Log in

Flow Shop Problem with Machine Time Couplings

  • Conference paper
  • First Online:
Engineering in Dependability of Computer Systems and Networks (DepCoS-RELCOMEX 2019)

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

Included in the following conference series:

Abstract

The work presents a multi-machine flow shop problem with minimization of the completion time of all tasks. Different temporal couplings concerning machine operation have been proposed, resulting from the analysis of practical cases. Their mathematical models were presented, an exact algorithm and two approximate algorithms were implemented.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

Similar content being viewed by others

References

  1. Adiri, I., Pohoryles, D.: Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times. Nav. Res. Logist. Q. 29(3), 495–504 (1982)

    Article  MathSciNet  Google Scholar 

  2. Bożejko, W., Hejducki, Z., Wodecki, M.: Applying metaheuristic strategies in construction projects management. J. Civ. Eng. Manag. 18(5), 621–630 (2012)

    Article  Google Scholar 

  3. Glover, F.: Tabu search. Part I. ORSA J. Comput. 1, 190–206 (1989). Second edition (1992)

    Article  Google Scholar 

  4. Gowrishankar, K., Rajendran, C., Srinivasan, G.: Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date. Eur. J. Oper. Res. 132(3), 643–665 (2001)

    Article  Google Scholar 

  5. Ruiz, R., Maroto, C.: A comprehensive review and evaluation of permutation flowshop heuristics. Eur. J. Oper. Res. 165(2), 479–494 (2005)

    Article  Google Scholar 

  6. Smutnicki, C.: Algorytmy szeregowania zadań. Politechnika Wrocławska (2012)

    Google Scholar 

  7. Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64(2), 278–285 (1993)

    Article  MathSciNet  Google Scholar 

  8. van Laarhoven, P.J.M., Aarts, E.H.L.: Simulated Annealing. Springer, Netherlands (1987)

    Book  Google Scholar 

Download references

Acknowledgement

The paper was partially supported by the Wrocław University of Science and Technology internal grant PWR-RUDN no. 45WB/00001/17 and National Science Centre of Poland, grant OPUS no. DEC 2017/25/B/ST7/02181.

Author information

Authors and Affiliations

  1. Faculty of Electronics, Wroclaw University of Science and Technology, Janiszewskiego Street 11/17, 50-372, Wrocław, Poland

    Wojciech Bożejko, Radosław Idzikowski & Mieczysław Wodecki

Authors
  1. Wojciech Bożejko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Radosław Idzikowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mieczysław Wodecki
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wojciech Bożejko .

Editor information

Editors and Affiliations

  1. Wrocław University of Science and Technology, Wroclaw, Poland

    Wojciech Zamojski

  2. Wrocław University of Science and Technology, Wroclaw, Poland

    Jacek Mazurkiewicz

  3. Wrocław University of Science and Technology, Wroclaw, Poland

    Jarosław Sugier

  4. Wrocław University of Science and Technology, Wroclaw, Poland

    Tomasz Walkowiak

  5. Systems Research Institute, Polish Academy of Sciences, Warsaw, Poland

    Janusz Kacprzyk

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bożejko, W., Idzikowski, R., Wodecki, M. (2020). Flow Shop Problem with Machine Time Couplings. In: Zamojski, W., Mazurkiewicz, J., Sugier, J., Walkowiak, T., Kacprzyk, J. (eds) Engineering in Dependability of Computer Systems and Networks. DepCoS-RELCOMEX 2019. Advances in Intelligent Systems and Computing, vol 987. Springer, Cham. https://doi.org/10.1007/978-3-030-19501-4_8

Download citation

Publish with us

Policies and ethics

Search

Navigation