File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Equal size lot streaming to job-shop scheduling problem using genetic algorithms

TitleEqual size lot streaming to job-shop scheduling problem using genetic algorithms
Authors
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. 472-476 How to Cite?
AbstractA novel approach to solve Equal Size Lot Streaming (ESLS) in Job-shop Scheduling Problem (JSP) using Genetic Algorithms (GAs) is proposed. LS refers to a situation that a lot can be split into a number of smaller lots (or sub-lots) so that successive operation can be overlapped. By adopting the proposed approach, the sub-lot number for different lots and the processing sequence of all sub-lots can be determined simultaneously using GAs. Applying Just-In-Time (JIT) policy, the results show that the solution can minimize both the overall penalty cost and total setup time with the development of multi-objective function. In this connection, decision makers can then assign various weightings so as to enhance the reliability of the final solution. ©2004 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/46546
References

 

DC FieldValueLanguage
dc.contributor.authorChan, FTSen_HK
dc.contributor.authorWong, TCen_HK
dc.contributor.authorChan, PLYen_HK
dc.date.accessioned2007-10-30T06:52:37Z-
dc.date.available2007-10-30T06:52:37Z-
dc.date.issued2004en_HK
dc.identifier.citationIEEE International Symposium on Intelligent Control Proceedings, Taipei, Taiwan, China, 2-4 September 2004, p. 472-476en_HK
dc.identifier.urihttp://hdl.handle.net/10722/46546-
dc.description.abstractA novel approach to solve Equal Size Lot Streaming (ESLS) in Job-shop Scheduling Problem (JSP) using Genetic Algorithms (GAs) is proposed. LS refers to a situation that a lot can be split into a number of smaller lots (or sub-lots) so that successive operation can be overlapped. By adopting the proposed approach, the sub-lot number for different lots and the processing sequence of all sub-lots can be determined simultaneously using GAs. Applying Just-In-Time (JIT) policy, the results show that the solution can minimize both the overall penalty cost and total setup time with the development of multi-objective function. In this connection, decision makers can then assign various weightings so as to enhance the reliability of the final solution. ©2004 IEEE.en_HK
dc.format.extent320829 bytes-
dc.format.extent28160 bytes-
dc.format.extent4385 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/msword-
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.rightsCreative Commons: Attribution 3.0 Hong Kong License-
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.en_HK
dc.titleEqual size lot streaming to job-shop scheduling problem using genetic algorithmsen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailChan, FTS: ftschan@hkucc.hku.hken_HK
dc.identifier.emailChan, PLY: plychan@hku.hken_HK
dc.identifier.authorityChan, FTS=rp00090en_HK
dc.identifier.authorityChan, PLY=rp00093en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/ISIC.2004.1387729en_HK
dc.identifier.scopuseid_2-s2.0-20344394416en_HK
dc.identifier.hkuros100494-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-20344394416&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage472en_HK
dc.identifier.epage476en_HK
dc.identifier.scopusauthoridChan, FTS=7202586517en_HK
dc.identifier.scopusauthoridWong, TC=9246060100en_HK
dc.identifier.scopusauthoridChan, PLY=7403540482en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats