Skip to main content
SpringerLink
Log in

A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

This work addresses the minimization of the makespan criterion for the flowshop problem with blocking. In this environment there are no buffers between successive machines, and therefore intermediate queues of jobs waiting in the system for their next operations are not allowed. We propose a lower bound which exploits the occurrence of blocking. A branch-and-bound algorithm that uses this lower bound is described and its efficiency is evaluated on several problems. Results of computational experiments are reported.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Abadi, I.N.K., N.G. Hall, and C. Sriskandarajah. (2000). “Minimizing Cycle Time in a Blocking Flowshop.” Operations Research 48, 177–180.

    Article  Google Scholar 

  • Caraffa, V., S. Ianes, T.P. Bagchi, and C. Sriskandarajah. (2001). “Minimizing Makespan in a Flowshop Using Genetic Algorithms.” International Journal of Production Economics 70, 101–115.

    Article  Google Scholar 

  • Berkley, B.J. (1993). “Effect of buffer capacity and sequencing rules on single-card kanban system performance.” International Journal of Production Research 31, 2875–2893.

    Google Scholar 

  • Dutta, S.K. and A.A. Cunningham. (1975). “Sequencing Two-Machine Flow-Shops with Finite Intermediate Storage.” Management Science 21, 989–996.

    Google Scholar 

  • Gilmore, P.C. and R.E. Gomory. (1964). “Sequencing a One State Variable Machine: A Solvable Case of the Traveling Salesman Problem.” Operations Research 12, 655–665.

    Google Scholar 

  • Grabowski, J. and J. Pempera. (2000). “Sequencing of Jobs in Some Production System.” European Journal of Operational Research125, 535–550.

    Article  Google Scholar 

  • Hall N.G. and C. Sriskandarajah. (1996). “A Survey of Machine Scheduling Problems with Blocking and No-wait in Process.” Operations Research 44, 510–525.

    Google Scholar 

  • Leisten, R. (1990). “Flowshop Sequencing Problems with Limited Buffer Storage”. International Journal of Prodution Research28, 2085–2100.

    Google Scholar 

  • Levner, E.M. (1969). “Optimal Planning of Parts Machining on a Number of Machines.” Automation and Remote Control 12, 1972–1978.

    Google Scholar 

  • McCormick, S.T., M.L. Pinedo, S. Shenker, and B. Wolf. (1989). “Sequencing in an Assembly Line with Blocking to Minimize Cycle Time.” Operations Research 37, 925–936.

    Google Scholar 

  • Nawaz, M., E.E. Enscore, and I. Ham. (1983). “A Heuristic Algorithm for the m-Machine, n-Job Flow-shop Sequencing Problem.” OMEGA 11, 91–95.

    Article  Google Scholar 

  • Norman, B.A. (1999). “Scheduling Flowshops with Finite Buffers and Sequence-dependent Setup Times.” Computers & Industrial Engineering 36, 163–177.

    Article  Google Scholar 

  • Nowicki, E. (1999). “The Permutation Flow Shop with Buffers: A Tabu Search Approach.” European Journal of Operational Research 116, 205–219.

    Article  Google Scholar 

  • Papadimitriou, C.H. and P.C. Kanellakis. (1980). “Flowshop Scheduling with Limited Temporary Storage.” Journal of the Association for Computing Machinery 27, 533–549.

    Google Scholar 

  • Pinedo, M. (1995). Scheduling: Theory, Algorithms, and Systems. New Jersey: Prentice-Hall.

    Google Scholar 

  • Reddi, S.S. (1976). Management Science 23, 216–217.

    Google Scholar 

  • Reddi, S.S. and C.V. Ramamoorthy. (1972). “Flowshop Sequencing Problem with No Wait in Process.” Operational Research Quarterly 23, 323–330.

    Article  Google Scholar 

  • Reklaitis, G.V. (1982). “Review of Scheduling of Process Operations.” AIChE Symposium Series 78, 119–133.

  • Ronconi, D.P. (2004). “A Note on Constructive Heuristics for the Flowshop Problen with Blocking.” International Journal of Production Economics 87, 39–48.

    Article  Google Scholar 

  • Ronconi, D.P. and V.A. Armentano. (2001). “Lower Bounding Schemes for Flowshops with Blocking In-Process.” Journal of the Operational Research Society 52, 1289–1297.

    Google Scholar 

  • Sharadapriyadarshini, B. and C. Rajendran. (1996). “Formulations and Heuristics for Scheduling in Buffer-constrained Flowshop and Flowline-based Manufacturing Cell with Different Buffer-space Requirements for Jobs: Part 1.” International Journal of Production Research 34, 3465–3485.

    Google Scholar 

  • Suhami, I. and R.S.H. Mah. (1981). “An Implicit Enumeration Scheme for the Flowshop Problem with No Intermediate Storage.” Computers and Chemical Engineering 5, 83–91.

    Article  Google Scholar 

  • Taillard, E. (1993). “Benchmarks for Basic Scheduling Problems.” European Journal of Operational Research 64, 278–285.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Engenharia de Produção, Escola Politécnica, Universidade de São Paulo, Av. Prof. Almeida Prado 128, Cidade Universitária, 05508-900, São, Paulo-SP, Brazil

    Débora P. Ronconi

Authors
  1. Débora P. Ronconi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Débora P. Ronconi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ronconi, D.P. A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking. Ann Oper Res 138, 53–65 (2005). https://doi.org/10.1007/s10479-005-2444-3

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-005-2444-3

Keywords

Search

Navigation