Skip to main content
Springer Nature Link
Log in

A Branch and Bound Algorithm for the Two-Machine Blocking Flowshop Group Scheduling Problem

  • Conference paper
  • First Online:
Advanced Intelligent Computing Technology and Applications (ICIC 2023)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14086))

Included in the following conference series:

  • 1577 Accesses

Abstract

This paper presents an efficient branch and bound (B&B) algorithm for the two-machine blocking flowshop group scheduling problem(BFGSP), in which the objective is to minimize the makespan. An initial solution generated by using the LPT-NEH heuristics method and we set this solution as the initial upper bound. Then a machine-based lower bound and a dominance rule are used to prune the branch-and-bound tree. The search strategy is based on the breadth-first principle. The experiment shows that the algorithm can solve medium and small-scale BFGSP in 3600 s.

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

References

  1. Neufeld, J.S., Gupta, J.N.D., Buscher, U.: A comprehensive review of flowshop group scheduling literature. Comput. Oper. Res. 70, 56–74 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  2. Pan, Q.K., Gao, L., Wang, L.: An effective cooperative co-evolutionary algorithm for distributed flowshop group scheduling problems. IEEE Trans. Cybern. 52, 5999–6012 (2022)

    Article  Google Scholar 

  3. Celano, G., Costa, A., Fichera, S.: Constrained scheduling of the inspection activities on semiconductor wafers grouped in families with sequence-dependent set-up times. Int. J. Adv. Manuf. Technol. 46(5–8), 695–705 (2010)

    Article  Google Scholar 

  4. Salmasi, N., Logendran, R., Skandari, M.R.: Total flow time minimization in a flowshop sequence-dependent group scheduling problem. Comput. Oper. Res. 37(1), 199–212 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  5. Gelogullari, C.A.: Group-scheduling problems in electronics manufacturing. Oregon State University (2005)

    Google Scholar 

  6. Yoshida, T., Hitomi, K.: Optimal two-stage production scheduling with setup times separated. AIIE Trans. 11(3), 261–263 (1979)

    Article  Google Scholar 

  7. Baker, K.: Scheduling groups of jobs in the two-machine flow shop. Math. Comput. Model. 13(3), 29–36 (1990)

    Article  MathSciNet  Google Scholar 

  8. Logendran, R., Gelogullari, C., Sriskandarajah, C.: Minimizing the mean flow time in a two-machine group-scheduling problem with carryover sequence dependency. Robot. Comput. Integr. Manuf. 19(1–2), 21–33 (2003)

    Article  Google Scholar 

  9. Wang, X., Cheng, T.: A heuristic approach for tow-machine no-wait flowshop scheduling with due dates and class setups. Comput. Oper. Res. 33(5), 1326–1344 (2006)

    Article  MATH  Google Scholar 

  10. Liou, C.-D., Liu, C.-H.: A novel encoding scheme of PSO for two-machine group scheduling. In: Tan, Y., Shi, Y., Tan, K.C. (eds.) ICSI 2010. LNCS, vol. 6145, pp. 128–134. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-13495-1_16

    Chapter  Google Scholar 

  11. Yuan, S., Li, T., Wang, B.: A co-evolutionary genetic algorithm for the two-machine flow shop group scheduling problem with job-related blocking and transportation times. Expert Syst. Appl. 152, 113360 (2020)

    Article  Google Scholar 

  12. Ignall, E., Schrage, L.: Application of the branch and bound technique to some flow-shop scheduling problems. Oper. Res. 13(3), 400–412 (1965)

    Article  MathSciNet  Google Scholar 

  13. Lomnicki, Z.A.: A “branch-and-bound” algorithm for the exact solution of the three-machine scheduling problem. J. Oper. Res. Soc. 16(1), 89–100 (1965)

    Article  Google Scholar 

  14. Reddi, S.S., Ramamoorthy, C.V.: On the flowshop sequencing problem with no-wait in process. Oper. Res. Q. 23(3), 323–331 (1972)

    Article  MATH  Google Scholar 

  15. Gilmore, P., Gomory, R.: Sequencing a one state variable machine: a solvable case of the traveling salesman problem. Oper. Res. 12(5), 655–679 (1964)

    Article  MathSciNet  MATH  Google Scholar 

  16. Potts, C.N.: An adaptive branching rule for the permutation flow-shop problem. Eur. J. Oper. Res. 5(1), 19–25 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  17. Ronconi, D.P.: A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking. Ann. Oper. Res. 138(1), 53–65 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  18. Moslehi, G., Khorasanian, D.: Optimizing blocking flow shop scheduling problem with total completion time criterion. Comput. Oper. Res. 40(7), 1874–1883 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  19. Sanches, F.B., Takano, M.I., Nagano, M.S.: Evaluation of heuristics for a branch and bound algorithm to minimize the makespan in a flowshop with blocking. Acta Sci. Technol. 38(3), 321–326 (2016)

    Article  Google Scholar 

Download references

Acknowledgment

This research was supported by the National Natural Science Foundation of China (62173169 and 61963022) and the Basic Research Key Project of Yunnan Province (202201AS070030).

Author information

Authors and Affiliations

  1. Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming, 650500, China

    Sen Zhang, Bin Qian, Rong Hu, Changsheng Zhang & Kun Li

Authors
  1. Sen Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bin Qian
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rong Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Changsheng Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Kun Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bin Qian .

Editor information

Editors and Affiliations

  1. Eastern Institute of Technology, Zhejiang, China

    De-Shuang Huang

  2. University of Wollongong, North Wollongong, NSW, Australia

    Prashan Premaratne

  3. Zhengzhou University of Light Industry, Zhengzhou, China

    Baohua Jin

  4. Zhong Yuan University of Technology, Zhengzhou, China

    Boyang Qu

  5. University of Ulsan, Ulsan, Korea (Republic of)

    Kang-Hyun Jo

  6. Department of Computer Science, Liverpool John Moores University, Liverpool, UK

    Abir Hussain

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhang, S., Qian, B., Hu, R., Zhang, C., Li, K. (2023). A Branch and Bound Algorithm for the Two-Machine Blocking Flowshop Group Scheduling Problem. In: Huang, DS., Premaratne, P., Jin, B., Qu, B., Jo, KH., Hussain, A. (eds) Advanced Intelligent Computing Technology and Applications. ICIC 2023. Lecture Notes in Computer Science, vol 14086. Springer, Singapore. https://doi.org/10.1007/978-981-99-4755-3_28

Download citation

  • DOI: https://doi.org/10.1007/978-981-99-4755-3_28

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-99-4754-6

  • Online ISBN: 978-981-99-4755-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics