File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Minimizing the total completion time on a single batch processing machine with non-identical job sizes using ant colony optimization

TitleMinimizing the total completion time on a single batch processing machine with non-identical job sizes using ant colony optimization
Authors
Xu, RChen, HPHuang, GQShao, HCheng, BYLiu, BW
Issue Date2008
Citation
2008 3Rd Ieee Conference On Industrial Electronics And Applications, Iciea 2008, 2008, p. 2211-2215 How to Cite?
DOI: http://dx.doi.org/10.1109/ICIEA.2008.4582910
AbstractThis paper aims at minimizing the total completion time for a single batch processing machine (BPM) with non-identical job sizes. For this problem, each job has a corresponding processing time and size. The machine can process the jobs in batches as long as the total size of all the jobs in a batch does not exceed the machine capacity. The processing time of a batch is equal to the longest processing time among all the jobs in that batch. This problem is NP-hard and hence an ant colony optimization (ACO) approach based on job sequence is proposed. Random instances were used to test the effectiveness of the proposed approach. Computational results show that ACO significantly outperforms other algorithms addressed in the literature. ©2008 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/158819
References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorXu, Ren_US
dc.contributor.authorChen, HPen_US
dc.contributor.authorHuang, GQen_US
dc.contributor.authorShao, Hen_US
dc.contributor.authorCheng, BYen_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. 2211-2215en_US
dc.identifier.urihttp://hdl.handle.net/10722/158819-
dc.description.abstractThis paper aims at minimizing the total completion time for a single batch processing machine (BPM) with non-identical job sizes. For this problem, each job has a corresponding processing time and size. The machine can process the jobs in batches as long as the total size of all the jobs in a batch does not exceed the machine capacity. The processing time of a batch is equal to the longest processing time among all the jobs in that batch. This problem is NP-hard and hence an ant colony optimization (ACO) approach based on job sequence is proposed. Random instances were used to test the effectiveness of the proposed approach. Computational results show that ACO significantly outperforms other algorithms addressed in the literature. ©2008 IEEE.en_US
dc.languageengen_US
dc.relation.ispartof2008 3rd IEEE Conference on Industrial Electronics and Applications, ICIEA 2008en_US
dc.titleMinimizing the total completion time on a single batch processing machine with non-identical job sizes using ant colony optimizationen_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.4582910en_US
dc.identifier.scopuseid_2-s2.0-51949103263en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-51949103263&selection=ref&src=s&origin=recordpageen_US
dc.identifier.spage2211en_US
dc.identifier.epage2215en_US
dc.identifier.scopusauthoridXu, R=7402813941en_US
dc.identifier.scopusauthoridChen, HP=10045046900en_US
dc.identifier.scopusauthoridHuang, GQ=7403425048en_US
dc.identifier.scopusauthoridShao, H=35775669900en_US
dc.identifier.scopusauthoridCheng, BY=24721115700en_US
dc.identifier.scopusauthoridLiu, BW=36071266900en_US

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats