File Download
 
Links for fulltext
(May Require Subscription)
 
Supplementary

Article: Hybrid flowshop scheduling with family setup time and inconsistent family formation
  • Basic View
  • Metadata View
  • XML View
TitleHybrid flowshop scheduling with family setup time and inconsistent family formation
 
AuthorsLuo, H1
Huang, GQ1
Shi, Y3
Qu, T1
Zhang, YF1 2
 
KeywordsFlow shop problems
Hybrid flow shop scheduling
Machine settings
Makespan
Metaheuristic
 
Issue Date2012
 
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, 2012, v. 50 n. 6, p. 1457-1475 [How to Cite?]
DOI: http://dx.doi.org/10.1080/00207543.2011.560620
 
AbstractThis research considers a hybrid flowshop scheduling problem where jobs are organised in families according to their machine settings and tools. The family setup time arises when a machine shifts from processing one job family to another. The problem is compounded by the challenges that the formation of job families is different in different stages and only a limited number of jobs can be processed within one setup. This type of problem is common in the production process of standard metal components. This paper aims to propose two approaches to solve this problem. One is a metaheuristic in the form of a genetic algorithm and the other is a heuristic. The proposed approaches are compared and contrasted against the two relevant metaheuristic and heuristic adapted from solving a generalised sequence-dependent setup flowshop problem. Comparative results indicate that the proposed genetic algorithm has better performance on minimising makespan and the heuristic is more effective on reducing family setup time. © 2012 Copyright Taylor and Francis Group, LLC.
 
ISSN0020-7543
2012 Impact Factor: 1.46
2012 SCImago Journal Rankings: 1.303
 
DOIhttp://dx.doi.org/10.1080/00207543.2011.560620
 
ISI Accession Number IDWOS:000304342500001
Funding AgencyGrant Number
HKSAR ITFGHP/042/07LP
HKSAR RGC GRF
HKU Research Committee
Guangdong Modern Information Service06120940B0260124
Guangdong Department of Science and Technology2010B050100023
National Natural Science Foundation of China61074146
Guangdong High Education Institutiongjhz1005
Fundamental Research Funds for the Central Universities2011ZM0079
Funding Information:

We are most grateful to various companies who provided technical and financial support. The authors would like to acknowledge the financial support of HKSAR ITF (GHP/042/07LP), HKSAR RGC GRF, HKU Research Committee Projects, Guangdong Modern Information Service Fund 2009 (06120940B0260124), 2010 Guangdong Department of Science and Technology Funding (2010B050100023), National Natural Science Foundation of China (61074146), International Collaborative Project of Guangdong High Education Institution (gjhz1005) and The Fundamental Research Funds for the Central Universities (No. 2011ZM0079).

 
ReferencesReferences in Scopus
 
GrantsRFID-Enabled Real-Time Manufacturing Shop-floor Information Infrastructure for PRD Processing Trade Enterprises
 
DC FieldValue
dc.contributor.authorLuo, H
 
dc.contributor.authorHuang, GQ
 
dc.contributor.authorShi, Y
 
dc.contributor.authorQu, T
 
dc.contributor.authorZhang, YF
 
dc.date.accessioned2012-08-08T08:38:38Z
 
dc.date.available2012-08-08T08:38:38Z
 
dc.date.issued2012
 
dc.description.abstractThis research considers a hybrid flowshop scheduling problem where jobs are organised in families according to their machine settings and tools. The family setup time arises when a machine shifts from processing one job family to another. The problem is compounded by the challenges that the formation of job families is different in different stages and only a limited number of jobs can be processed within one setup. This type of problem is common in the production process of standard metal components. This paper aims to propose two approaches to solve this problem. One is a metaheuristic in the form of a genetic algorithm and the other is a heuristic. The proposed approaches are compared and contrasted against the two relevant metaheuristic and heuristic adapted from solving a generalised sequence-dependent setup flowshop problem. Comparative results indicate that the proposed genetic algorithm has better performance on minimising makespan and the heuristic is more effective on reducing family setup time. © 2012 Copyright Taylor and Francis Group, LLC.
 
dc.description.natureLink_to_subscribed_fulltext
 
dc.identifier.citationInternational Journal of Production Research, 2012, v. 50 n. 6, p. 1457-1475 [How to Cite?]
DOI: http://dx.doi.org/10.1080/00207543.2011.560620
 
dc.identifier.doihttp://dx.doi.org/10.1080/00207543.2011.560620
 
dc.identifier.epage1475
 
dc.identifier.hkuros203271
 
dc.identifier.isiWOS:000304342500001
Funding AgencyGrant Number
HKSAR ITFGHP/042/07LP
HKSAR RGC GRF
HKU Research Committee
Guangdong Modern Information Service06120940B0260124
Guangdong Department of Science and Technology2010B050100023
National Natural Science Foundation of China61074146
Guangdong High Education Institutiongjhz1005
Fundamental Research Funds for the Central Universities2011ZM0079
Funding Information:

We are most grateful to various companies who provided technical and financial support. The authors would like to acknowledge the financial support of HKSAR ITF (GHP/042/07LP), HKSAR RGC GRF, HKU Research Committee Projects, Guangdong Modern Information Service Fund 2009 (06120940B0260124), 2010 Guangdong Department of Science and Technology Funding (2010B050100023), National Natural Science Foundation of China (61074146), International Collaborative Project of Guangdong High Education Institution (gjhz1005) and The Fundamental Research Funds for the Central Universities (No. 2011ZM0079).

 
dc.identifier.issn0020-7543
2012 Impact Factor: 1.46
2012 SCImago Journal Rankings: 1.303
 
dc.identifier.issue6
 
dc.identifier.scopuseid_2-s2.0-84861407526
 
dc.identifier.spage1457
 
dc.identifier.urihttp://hdl.handle.net/10722/155963
 
dc.identifier.volume50
 
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.projectRFID-Enabled Real-Time Manufacturing Shop-floor Information Infrastructure for PRD Processing Trade Enterprises
 
dc.relation.referencesReferences in Scopus
 
dc.subjectFlow shop problems
 
dc.subjectHybrid flow shop scheduling
 
dc.subjectMachine settings
 
dc.subjectMakespan
 
dc.subjectMetaheuristic
 
dc.titleHybrid flowshop scheduling with family setup time and inconsistent family formation
 
dc.typeArticle
 
<?xml encoding="utf-8" version="1.0"?>
<item><contributor.author>Luo, H</contributor.author>
<contributor.author>Huang, GQ</contributor.author>
<contributor.author>Shi, Y</contributor.author>
<contributor.author>Qu, T</contributor.author>
<contributor.author>Zhang, YF</contributor.author>
<date.accessioned>2012-08-08T08:38:38Z</date.accessioned>
<date.available>2012-08-08T08:38:38Z</date.available>
<date.issued>2012</date.issued>
<identifier.citation>International Journal of Production Research, 2012, v. 50 n. 6, p. 1457-1475</identifier.citation>
<identifier.issn>0020-7543</identifier.issn>
<identifier.uri>http://hdl.handle.net/10722/155963</identifier.uri>
<description.abstract>This research considers a hybrid flowshop scheduling problem where jobs are organised in families according to their machine settings and tools. The family setup time arises when a machine shifts from processing one job family to another. The problem is compounded by the challenges that the formation of job families is different in different stages and only a limited number of jobs can be processed within one setup. This type of problem is common in the production process of standard metal components. This paper aims to propose two approaches to solve this problem. One is a metaheuristic in the form of a genetic algorithm and the other is a heuristic. The proposed approaches are compared and contrasted against the two relevant metaheuristic and heuristic adapted from solving a generalised sequence-dependent setup flowshop problem. Comparative results indicate that the proposed genetic algorithm has better performance on minimising makespan and the heuristic is more effective on reducing family setup time. &#169; 2012 Copyright Taylor and Francis Group, LLC.</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>Flow shop problems</subject>
<subject>Hybrid flow shop scheduling</subject>
<subject>Machine settings</subject>
<subject>Makespan</subject>
<subject>Metaheuristic</subject>
<title>Hybrid flowshop scheduling with family setup time and inconsistent family formation</title>
<type>Article</type>
<description.nature>Link_to_subscribed_fulltext</description.nature>
<identifier.doi>10.1080/00207543.2011.560620</identifier.doi>
<identifier.scopus>eid_2-s2.0-84861407526</identifier.scopus>
<identifier.hkuros>203271</identifier.hkuros>
<relation.references>http://www.scopus.com/mlt/select.url?eid=2-s2.0-84861407526&amp;selection=ref&amp;src=s&amp;origin=recordpage</relation.references>
<identifier.volume>50</identifier.volume>
<identifier.issue>6</identifier.issue>
<identifier.spage>1457</identifier.spage>
<identifier.epage>1475</identifier.epage>
<identifier.isi>WOS:000304342500001</identifier.isi>
<publisher.place>United Kingdom</publisher.place>
<relation.project>RFID-Enabled Real-Time Manufacturing Shop-floor Information Infrastructure for PRD Processing Trade Enterprises</relation.project>
</item>
Author Affiliations
  1. The University of Hong Kong
  2. State Key Laboratory for Manufacturing Systems Engineering
  3. South China University of Technology