Skip to main content

Layout on Several Rows

  • Chapter
  • First Online:
Facility Layout

Part of the book series: EURO Advanced Tutorials on Operational Research ((EUROATOR))

  • 519 Accesses

Abstract

In this chapter we consider the problem of optimally placing a set of departments on two or more rows, given the lengths of the departments, the number of rows, and a pairwise non-negative connectivity for each pair of departments. We refer to such problems as row layout problems, and we divide this class of problems into two types, namely double-row facility layout and multi-row facility layout, where the latter involves three or more rows. It is worth treating double-row facility layout separately because it is amenable to specialized models that are typically more efficient than those for multi-row layout.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 99.99
Price excludes VAT (USA)
  • Durable hardcover 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

  • Ahonen H, de Alvarenga A, Amaral A (2014) Simulated annealing and tabu search approaches for the corridor allocation problem. Eur J Oper Res 232(1):221–233

    Article  Google Scholar 

  • Amaral ARS (2012) The corridor allocation problem. Comput Oper Res 39(12):3325–3330

    Article  Google Scholar 

  • Amaral ARS (2013) Optimal solutions for the double row layout problem. Optimization Letters 7(2):407–413

    Article  Google Scholar 

  • Anjos MF, Vieira MVC (2021) Mathematical optimization approach for facility layout on several rows. Optimization Letters 15:9–23

    Article  Google Scholar 

  • Anjos MF, Fischer A, Hungerländer P (2018) Improved exact approaches for row layout problems with departments of equal length. Eur J Oper Res 270(2):514–529

    Article  Google Scholar 

  • Chung J, Tanchoco JMA (2010) The double row layout problem. Int J Prod Res 48(3):709–727

    Article  Google Scholar 

  • Fischer A, Fischer F, Hungerländer P (2019) New exact approaches to row layout problems. Math Programm Comput 11:703–754

    Article  Google Scholar 

  • Heragu SS (2008) Facilities design. CRC Press

    Book  Google Scholar 

  • Heragu SS, Kusiak A (1988) Machine layout problem in flexible manufacturing systems. Operations Research 36(2):258–268

    Article  Google Scholar 

  • Hungerländer P, Anjos MF (2015) A semidefinite optimization-based approach for global optimization of multi-row facility layout. Eur J Oper Res 245(1):46–61

    Article  Google Scholar 

  • Nemhauser GL, Wolsey LA (1988) Integer and combinatorial optimization. Wiley-Interscience, New York, NY, USA

    Book  Google Scholar 

  • Secchin LD, Amaral ARS (2019) An improved mixed-integer programming model for the double row layout of facilities. Optimization Letters 13(1):193–199

    Article  Google Scholar 

  • Zhang Z, Murray CC (2012) A corrected formulation for the double row layout problem. Int J Prod Res 50(15):4220–4223

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Anjos, M.F., Vieira, M.V.C. (2021). Layout on Several Rows. In: Facility Layout. EURO Advanced Tutorials on Operational Research. Springer, Cham. https://doi.org/10.1007/978-3-030-70990-7_3

Download citation

Publish with us

Policies and ethics