Skip to main content

Placement heuristics for generation of FMS layouts

  • Applications
  • Conference paper
  • First Online:
System Modelling and Optimization

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 143))

Abstract

The generation of an FMS layout consists in finding a placement of FMS modules, e.g. manufacturing cells, storage equipment, and transportation utilities, on a structured plane with respect to given criteria. In this paper are presented algorithms for the minimization of the weighted total transportation way length. In the discrete case this placement problem is adequate to the Quadratic Assignment Problem (QAP), if the different sizes of the modules are not considered.

We present a special constructive algorithm for the placement of different sized modules. Furthermore, a new iterative algorithm which is based on Simulated Annealing is described. It is implemented as a two criterial optimization problem. Under certain assumptions the convergence to the global optimum can be proved.

The implemented algorithms are parts of a layout program system. In connection with valuation procedures for checking permissibility criteria, and with a graphical layout editor for interactive modifications FMS layouts of high quality can be generated /Sch89/.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature

  1. B. Hajek; Cooling Schedules for Optimal Annealing. Research Report; Jan. 1985, University of Illinois at Champaign-Urbana.

    Google Scholar 

  2. M. Hanan, J.M. Kurtzberg; Placement Techniques; In M. Breuer, Ed.; Design Automation of Digital Systems; Prentice Hall, Inc., Englewood Cliffs, N.J., 1972.

    Google Scholar 

  3. S. Kirkpatrick, C. Gelatt, Jr. M. P. Vecchi; Optimization by Simulated Annealing; Research Report, RC 9355, 4/2/1982 Computer Science/Engen. Techn.

    Google Scholar 

  4. R. S. Liggett; Optimal Spatial Arrangement as a Quadratic Assignment Problem; in: Design Optimization; J. S. Gero, Ed.; Notes and Reports in Mathematics and Engineering; Academic Press, Inc., Orlando, Florida, 1985.

    Google Scholar 

  5. Ch. H. Papadimitriou, K. Steiglitz; Combinatorial Optimization Algorithms and Complexity; Prentice Hall, Inc., New Jersey, 1982.

    Google Scholar 

  6. Ch. Schiemangk; Simulierte Abkuehlung und deren Anwendung auf Graphenoptimierungsprobleme; Dissertation 8; Berlin, 1988.

    Google Scholar 

  7. Ch. Schiemangk, J. Hofmann, D. Knauss, St. Koenner, U. Mende, P. Richter; LAYFMS — Layout Design System for Flexible Manufacturing Systems; in: Workshop on Informatics in Industrial Automation; Berlin (GDR), Oktober 31–November 4, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

H. -J. Sebastian K. Tammer

Rights and permissions

Reprints and permissions

Copyright information

© 1990 International Federation for Information Processing

About this paper

Cite this paper

Hofmann, J., Schiemangk, C. (1990). Placement heuristics for generation of FMS layouts. In: Sebastian, H.J., Tammer, K. (eds) System Modelling and Optimization. Lecture Notes in Control and Information Sciences, vol 143. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0008435

Download citation

  • DOI: https://doi.org/10.1007/BFb0008435

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52659-9

  • Online ISBN: 978-3-540-47095-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics