Skip to main content

Two-Machine Flow Shop with a Dynamic Storage Space and UET Operations

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

Abstract

The paper establishes the NP-hardness in the strong sense of a two-machine flow shop scheduling problem with unit execution time (UET) operations, dynamic storage availability, job dependent storage requirements, and the objective to minimise the time required for the completion of all jobs, i.e. to minimise the makespan. Each job seizes the required storage space for the entire period from the start of its processing on the first machine till the completion of its processing on the second machine. The considered scheduling problem has several applications, including star data gathering networks and certain supply chains and manufacturing systems. The NP-hardness result is complemented by a polynomial-time approximation scheme (PTAS) and several heuristics. The presented heuristics are compared by means of computational experiments.

Keywords

  • Two-machine flow shop
  • Makespan
  • Dynamic storage
  • Computational complexity
  • Polynomial-time approximation scheme

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-030-21803-4_112
  • Chapter length: 10 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   189.00
Price excludes VAT (USA)
  • ISBN: 978-3-030-21803-4
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   249.99
Price excludes VAT (USA)
Fig. 1.
Fig. 2.

References

  1. Berlińska, J.: Scheduling for data gathering networks with data compression: Berlińska. J. Eur. J. Oper. Res. 246, 744–749 (2015)

    Google Scholar 

  2. Berlińska, J.: Scheduling data gathering with maximum lateness objective. In: Wyrzykowski, R. et al. (eds.) PPAM 2017, Part II. LNCS, vol. 10778, pp. 135–144. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-78054-2_13

  3. Berlińska, J.: Heuristics for scheduling data gathering with limited base station memory. Ann. Oper. Res. (2019). https://doi.org/10.1007/s10479-019-03185-3. In press

    Google Scholar 

  4. Błażewicz, J., Kubiak, W., Szwarcfiter, J.: Scheduling unit-time tasks on flow-shops under resource constraints. Ann. Oper. Res. 16, 255–266 (1988)

    Google Scholar 

  5. Błażewicz J., Lenstra, J.K., Rinnooy Kan, A.H.G.: Scheduling subject to resource constraints: classification and complexity. Discret. Appl. Math. 5, 11–24 (1983)

    Google Scholar 

  6. Fernandez de la Vega, W., Lueker, G.S.: Bin packing can be solved within \(1+ \varepsilon \) in linear time. Combinatorica 1(4), 349–355 (1981)

    Google Scholar 

  7. Fung, J., Zinder, Y.: Permutation schedules for a two-machine flow shop with storage. Oper. Res. Lett. 44(2), 153–157 (2016)

    Google Scholar 

  8. Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco (1979)

    Google Scholar 

  9. Gu, H., Memar, J., Kononov, A., Zinder, Y.: Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements. J. Discret. Algorithms 52–53, 143–155 (2018)

    Google Scholar 

  10. Luo, W., Xu, Y., Gu, B., Tong, W., Goebel, R., Lin, G.: Algorithms for communication scheduling in data gathering network with data compression. Algorithmica 80(11), 3158–3176 (2018)

    Google Scholar 

  11. Röck, H.: Some new results in no-wait flow shop scheduling. Z. Oper. Res. 28(1), 1–16 (1984)

    Google Scholar 

  12. Süral, H., Kondakci, S., Erkip, N.: Scheduling unit-time tasks in renewable resource constrained flowshops. Z. Oper. Res. 36(6), 497–516 (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yakov Zinder .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Verify currency and authenticity via CrossMark

Cite this paper

Berlińska, J., Kononov, A., Zinder, Y. (2020). Two-Machine Flow Shop with a Dynamic Storage Space and UET Operations. In: Le Thi, H., Le, H., Pham Dinh, T. (eds) Optimization of Complex Systems: Theory, Models, Algorithms and Applications. WCGO 2019. Advances in Intelligent Systems and Computing, vol 991. Springer, Cham. https://doi.org/10.1007/978-3-030-21803-4_112

Download citation