File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Hybrid flowshop scheduling with family setup time and inconsistent family formation

TitleHybrid flowshop scheduling with family setup time and inconsistent family formation
Authors
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
Citation
International Journal of Production Research, 2012, v. 50 n. 6, p. 1457-1475 How to Cite?
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.
Persistent Identifierhttp://hdl.handle.net/10722/155963
ISSN
2015 Impact Factor: 1.693
2015 SCImago Journal Rankings: 1.445
ISI Accession Number ID
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).

References
Grants

 

DC FieldValueLanguage
dc.contributor.authorLuo, Hen_US
dc.contributor.authorHuang, GQen_US
dc.contributor.authorShi, Yen_US
dc.contributor.authorQu, Ten_US
dc.contributor.authorZhang, YFen_US
dc.date.accessioned2012-08-08T08:38:38Z-
dc.date.available2012-08-08T08:38:38Z-
dc.date.issued2012en_US
dc.identifier.citationInternational Journal of Production Research, 2012, v. 50 n. 6, p. 1457-1475en_US
dc.identifier.issn0020-7543en_US
dc.identifier.urihttp://hdl.handle.net/10722/155963-
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.en_US
dc.languageengen_US
dc.publisherTaylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/00207543.aspen_US
dc.relation.ispartofInternational Journal of Production Researchen_US
dc.subjectFlow shop problemsen_US
dc.subjectHybrid flow shop schedulingen_US
dc.subjectMachine settingsen_US
dc.subjectMakespan-
dc.subjectMetaheuristic-
dc.titleHybrid flowshop scheduling with family setup time and inconsistent family formationen_US
dc.typeArticleen_US
dc.identifier.emailLuo, H: luohao@hku.hken_US
dc.identifier.emailHuang, GQ: gqhuang@hku.hken_US
dc.identifier.emailQu, T: quting@hku.hk-
dc.identifier.authorityHuang, GQ=rp00118en_US
dc.identifier.authorityQu, T=rp01500en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1080/00207543.2011.560620en_US
dc.identifier.scopuseid_2-s2.0-84861407526en_US
dc.identifier.hkuros203271-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-84861407526&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume50en_US
dc.identifier.issue6en_US
dc.identifier.spage1457en_US
dc.identifier.epage1475en_US
dc.identifier.isiWOS:000304342500001-
dc.publisher.placeUnited Kingdomen_US
dc.relation.projectRFID-Enabled Real-Time Manufacturing Shop-floor Information Infrastructure for PRD Processing Trade Enterprises-
dc.identifier.scopusauthoridZhang, YF=8305738300en_US
dc.identifier.scopusauthoridQu, T=35590322600en_US
dc.identifier.scopusauthoridShi, Y=55225582000en_US
dc.identifier.scopusauthoridHuang, GQ=7403425048en_US
dc.identifier.scopusauthoridLuo, H=34771707000en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats