Loading algorithms for flexible manufacturing systems with partially groupted machines.

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 785
  • Download : 4
DC FieldValueLanguage
dc.contributor.authorY-D, Kim-
dc.date.accessioned2008-10-28T10:05:53Z-
dc.date.available2008-10-28T10:05:53Z-
dc.date.issued2000-
dc.identifier.citationIIE Transactions Vol. 32, No. 1, pp. 33-47en
dc.identifier.issn0740-817X-
dc.identifier.urihttp://hdl.handle.net/10203/7705-
dc.description.abstractThe loading problem in a Flexible Manufacturing System (FMS) involves allocating operations and associated cutting tools to machines for a given set of parts. There may be different environments for the loading problem that result from three ways of grouping machines in an FMS, i.e., no grouping, partial grouping, and total grouping. Unlike most previous studies on the loading problem for the configurations of no grouping and total grouping, this paper focuses on the loading problem resulting from partial grouping, in which each machine is tooled differently but each operation can be processed by one or more machines. Two types of heuristic algorithms are suggested for the loading problem with the objective of minimizing the maximum workload of the machines. Performances of the suggested loading algorithms are tested on randomly generated test problems and the results show that the suggested algorithms perform better than existing ones. In addition, it is found from simulation experiments that loading plans from partial grouping give significantly better performance than those from total grouping.en
dc.language.isoen_USen
dc.publisherTaylor & Francisen
dc.titleLoading algorithms for flexible manufacturing systems with partially groupted machines.en
dc.typeThesisen
Appears in Collection
IE-Journal Papers(저널논문)

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0