File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Scheduling a batch processing machine with non-identical job sizes: A clustering perspective

TitleScheduling a batch processing machine with non-identical job sizes: A clustering perspective
Authors
Keywordsbatch processing machine
clustering
makespan
scheduling
Issue Date2011
PublisherTaylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/00207543.asp
Citation
International Journal Of Production Research, 2011, v. 49 n. 19, p. 5755-5778 How to Cite?
AbstractBatch processing machines that process a group of jobs simultaneously are often encountered in semiconductor manufacturing and metal heat treatment. This paper considered the problem of scheduling a batch processing machine from a clustering perspective. We first demonstrated that minimising makespan on a single batching machine with non-identical job sizes can be regarded as a special clustering problem, providing a novel insight into scheduling with batching. The definition of WRB (waste ratio of batch) was then presented, and the objective function of minimising makespan was transformed into minimising weighted WRB so as to define the distance measure between batches in a more understandable way. The equivalence of the two objective functions was also proved. In addition, a clustering algorithm CACB (constrained agglomerative clustering of batches) was proposed based on the definition of WRB. To test the effectiveness of the proposed algorithm, the results obtained from CACB were compared with those from the previous methods, including BFLPT (best-fit longest processing time) heuristic and GA (genetic algorithm). CACB outperforms BFLPT and GA especially for large-scale problems. © 2011 Taylor & Francis.
Persistent Identifierhttp://hdl.handle.net/10722/124756
ISSN
2014 Impact Factor: 1.477
2014 SCImago Journal Rankings: 1.353
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorChen, Hen_HK
dc.contributor.authorDu, Ben_HK
dc.contributor.authorHuang, GQen_HK
dc.date.accessioned2010-10-31T10:52:21Z-
dc.date.available2010-10-31T10:52:21Z-
dc.date.issued2011en_HK
dc.identifier.citationInternational Journal Of Production Research, 2011, v. 49 n. 19, p. 5755-5778en_HK
dc.identifier.issn0020-7543en_HK
dc.identifier.urihttp://hdl.handle.net/10722/124756-
dc.description.abstractBatch processing machines that process a group of jobs simultaneously are often encountered in semiconductor manufacturing and metal heat treatment. This paper considered the problem of scheduling a batch processing machine from a clustering perspective. We first demonstrated that minimising makespan on a single batching machine with non-identical job sizes can be regarded as a special clustering problem, providing a novel insight into scheduling with batching. The definition of WRB (waste ratio of batch) was then presented, and the objective function of minimising makespan was transformed into minimising weighted WRB so as to define the distance measure between batches in a more understandable way. The equivalence of the two objective functions was also proved. In addition, a clustering algorithm CACB (constrained agglomerative clustering of batches) was proposed based on the definition of WRB. To test the effectiveness of the proposed algorithm, the results obtained from CACB were compared with those from the previous methods, including BFLPT (best-fit longest processing time) heuristic and GA (genetic algorithm). CACB outperforms BFLPT and GA especially for large-scale problems. © 2011 Taylor & Francis.en_HK
dc.languageengen_HK
dc.publisherTaylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/00207543.aspen_HK
dc.relation.ispartofInternational Journal of Production Researchen_HK
dc.subjectbatch processing machineen_HK
dc.subjectclusteringen_HK
dc.subjectmakespanen_HK
dc.subjectschedulingen_HK
dc.titleScheduling a batch processing machine with non-identical job sizes: A clustering perspectiveen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0020-7543&volume=49&issue=19&spage=5755&epage=5778&date=2011&atitle=Scheduling+a+batch+processing+machine+with+non-identical+job+sizes:+a+clustering+perspectiveen_HK
dc.identifier.emailHuang, GQ:gqhuang@hkucc.hku.hken_HK
dc.identifier.authorityHuang, GQ=rp00118en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1080/00207543.2010.512620en_HK
dc.identifier.scopuseid_2-s2.0-80051756413en_HK
dc.identifier.hkuros178819en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-80051756413&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume49en_HK
dc.identifier.issue19en_HK
dc.identifier.spage5755en_HK
dc.identifier.epage5778en_HK
dc.identifier.isiWOS:000299895300007-
dc.publisher.placeUnited Kingdomen_HK
dc.identifier.scopusauthoridChen, H=35236272300en_HK
dc.identifier.scopusauthoridDu, B=36503746800en_HK
dc.identifier.scopusauthoridHuang, GQ=7403425048en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats