File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Lot streaming technique in job-shop environment

TitleLot streaming technique in job-shop environment
Authors
Issue Date2005
PublisherIEEE, Computer Society. The Journal's web site is located at http://www.ieee.org
Citation
IEEE International Symposium on Intelligent Control Proceedings, the 13th Mediterrean Conference on Control and Automation Proceedings, Limassol, Cyprus, 27-29 June, 2005, p. 364-369 How to Cite?
AbstractApplying Lot Streaming (LS) technique, a new approach is applied to determine LS conditions in Job-shop Scheduling Problem (JSP) using Genetic Algorithms (GA). LS approach allows a job (lot) to be split into a number of smaller sub-jobs (sub-lots) so that successive operations of the same job can be overlapped. In this connection, the total completion time of the whole job may be shortened. The proposed approach is developed to solve two sub-problems. The first sub-problem is called LS problem in which LS conditions are determined and another sub-problem is JSP after LS conditions are determined. A number of benchmarked problems will be investigated to study the optimum LS conditions in Just-In-Time (JIT) environment. Experiment results suggest that the model works fairly well with different objectives and good solutions can be obtained within reasonable time frame. ©2005 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/46553
References

 

DC FieldValueLanguage
dc.contributor.authorChan, FTSen_HK
dc.contributor.authorWong, TCen_HK
dc.contributor.authorChan, PLYen_HK
dc.date.accessioned2007-10-30T06:52:47Z-
dc.date.available2007-10-30T06:52:47Z-
dc.date.issued2005en_HK
dc.identifier.citationIEEE International Symposium on Intelligent Control Proceedings, the 13th Mediterrean Conference on Control and Automation Proceedings, Limassol, Cyprus, 27-29 June, 2005, p. 364-369en_HK
dc.identifier.urihttp://hdl.handle.net/10722/46553-
dc.description.abstractApplying Lot Streaming (LS) technique, a new approach is applied to determine LS conditions in Job-shop Scheduling Problem (JSP) using Genetic Algorithms (GA). LS approach allows a job (lot) to be split into a number of smaller sub-jobs (sub-lots) so that successive operations of the same job can be overlapped. In this connection, the total completion time of the whole job may be shortened. The proposed approach is developed to solve two sub-problems. The first sub-problem is called LS problem in which LS conditions are determined and another sub-problem is JSP after LS conditions are determined. A number of benchmarked problems will be investigated to study the optimum LS conditions in Just-In-Time (JIT) environment. Experiment results suggest that the model works fairly well with different objectives and good solutions can be obtained within reasonable time frame. ©2005 IEEE.en_HK
dc.format.extent222508 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.ispartofProceedings of the 20th IEEE International Symposium on Intelligent Control, ISIC '05 and the 13th Mediterranean Conference on Control and Automation, MED '05en_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights©2005 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.titleLot streaming technique in job-shop environmenten_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/.2005.1467042en_HK
dc.identifier.scopuseid_2-s2.0-33745196939en_HK
dc.identifier.hkuros100531-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-33745196939&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume2005en_HK
dc.identifier.spage364en_HK
dc.identifier.epage369en_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