File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Minimizing makespan for parallel batch processing machines with non-identical job sizes using neural nets approach

TitleMinimizing makespan for parallel batch processing machines with non-identical job sizes using neural nets approach
Authors
Issue Date2008
Citation
2008 3Rd Ieee Conference On Industrial Electronics And Applications, Iciea 2008, 2008, p. 1921-1924 How to Cite?
AbstractThis paper aims at minimizing the makespan for parallel batch processing machines with non-identical job sizes (NPBM) using neural nets (NN) approach. NN approach was proved effective to solve combinatorial optimization problems but no application to NPBM problems hitherto. This research provides new methods to code the NN with the introduction of Master Weight Matrix (MWM). Computational experiments show that the NN approach outperforms other algorithms in various circumstances. ©2008 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/158818
References

 

DC FieldValueLanguage
dc.contributor.authorShao, Hen_US
dc.contributor.authorChen, HPen_US
dc.contributor.authorHuang, GQen_US
dc.contributor.authorXu, Ren_US
dc.contributor.authorCheng, BYen_US
dc.contributor.authorWang, SSen_US
dc.contributor.authorLiu, BWen_US
dc.date.accessioned2012-08-08T09:03:26Z-
dc.date.available2012-08-08T09:03:26Z-
dc.date.issued2008en_US
dc.identifier.citation2008 3Rd Ieee Conference On Industrial Electronics And Applications, Iciea 2008, 2008, p. 1921-1924en_US
dc.identifier.urihttp://hdl.handle.net/10722/158818-
dc.description.abstractThis paper aims at minimizing the makespan for parallel batch processing machines with non-identical job sizes (NPBM) using neural nets (NN) approach. NN approach was proved effective to solve combinatorial optimization problems but no application to NPBM problems hitherto. This research provides new methods to code the NN with the introduction of Master Weight Matrix (MWM). Computational experiments show that the NN approach outperforms other algorithms in various circumstances. ©2008 IEEE.en_US
dc.languageengen_US
dc.relation.ispartof2008 3rd IEEE Conference on Industrial Electronics and Applications, ICIEA 2008en_US
dc.titleMinimizing makespan for parallel batch processing machines with non-identical job sizes using neural nets approachen_US
dc.typeConference_Paperen_US
dc.identifier.emailHuang, GQ:gqhuang@hkucc.hku.hken_US
dc.identifier.authorityHuang, GQ=rp00118en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1109/ICIEA.2008.4582854en_US
dc.identifier.scopuseid_2-s2.0-51949100776en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-51949100776&selection=ref&src=s&origin=recordpageen_US
dc.identifier.spage1921en_US
dc.identifier.epage1924en_US
dc.identifier.scopusauthoridShao, H=35775669900en_US
dc.identifier.scopusauthoridChen, HP=10045046900en_US
dc.identifier.scopusauthoridHuang, GQ=7403425048en_US
dc.identifier.scopusauthoridXu, R=7402813941en_US
dc.identifier.scopusauthoridCheng, BY=24721115700en_US
dc.identifier.scopusauthoridWang, SS=24722424100en_US
dc.identifier.scopusauthoridLiu, BW=36071266900en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats