Advertisement

Flow Shop with Job–Dependent Buffer Requirements—a Polynomial–Time Algorithm and Efficient Heuristics

  • Alexander Kononov
  • Julia MemarEmail author
  • Yakov Zinder
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11548)

Abstract

The paper is concerned with the two-machine flow shop, where each job needs storage space (a buffer requirement) 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 even for very restricted cases such as the case with a given order of jobs processing on one of the machines. The paper contributes to the efforts of establishing the borderline between the NP-hard and polynomial-time solvable cases by proving that there exists a polynomial-time algorithm which constructs an optimal schedule if the duration of each operation does not exceed one-fifth of the buffer capacity. The presented polynomial-time algorithm is used as a basis for a heuristic for the general case. This heuristic is complemented by a Lagrangian relaxation based heuristic and a bin-packing based constructive heuristic. The heuristics are tested by computational experiments.

Keywords

Flow shop Buffer Makespan Polynomial-time algorithm Lagrangian relaxation Heuristic 

References

  1. 1.
    Brucker, P., Heitmann, S., Hurink, J.: Flow-shop problems with intermediate buffers. OR Spectr. 25(4), 549–574 (2003)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Brucker, P., Knust, S.: Complex Scheduling. Springer, Heidelberg (2012).  https://doi.org/10.1007/978-3-642-23929-8CrossRefzbMATHGoogle Scholar
  3. 3.
    Coffman Jr., E.G., Garey, M.R., Johnson, D.S.: An application of bin-packing to multiprocessor scheduling. SIAM J. Comput. 7(1), 1–17 (1978)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Emmons, H., Vairaktarakis, G.: Flow Shop Scheduling. Springer, Boston (2013).  https://doi.org/10.1007/978-1-4614-5152-5CrossRefGoogle Scholar
  5. 5.
    Fisher, M.L.: The lagrangian relaxation method for solving integer programming problems. Manag. Sci. 50, 1861–1871 (2004)CrossRefGoogle Scholar
  6. 6.
    Fung, J., Singh, G., Zinder, Y.: Capacity planning in supply chains of mineral resources. Inf. Sci. 316, 397–418 (2015)CrossRefGoogle Scholar
  7. 7.
    Fung, J., Zinder, Y.: Permutation schedules for a two-machine flow shop with storage. Oper. Res. Lett. 44(2), 153–157 (2016)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Gu, H., Kononov, A., Memar, J., Zinder, Y.: Efficient lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements. J. Discrete Algorithms 52–53, 143–155 (2018)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Gu, H., Memar, J., Zinder, Y.: Scheduling batch processing in flexible flowshop with job dependent buffer requirements: lagrangian relaxation approach. In: Rahman, M.S., Sung, W.-K., Uehara, R. (eds.) WALCOM 2018. LNCS, vol. 10755, pp. 119–131. Springer, Cham (2018).  https://doi.org/10.1007/978-3-319-75172-6_11CrossRefGoogle Scholar
  10. 10.
    Irohara, T.: Lagrangian relaxation algorithms for hybrid flow-shop scheduling problems with limited buffers. Int. J. Biomed. Soft Comput. Hum. Sci. 15(1), 21–28 (2010)Google Scholar
  11. 11.
    Johnson, S.M.: Optimal two-and three-stage production schedules with setup times included. Nav. Res. Logist. Q. 1(1), 61–68 (1954)CrossRefGoogle Scholar
  12. 12.
    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)MathSciNetCrossRefGoogle Scholar
  13. 13.
    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)MathSciNetCrossRefGoogle Scholar
  14. 14.
    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)CrossRefGoogle Scholar
  15. 15.
    Lin, F.C., Hong, J.S., Lin, B.M.: Sequence optimization for media objects with due date constraints in multimedia presentations from digital libraries. Inf. Syst. 38(1), 82–96 (2013)CrossRefGoogle Scholar
  16. 16.
    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)CrossRefGoogle Scholar
  17. 17.
    Pinedo, M.L.: Scheduling: Theory, Algorithms, and Systems. Springer, New York (2012).  https://doi.org/10.1007/978-1-4614-2361-4CrossRefzbMATHGoogle Scholar
  18. 18.
    Tang, L.X., Xuan, H.: Lagrangian relaxation algorithms for real-time hybrid flowshop scheduling with finite intermediate buffers. J. Oper. Res. Soc. 57(3), 316–324 (2006)CrossRefGoogle Scholar
  19. 19.
    van de Velde, S.L.: Machine scheduling and lagrangian relaxation (1991)Google Scholar
  20. 20.
    Witt, A., Voß, S.: Simple heuristics for scheduling with limited intermediate storage. Comput. Oper. Res. 34(8), 2293–2309 (2007)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Sobolev Institute of MathematicsSiberian Branch of the Russian Academy of SciencesNovosibirskRussia
  2. 2.University of Technology SydneyBroadwayAustralia

Personalised recommendations