File Download
 
Links for fulltext
(May Require Subscription)
 
Supplementary

Article: Scheduling a batch processing machine with non-identical job sizes: A clustering perspective
  • Basic View
  • Metadata View
  • XML View
TitleScheduling a batch processing machine with non-identical job sizes: A clustering perspective
 
AuthorsChen, H2
Du, B2
Huang, GQ1
 
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
 
CitationInternational Journal Of Production Research, 2011, v. 49 n. 19, p. 5755-5778 [How to Cite?]
DOI: http://dx.doi.org/10.1080/00207543.2010.512620
 
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.
 
ISSN0020-7543
2013 Impact Factor: 1.323
 
DOIhttp://dx.doi.org/10.1080/00207543.2010.512620
 
ISI Accession Number IDWOS:000299895300007
 
ReferencesReferences in Scopus
 
DC FieldValue
dc.contributor.authorChen, H
 
dc.contributor.authorDu, B
 
dc.contributor.authorHuang, GQ
 
dc.date.accessioned2010-10-31T10:52:21Z
 
dc.date.available2010-10-31T10:52:21Z
 
dc.date.issued2011
 
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.
 
dc.description.naturelink_to_subscribed_fulltext
 
dc.identifier.citationInternational Journal Of Production Research, 2011, v. 49 n. 19, p. 5755-5778 [How to Cite?]
DOI: http://dx.doi.org/10.1080/00207543.2010.512620
 
dc.identifier.doihttp://dx.doi.org/10.1080/00207543.2010.512620
 
dc.identifier.epage5778
 
dc.identifier.hkuros178819
 
dc.identifier.isiWOS:000299895300007
 
dc.identifier.issn0020-7543
2013 Impact Factor: 1.323
 
dc.identifier.issue19
 
dc.identifier.openurl
 
dc.identifier.scopuseid_2-s2.0-80051756413
 
dc.identifier.spage5755
 
dc.identifier.urihttp://hdl.handle.net/10722/124756
 
dc.identifier.volume49
 
dc.languageeng
 
dc.publisherTaylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/00207543.asp
 
dc.publisher.placeUnited Kingdom
 
dc.relation.ispartofInternational Journal of Production Research
 
dc.relation.referencesReferences in Scopus
 
dc.subjectbatch processing machine
 
dc.subjectclustering
 
dc.subjectmakespan
 
dc.subjectscheduling
 
dc.titleScheduling a batch processing machine with non-identical job sizes: A clustering perspective
 
dc.typeArticle
 
<?xml encoding="utf-8" version="1.0"?>
<item><contributor.author>Chen, H</contributor.author>
<contributor.author>Du, B</contributor.author>
<contributor.author>Huang, GQ</contributor.author>
<date.accessioned>2010-10-31T10:52:21Z</date.accessioned>
<date.available>2010-10-31T10:52:21Z</date.available>
<date.issued>2011</date.issued>
<identifier.citation>International Journal Of Production Research, 2011, v. 49 n. 19, p. 5755-5778</identifier.citation>
<identifier.issn>0020-7543</identifier.issn>
<identifier.uri>http://hdl.handle.net/10722/124756</identifier.uri>
<description.abstract>Batch 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. &#169; 2011 Taylor &amp; Francis.</description.abstract>
<language>eng</language>
<publisher>Taylor &amp; Francis Ltd. The Journal&apos;s web site is located at http://www.tandf.co.uk/journals/titles/00207543.asp</publisher>
<relation.ispartof>International Journal of Production Research</relation.ispartof>
<subject>batch processing machine</subject>
<subject>clustering</subject>
<subject>makespan</subject>
<subject>scheduling</subject>
<title>Scheduling a batch processing machine with non-identical job sizes: A clustering perspective</title>
<type>Article</type>
<identifier.openurl>http://library.hku.hk:4550/resserv?sid=HKU:IR&amp;issn=0020-7543&amp;volume=49&amp;issue=19&amp;spage=5755&amp;epage=5778&amp;date=2011&amp;atitle=Scheduling+a+batch+processing+machine+with+non-identical+job+sizes:+a+clustering+perspective</identifier.openurl>
<description.nature>link_to_subscribed_fulltext</description.nature>
<identifier.doi>10.1080/00207543.2010.512620</identifier.doi>
<identifier.scopus>eid_2-s2.0-80051756413</identifier.scopus>
<identifier.hkuros>178819</identifier.hkuros>
<relation.references>http://www.scopus.com/mlt/select.url?eid=2-s2.0-80051756413&amp;selection=ref&amp;src=s&amp;origin=recordpage</relation.references>
<identifier.volume>49</identifier.volume>
<identifier.issue>19</identifier.issue>
<identifier.spage>5755</identifier.spage>
<identifier.epage>5778</identifier.epage>
<identifier.isi>WOS:000299895300007</identifier.isi>
<publisher.place>United Kingdom</publisher.place>
</item>
Author Affiliations
  1. The University of Hong Kong
  2. University of Science and Technology of China