Skip to main content

Machine Location Problems in Flexible Manufacturing Systems

  • Chapter
Advanced Manufacturing Systems and Technology

Part of the book series: International Centre for Mechanical Sciences ((CISM,volume 372))

Abstract

In this paper we deal with an algorithm for the facility placement problem relevant to one of the most commonly used layout schemes in flexible manufacturing systems: the single-row layout problem. The objective function that we want to minimize is the backtracking. As a result we obtain a heuristic easy to implement which generates good quality solutions in acceptable response times. It turns out that, in particular cases, it outperforms an alternative algorithm recently developed to the same end.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Heragu, S.S., and Kusiak, A.: Machine layout problem in flexible manufacturing systems, Operations Research, 36 (1988), 258 - 268.

    Article  Google Scholar 

  2. Sarker, B.R., Wilhelm, W.E., and Hogg, G.L.: Backtracking and its amoebic properties in one-dimensional machine location problems, Journal of the Operational Research Society, 45 (1994), 1024 - 1039.

    MATH  Google Scholar 

  3. Hassan, M.M.D.: Machine layout problem in modern manufacturing facilities, International Journal of Production Research, 32 (1994), 2559 - 2584.

    Article  MATH  Google Scholar 

  4. Hollier, R.H.: The layout of multi-product lines, International Journal of Production Research, 2 (1963), 47 - 57.

    Article  Google Scholar 

  5. Groover, M.P.: Automation, Production Systems, and Computer Integrated Manufacturing, Prentice-Hall International Inc.,1987.

    Google Scholar 

  6. Sarker, B.R., Han, M., Hogg, G.L., and Wilhelm, W.E.: Backtracking of jobs and machine location problems, in Progress in Material Handling and Logistics, edited by White, J.A., and Pence, I.W., Springer-Verlag, Berlin, 1991.

    Google Scholar 

  7. Kouvelis, P., and Chiang, W.: Optimal and heuristic procedures from row layout problems in automated manufacturing systems, Working paper, The Fuqua School of Business, Duke University, 1992.

    Google Scholar 

  8. Kouvelis, P., and Chiang, W.: A simulated annealing procedure for single row layout problems in flexible manufacturing systems, International Journal of Production Research, 30 (1992), 717 - 732.

    Article  MATH  Google Scholar 

  9. Lin, S.: Heuristic programming as an aid to network design, Networks, 5 (1975), 33 - 43.

    Google Scholar 

  10. Afentakis, P., Millen, R.A., and Solomon, M.M.: Dynamic layout strategies for flexible manufacturing systems, International Journal of Production Research, 28 (1990), 311 - 323.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Wien

About this chapter

Cite this chapter

Braglia, M. (1996). Machine Location Problems in Flexible Manufacturing Systems. In: Kuljanic, E. (eds) Advanced Manufacturing Systems and Technology. International Centre for Mechanical Sciences, vol 372. Springer, Vienna. https://doi.org/10.1007/978-3-7091-2678-3_51

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-2678-3_51

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-82808-3

  • Online ISBN: 978-3-7091-2678-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics