Article: Hybrid flowshop scheduling with family setup time and inconsistent family formation
| Title | Hybrid flowshop scheduling with family setup time and inconsistent family formation | ||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Authors | Luo, H1 Huang, GQ1 Shi, Y2 Qu, T1 Zhang, YF1 3 | ||||||||||||||||||
| Keywords | Flow shop problems Hybrid flow shop scheduling Machine settings Makespan Metaheuristic | ||||||||||||||||||
| Issue Date | 2012 | ||||||||||||||||||
| Publisher | Taylor & 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?] DOI: http://dx.doi.org/10.1080/00207543.2011.560620 | ||||||||||||||||||
| 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. © 2012 Copyright Taylor and Francis Group, LLC. | ||||||||||||||||||
| ISSN | 0020-7543 2011 Impact Factor: 1.115 2011 SCImago Journal Rankings: 0.046 | ||||||||||||||||||
| DOI | http://dx.doi.org/10.1080/00207543.2011.560620 | ||||||||||||||||||
| ISI Accession Number ID | WOS:000304342500001
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 | References in Scopus | ||||||||||||||||||
| Grants | RFID-Enabled Real-Time Manufacturing Shop-floor Information Infrastructure for PRD Processing Trade Enterprises |
| dc.contributor.author | Luo, H | ||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| dc.contributor.author | Huang, GQ | ||||||||||||||||||
| dc.contributor.author | Shi, Y | ||||||||||||||||||
| dc.contributor.author | Qu, T | ||||||||||||||||||
| dc.contributor.author | Zhang, YF | ||||||||||||||||||
| dc.date.accessioned | 2012-08-08T08:38:38Z | ||||||||||||||||||
| dc.date.available | 2012-08-08T08:38:38Z | ||||||||||||||||||
| dc.date.issued | 2012 | ||||||||||||||||||
| dc.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. © 2012 Copyright Taylor and Francis Group, LLC. | ||||||||||||||||||
| dc.description.grant | RFID-Enabled Real-Time Manufacturing Shop-floor Information Infrastructure for PRD Processing Trade Enterprises | ||||||||||||||||||
| dc.description.grantcode | 102655 | ||||||||||||||||||
| dc.description.nature | Link_to_subscribed_fulltext | ||||||||||||||||||
| dc.identifier.citation | International 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.doi | http://dx.doi.org/10.1080/00207543.2011.560620 | ||||||||||||||||||
| dc.identifier.epage | 1475 | ||||||||||||||||||
| dc.identifier.hkuros | 203271 | ||||||||||||||||||
| dc.identifier.isi | WOS:000304342500001
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.issn | 0020-7543 2011 Impact Factor: 1.115 2011 SCImago Journal Rankings: 0.046 | ||||||||||||||||||
| dc.identifier.issue | 6 | ||||||||||||||||||
| dc.identifier.scopus | eid_2-s2.0-84861407526 | ||||||||||||||||||
| dc.identifier.spage | 1457 | ||||||||||||||||||
| dc.identifier.uri | http://hdl.handle.net/10722/155963 | ||||||||||||||||||
| dc.identifier.volume | 50 | ||||||||||||||||||
| dc.language | eng | ||||||||||||||||||
| dc.publisher | Taylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/00207543.asp | ||||||||||||||||||
| dc.publisher.place | United Kingdom | ||||||||||||||||||
| dc.relation.ispartof | International Journal of Production Research | ||||||||||||||||||
| dc.relation.references | References in Scopus | ||||||||||||||||||
| dc.subject | Flow shop problems | ||||||||||||||||||
| dc.subject | Hybrid flow shop scheduling | ||||||||||||||||||
| dc.subject | Machine settings | ||||||||||||||||||
| dc.subject | Makespan | ||||||||||||||||||
| dc.subject | Metaheuristic | ||||||||||||||||||
| dc.title | Hybrid flowshop scheduling with family setup time and inconsistent family formation | ||||||||||||||||||
| dc.type | Article |
Author Affiliations
- The University of Hong Kong
- South China University of Technology
- Xi'an Jiaotong University