Application of single depot multiple travelling salesman method to cell formation problems
by Mohammad Mahdi Paydar, Iraj Mahdavi, Kathryn A. Szabat
International Journal of Applied Decision Sciences (IJADS), Vol. 3, No. 4, 2010

Abstract: The cell formation problem (CFP) determines the decomposition of the manufacturing cells of a production system in which machines are assigned to these cells to process one or more part families. In this paper, the CFP is formulated as a single depot multiple travelling salesman problem (SDmTSP). Computational results comparing the model with a set of group technology (GT) problems available in the literature are presented. The approach produced solutions with better grouping efficacy than is reported in the literature.

Online publication date: Fri, 12-Nov-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Applied Decision Sciences (IJADS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com