Skip to main content
SpringerLink
Log in

A Branch-and-Bound Method to Minimize the Total Flow Time in a Permutation Flow Shop with Blocking and Setup Times

  • Conference paper
  • First Online:
Production Research (ICPR-Americas 2020)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1407))

Included in the following conference series:

Abstract

This paper presents an improvement of the branch-and-bound algorithm for the blocking-in-process and setup times permutation flow shop problem with total flow time criterion, which is known to be NP-Hard for m ≥ 2. For that, a new machine-based lower bound which exploits the machine idleness and the occurrence of blocking is proposed. Computational experiments were performed using a database that contains 27 classes of problems, varying the number of jobs (n) and the number of machines (m). Results show that the algorithm can handle most of the n < 20 problems in less than one hour. Therefore, this work can support the scheduling of many applications in manufacturing systems with limited buffers and setup times.

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

References

  1. Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1(2), 117–129 (1976)

    Article  MathSciNet  Google Scholar 

  2. Nawaz, M., Enscore, E.E., Ham, I.: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11(1), 91–95 (1983)

    Article  Google Scholar 

  3. Mccormick, S., Pinedo, M.J. Shenker, S., Wolf, B.: Sequencing in an assembly line with blocking to minimize cycle time. Oper. Res. 37(6), 925–935 (1989)

    Google Scholar 

  4. Pan, Q.K., Wang, L.: Effective heuristics for the blocking flowshop scheduling problem with makespan minimization. Omega 40(2), 218–229 (2012)

    Article  Google Scholar 

  5. Ronconi, D.P.: A note on constructive heuristics for the flowshop problem with blocking. Int. J. Prod. Econ. 87(1), 39–48 (2004)

    Article  Google Scholar 

  6. Hall, N.G., Sriskandarajah, C.: A survey of machine scheduling problems with blocking and no-wait in process. Oper. Res. 44(3), 510–525 (1996)

    Article  MathSciNet  Google Scholar 

  7. Sethi, S.P., Sriskandarajah, C., Sorger, G., Blazewicz, J., Kubiak, W.: Sequencing of parts and robot moves in a robotic cell. Int. J. Flex. Manufact. Syst. 4(3), 331–358 (1992)

    Article  Google Scholar 

  8. Reddi, S., Ramamoorthy, C.: On the flow-shop sequencing problem with no wait in process. J. Oper. Res. Soc. 23(3), 323–331 (1972)

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  10. 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 

  11. Bansal, S.P.: Minimizing the sum of completion times of n jobs over m machines in a flowshop: a branch and bound approach. A I I E Trans. 9(3), 306–311 (1977). https://doi.org/10.1080/05695557708975160

    Article  Google Scholar 

  12. Ahmadi, R.H., Bagchi, U.: Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop. Eur. J. Oper. Res. 44(3), 331–336 (1990). https://doi.org/10.1016/0377-2217(90)90244-6

    Article  MathSciNet  MATH  Google Scholar 

  13. Chung, C.S., Flynn, J., Kirca, O.: A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems. Int. J. Prod. Econ. 79(3), 185–196 (2002). https://doi.org/10.1016/S0925-5273(02)00234-7

    Article  MATH  Google Scholar 

  14. Ronconi, D.P., Armentano, V.A.: Lower bounding schemes for flowshops with blocking in-process. J. Oper. Res. Soc. 52(11), 1289–1297 (2001). https://doi.org/10.1057/palgrave.jors.2601220

    Article  MATH  Google Scholar 

  15. 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). https://doi.org/10.1007/s10479-005-2444-3

    Article  MathSciNet  MATH  Google Scholar 

  16. Moslehi, G., Khorasanian, D.: Optimizing blocking flow shop scheduling problem with total completion time criterion. Comput. Oper. Res. 40(7), 1874–1883 (2013). https://doi.org/10.1016/j.cor.2013.02.003

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  18. 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 Scientiarum Technol. 38(3), 321 (2016)

    Article  Google Scholar 

  19. Rios-Mercado, R.Z., Bard, J.F.: A branch-and-bound algorithm for flowshop scheduling with setup times. IIE Trans. Sched. Logist. 31(8), 721–731 (1999)

    Google Scholar 

  20. Takano, M.I., Nagano, M.S.: A branch-and-bound method to minimize the makespan in a permutation flow shop with blocking and setup times. Cogent Eng. 4(1) (2017). https://doi.org/10.1080/23311916.2017.1389638

  21. Pinedo, M.L.: Scheduling: Theory, Algorithms, and Systems, 3rd edn. Springer Publishing Company, New York (2008)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Engineering of São Carlos, University of São Paulo, Av. Trabalhador São-Carlense, 400, São Carlos, SP, Brazil

    João Vítor Silva Robazzi & Marcelo Seido Nagano

  2. Federal Institute of Education, Science and Technology of São Paulo, R. Américo Ambrósio 269, Sertãozinho, SP, Brazil

    João Vítor Silva Robazzi

  3. Federal University of Technology – Paraná, Avenida Alberto Carazzai, 1640, Cornélio Procópio, PR, Brazil

    Mauricio Iwama Takano

Authors
  1. João Vítor Silva Robazzi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marcelo Seido Nagano
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mauricio Iwama Takano
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mauricio Iwama Takano .

Editor information

Editors and Affiliations

  1. Universidad Nacional del Sur and CONICET, Bahía Blanca, Argentina

    Daniel Alejandro Rossit

  2. Universidad Nacional del Sur and CONICET, Bahía Blanca, Argentina

    Fernando Tohmé

  3. Universidad de la Sabana, Chía, Colombia

    Gonzalo Mejía Delgadillo

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Robazzi, J.V.S., Nagano, M.S., Takano, M.I. (2021). A Branch-and-Bound Method to Minimize the Total Flow Time in a Permutation Flow Shop with Blocking and Setup Times. In: Rossit, D.A., Tohmé, F., Mejía Delgadillo, G. (eds) Production Research. ICPR-Americas 2020. Communications in Computer and Information Science, vol 1407. Springer, Cham. https://doi.org/10.1007/978-3-030-76307-7_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-76307-7_17

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-76306-0

  • Online ISBN: 978-3-030-76307-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation