Skip to main content
Springer Nature Link
Log in

Algorithms for Flow Shop with Job–Dependent Buffer Requirements

  • Conference paper
  • First Online:
Modelling, Computation and Optimization in Information Systems and Management Sciences (MCO 2021)

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 363))

  • 455 Accesses

Abstract

The paper is concerned with algorithms for the two-machine flow shop, where each job needs storage space (a buffer) during the entire time of its processing. The buffer requirement is determined by the duration of job’s first operation. The goal is to minimise the time needed for the completion of all jobs. This scheduling problem is NP-hard in the strong sense. Recently, the polynomial-time algorithms were developed for particular cases of this problem. In this paper, we discuss two heuristics based on these polynomial-time algorithms and compare them with other efficient heuristics.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Brucker, P., Heitmann, S., Hurink, J.: Flow-shop problems with intermediate buffers. OR Spectr. 25(4), 549–574 (2003)

    Article  MathSciNet  Google Scholar 

  2. Brucker, P., Knust, S.: Complex Scheduling. Springer, Heidelberg (2012)

    Book  Google Scholar 

  3. Coffman, E.G., Jr., Garey, M.R., Johnson, D.S.: An application of bin-packing to multiprocessor scheduling. SIAM J. Comput. 7(1), 1–17 (1978)

    Article  MathSciNet  Google Scholar 

  4. Emmons, H., Vairaktarakis, G.: Flow Shop Scheduling. Springer, Heidelberg (2013)

    Book  Google Scholar 

  5. Fung, J., Singh, G., Zinder, Y.: Capacity planning in supply chains of mineral resources. Inf. Sci. 316, 397–418 (2015)

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

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

    Article  Google Scholar 

  9. Kononov, A., Hong, J.S., Kononova, P., Lin, F.C.: Quantity-based buffer-constrained two-machine flowshop problem: active and passive prefetch models for multimedia applications. J. Sched. 15(4), 487–497 (2012)

    Article  MathSciNet  Google Scholar 

  10. Kononov, A., Memar, J., Zinder, Y.: Flow shop with job–dependent buffer requirements—a polynomial–time algorithm and efficient heuristics. In: Khachay, M., Kochetov, Y., Pardalos, P. (eds.) MOTOR 2019. LNCS, vol. 11548, pp. 342–357. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-22629-9_24

    Chapter  MATH  Google Scholar 

  11. Kononov, A., Memar, J., Zinder, Y.: On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements. J. Glob. Optim. 1–12 (2021). https://doi.org/10.1007/s10898-021-01097-w

  12. Kononova, P., Kochetov, Y.A.: The variable neighborhood search for the two machine flow shop problem with a passive prefetch. J. Appl. Ind. Math. 7(1), 54–67 (2013)

    Article  MathSciNet  Google Scholar 

  13. Lin, F.C., Hong, J.S., Lin, B.M.: A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations. Comput. Oper. Res. 36(4), 1158–1175 (2009)

    Article  Google Scholar 

  14. Lin, F.C., Hong, J.S., Lin, B.M.: Sequence optimisation for media objects with due date constraints in multimedia presentations from digital libraries. Inf. Syst. 38(1), 82–96 (2013)

    Article  MathSciNet  Google Scholar 

  15. Lin, F.C., Lai, C.Y., Hong, J.S.: Minimize presentation lag by sequencing media objects for auto-assembled presentations from digital libraries. Data Knowl. Eng. 66(3), 382–401 (2008)

    Article  Google Scholar 

  16. Pinedo, M.L.: Scheduling: Theory, Algorithms, and Systems. Springer (2016)

    Google Scholar 

  17. Witt, A., Voß, S.: Simple heuristics for scheduling with limited intermediate storage. Comput. Oper. Res. 34(8), 2293–2309 (2007)

    Article  Google Scholar 

Download references

Acknowledgement

The research of the first author was supported by the program of fundamental scientific researches of the SB RAS No I.5.1., project No 0314-2019-0014, and by the Russian Foundation for Basic Research, project 20-07-00458.

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia

    Alexander Kononov

  2. University of Technology Sydney, PO Box 123, Broadway, NSW, 2007, Australia

    Julia Memar & Yakov Zinder

Authors
  1. Alexander Kononov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Julia Memar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yakov Zinder
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Julia Memar .

Editor information

Editors and Affiliations

  1. Computer science and Applications Department, LGIPM, University of Lorraine, Metz Cedex, France

    Hoai An Le Thi

  2. Laboratory of Mathematics, National Institute for Applied Sciences - Rouen, Saint-Etienne-du-Rouvray Cedex, France

    Tao Pham Dinh

  3. Computer science and Applications Department, LGIPM, University of Lorraine, Metz Cedex, France

    Hoai Minh Le

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kononov, A., Memar, J., Zinder, Y. (2022). Algorithms for Flow Shop with Job–Dependent Buffer Requirements. In: Le Thi, H.A., Pham Dinh, T., Le, H.M. (eds) Modelling, Computation and Optimization in Information Systems and Management Sciences. MCO 2021. Lecture Notes in Networks and Systems, vol 363. Springer, Cham. https://doi.org/10.1007/978-3-030-92666-3_6

Download citation

Publish with us

Policies and ethics