Hostname: page-component-cd9895bd7-dzt6s Total loading time: 0 Render date: 2024-12-25T08:37:41.701Z Has data issue: false hasContentIssue false
  • English
  • Français

Grouping problem in scheduling flexible manufacturing systems

Published online by Cambridge University Press:  09 March 2009

Andrew Kusiak ,
Anthony Vannelli†  and
K. Ravi Kumar‡
Andrew Kusiak
Affiliation:
Department of Industrial Engineering, Technical University of Nova Scotia, P.O. Box 1000 Halifax, Nova Scotia, B3J 2X4 (Canada)
Anthony Vannelli†
Affiliation:
Department of Mechanical and Industrial Enginering, University of Manitoba, Winnipeg, Manitoba, R3T 2N2 (Canada)
K. Ravi Kumar‡
Affiliation:
Department of Business Administration, University of Illinois, at Champaign-Urbana Champaign, Illinois 61820 (U.S.A.)
Get access Rights & Permissions [Opens in a new window]

Abstract

SUMMARY

In this paper the problem of grouping parts and fixtures in Flexible Manufacturing Systems (FMSs) is discussed. A network formulation of the grouping problem is presented. Based on this formulation an efficient heuristic algorithm is developed. The importance of grouping of parts and fixtures in FMSs as well as some of the computational results are discussed.

Type
Articles
Information
Robotica , Volume 3 , Issue 4 , October 1985 , pp. 245 - 252
Copyright
Copyright © Cambridge University Press 1985

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Kusiak, A., “Flexible manufacturing systems: A structural approach” Intern. J. Production Research (to appear in 1985).Google Scholar
2.Hitz, K.L., “Scheduling of flexible flow shops” Report #LIDS-R-879, MIT, Laboratory for Information and Decision Systems, Cambridge, MA, U.S.A. (1979).Google Scholar
3.Changs, Y.L. and Sullivan, R.S., “Real-time scheduling of flexible manufacturing systems: A conceptual mathematical formulation” Presented at TIMS/ORSA Meeting, San Francisco, U.S.A. (1984).Google Scholar
4.Erschler, J., Roubellat, F. and Thuriot, C., “Periodic Release Strategies for FMS,” Presented at TIMS/ORSA Meeting, San Francisco, U.S.A. (1984).CrossRefGoogle Scholar
5.Lin, L.E.S. and Lu, C.Y.J., “The scheduling problem in random flexible manufacturing system” Proceedings of the First ORSA/TIMS Special Interest Conference, Ann Arbor, MI, U.S.A., 278 (1984).Google Scholar
6.Barnes, E.R., “An algorithm for partitioning the nodes of a graph” SIAM J. of Algebraic and Discrete Methods 3, 541 (1982).CrossRefGoogle Scholar
7.Vannelli, A. and Vidyasagar, M., “Three approximate solution techniques for the optimal k−decomposition problem” International Conference on Systems, Man and Cybernetics, Bombay, India (1984).Google Scholar
8.Vannelli, A., “Approximating a class of graph decomposition problems by linear transportation problems”, presented at TIMS/ORSA Meeting, San Francisco, 05 (1984); IBM Research Report RC 10584 (#47380), 06 (1984); to appear Journal of Classification (1985).Google Scholar
9.King, J.R., “Machine-component group formation in group technology” Fifth International Conference on Production Research (1979); id.,“Machine-component grouping in production flow analysis: an approach using a rank order clustering algorithm” Intern. J. Production Research 18, 213 (1980).CrossRefGoogle Scholar
10.McCormick, W.T., Schweitzer, P.J. and White, T.E., “Problem decomposition and data recognition by a clustering technique” Operations Research 20, 993 (1972).CrossRefGoogle Scholar
11.King, J.R. and Nakornchai, V., “Machine-component group formation in group technology: review and extension” Intern. J. Production Research 20, 117 (1982).CrossRefGoogle Scholar
12.Lawler, E.L., Combinatorial Optimization: Networks and Matroids (Holt, Rinehart and Winston, New York, 1976).Google Scholar
13.Kernighan, B.W. and Lin, S., “An efficient heuristic procedure for partitioning graphs” Bell Systems Technical J. 49, 291–307 (1970).Google Scholar
14.Kumar, K.R., Kusiak, A. and Vannelli, A., “Grouping of parts and components in flexible manufacturing systems,” European J. Oper. Res. (to appear in 1985)Google Scholar
15.Cullum, J. and Willoughby, R., Lancos Algorithms for Large Symmetric Matrices vol. 1 (Birkhausen, Boston, 1985).Google Scholar