File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: A random search approach to the machine loading problem of an FMS

TitleA random search approach to the machine loading problem of an FMS
Authors
Chan, FTSSwarnkar, RTiwari, MK
Issue Date2004
PublisherIEEE, Computer Society. The Journal's web site is located at http://www.ieee.org
Citation
IEEE International Symposium on Intelligent Control Proceedings, Taipei, Taiwan, China, 2-4 September 2004, p. 96-101 How to Cite?
DOI: http://dx.doi.org/10.1109/ISIC.2004.1387665
AbstractThis paper discusses a modelling framework that addresses operational planning, problems of flexible manufacturing systems (FMSs). A generic 0-1 mixed integer programming formulation integrating the part selection and loading problems has been proposed. The constraints considered in the problems are mainly the availability of tool slots and machining time on the machining centres. The above problem is solved using an algorithm based on Simulated Annealing (SA). The potential capability of the approach is demonstrated via a small set of test problems. ©2004 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/46547
References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorChan, FTSen_HK
dc.contributor.authorSwarnkar, Ren_HK
dc.contributor.authorTiwari, MKen_HK
dc.date.accessioned2007-10-30T06:52:38Z-
dc.date.available2007-10-30T06:52:38Z-
dc.date.issued2004en_HK
dc.identifier.citationIEEE International Symposium on Intelligent Control Proceedings, Taipei, Taiwan, China, 2-4 September 2004, p. 96-101en_HK
dc.identifier.urihttp://hdl.handle.net/10722/46547-
dc.description.abstractThis paper discusses a modelling framework that addresses operational planning, problems of flexible manufacturing systems (FMSs). A generic 0-1 mixed integer programming formulation integrating the part selection and loading problems has been proposed. The constraints considered in the problems are mainly the availability of tool slots and machining time on the machining centres. The above problem is solved using an algorithm based on Simulated Annealing (SA). The potential capability of the approach is demonstrated via a small set of test problems. ©2004 IEEE.en_HK
dc.format.extent406878 bytes-
dc.format.extent4385 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherIEEE, Computer Society. The Journal's web site is located at http://www.ieee.orgen_HK
dc.relation.ispartofIEEE International Symposium on Intelligent Control - Proceedingsen_HK
dc.rights©2004 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.-
dc.titleA random search approach to the machine loading problem of an FMSen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailChan, FTS: ftschan@hkucc.hku.hken_HK
dc.identifier.authorityChan, FTS=rp00090en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/ISIC.2004.1387665en_HK
dc.identifier.scopuseid_2-s2.0-20344383488en_HK
dc.identifier.hkuros100495-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-20344383488&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage96en_HK
dc.identifier.epage101en_HK
dc.identifier.scopusauthoridChan, FTS=7202586517en_HK
dc.identifier.scopusauthoridSwarnkar, R=8454361100en_HK
dc.identifier.scopusauthoridTiwari, MK=35427952100en_HK

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats