[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Log in

Metaheuristics for a Flexible Assembly System Design Problem

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

Flexibility has become an important priority in the formulation and implementation of manufacturing strategies. This in turn has opened up a new class of design problems for such systems. Flexible assembly systems (FAS), consisting of a variety of processors and operations, provide the opportunity for improving product manufacturing flexibility, hence gaining competitive advantages. This paper considers a particular design decision problem for FAS. A matrix-based, polynomial-time lower bound algorithm is presented. Simulated annealing and tabu search metaheuristics are formulated to address the problems. Computational experience with these metaheuristics is reported.

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

Access this article

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Akella, R., and B. Krough. (1987). “Hierarchial Control Structures for Multi-Cell Flexible Assembly System Coordination.” Proceedings of the IEEE International Conference on Robotics and Automation, pp. 295–299.

  • Coppersmith, D., and S.Winograd. (1981). “On the Asymptotic Complexity of Matrix Multiplication.” 22nd IEEE Symposium on Foundation of Computer Science, pp. 82–100.

  • Eglese, R.W. (1990). “Simulated Annealing: A Tool for Operational Research}.” European Journal of Operational Research 46, 271–281.

    Article  MathSciNet  MATH  Google Scholar 

  • Escudero, L.F. (1988). “An Inexact Algorithm for the Sequential Ordering Problem.” European Journal of Operational Research 37, 236–249.

    Article  MathSciNet  MATH  Google Scholar 

  • Escudero, L.F., M. Guignand, and K. Malik. (1994). “A Lagrangian Relax-and Cut Approach for the Sequential Ordering Problem with Precedence Relationships.” Annals of Operations Research 50, 219–237.

    Article  MathSciNet  MATH  Google Scholar 

  • Fleischer, M. (1995). “Simulated Annealing: Past, Present, and Future.” Proceedings of the 1995Winter Simulation Conference, pp. 155–161.

  • Glover, F. (1989). “Tabu Search-Part I.” ORSA Journal on Computing 1(3), 190–206.

    MATH  Google Scholar 

  • Glover, F. (1990a). “Tabu Search-Part II.” ORSA Journal on Computing 2(1), 4–32.

    MATH  Google Scholar 

  • Glover, F. (1990b). “Tabu Search: A Tutorial.” Interfaces 20(4), 74–94.

    Article  Google Scholar 

  • Glover, F. (1995). “Tabu Search Fundamentals and Uses.” Technical Report, University of Colorado, Boulder, Colorado.

    Google Scholar 

  • Kim D., V. Mabert, and P. Pinto. (1993). “Integrative Cycle Scheduling Approach for a Capacitated Flexible Assembly System.” Decision Sciences 24(1), 126–147.

    Article  Google Scholar 

  • Kumar, A., and S.H. Jacobson. (1996). “Analyzing the Design Problem in Flexible Assembly System.” Technical Report, Department of ISE, Virginia Tech, Blacksburg, Virginia.

    Google Scholar 

  • Lee, H.F., and K.E. Stecke. (1996). “An Integrated Design Support Method for Flexible Assembly Systems.” Journal of Manufacturing Systems 15(1), 13–32.

    Article  Google Scholar 

  • Mabert, V.A., and P. Pinto. (1986). “Production Batch Sizes in a Repetitive Flexible Assembly System.” WPS 86–28, The Ohio State University, Columbus, Ohio.

    Google Scholar 

  • Mitra, D., F. Romeo, and A.L. Sangiovanni-Vincentelli. (1986). “Convergence of Finite-time Behavior of Simulated Annealing.” Advances in Applied Probability 18, 747–771.

    Article  MathSciNet  MATH  Google Scholar 

  • Owen, T. (1984). Flexible Assembly Systems. New York: Plenum Press.

    Google Scholar 

  • Spur, G., I. Furgac, A. Deutchlander, J. Browne, and P. O'Gorman. (1985). “Robot Planning System.” Robotics and Computer Integrated Manufacturing 2, 115–123.

    Article  Google Scholar 

  • Spur, G., I. Furgac, and U. Kirchhoff. (1987). “Robot System Integration into Computer Integrated Manufacturing.” Robotics and Computer Integrated Manufacturing 3(1), 1–10.

    Article  Google Scholar 

  • Suri, R., and G. Diehl. (1985). “Manuplan-A Precursor to Simulation for Complex Manufacturing Systems.” Proceedings of the 1985 Winter Simulation Conference, pp. 411–420.

  • Tavora, C. (1989). “Flexible Systems: A Configuration Control Challenge.” Manufacturing Systems 7(11), 34–40.

    Google Scholar 

  • Werra, D. de, and A. Hertz. (1989). “Tabu Search Techniques: A Tutorial and an Application to Neural Networks.” OR Spektrum 11, 131–141.

    Article  MathSciNet  MATH  Google Scholar 

  • Yano, C., and R. Rachamadagu. (1991). “Sequencing to MinimizeWork Overload in Assembly Lines with Product Options.” Management Science 37(5), 572–586.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jacobson, S.H., Johnson, A.W., Sullivan, K.A. et al. Metaheuristics for a Flexible Assembly System Design Problem. Journal of Heuristics 3, 139–159 (1997). https://doi.org/10.1023/A:1009679413948

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009679413948

Navigation