Hostname: page-component-74656f9884-npj9w Total loading time: 0 Render date: 2026-11-10T02:08:24.786Z Has data issue: false hasContentIssue false

Grouping problem in scheduling flexible manufacturing systems

Published online by Cambridge University Press:  09 March 2009

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.)

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.

Information

Type
Articles
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.)

Article purchase

Temporarily unavailable