Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 정인재 | - |
dc.date.accessioned | 2018-02-12T04:45:32Z | - |
dc.date.available | 2018-02-12T04:45:32Z | - |
dc.date.issued | 2011-09 | - |
dc.identifier.citation | In Computers & Industrial Engineering, Vol.61, No.3 [2011], p529-541 | en_US |
dc.identifier.issn | 0360-8352 | - |
dc.identifier.uri | https://www.sciencedirect.com/science/article/pii/S0360835211001094?via%3Dihub | - |
dc.description.abstract | This paper deals with a scheduling problem for reentrant hybrid flowshop with serial stages where each stage consists of identical parallel machines. In a reentrant flowshop, a job may revisit any stage several times. Local-search based Pareto genetic algorithms with Minkowski distance-based crossover operator is proposed to approximate the Pareto optimal solutions for the minimization of makespan and total tardiness in a reentrant hybrid flowshop. The Pareto genetic algorithms are compared with existing multi-objective genetic algorithm, NSGA-II in terms of the convergence to optimal solution, the diversity of solution and the dominance of solution. Experimental results show that the proposed crossover operator and local search are effective and the proposed algorithm outperforms NSGA-II by statistical analysis. (C) 2011 Elsevier Ltd. All rights reserved. | en_US |
dc.description.sponsorship | The authors thank to anonymous referees and Professor V.Jorge Leon at Texas A&M University whose comments helped us to improve this paper. This research was supported by Samsung SDS, Seoul, Korea. | en_US |
dc.language.iso | en | en_US |
dc.publisher | PERGAMON-ELSEVIER SCIENCE LTD, THE BOULEVARD, LANGFORD LANE, KIDLINGTON, OXFORD OX5 1GB, ENGLAND | en_US |
dc.subject | Pareto genetic algorithm | en_US |
dc.subject | NSGA-II | en_US |
dc.subject | Reentrant hybrid flowshop | en_US |
dc.subject | MINIMIZING MAKESPAN | en_US |
dc.subject | SINGLE-MACHINE | en_US |
dc.subject | LOCAL SEARCH | en_US |
dc.subject | TARDINESS | en_US |
dc.subject | MULTIPLE | en_US |
dc.title | Bi-objective scheduling for reentrant hybrid flow shop using Pareto genetic algorithm | en_US |
dc.type | Article | en_US |
dc.relation.no | 3 | - |
dc.relation.volume | 61 | - |
dc.identifier.doi | 10.1016/j.cie.2011.04.008 | - |
dc.relation.page | 529-541 | - |
dc.relation.journal | COMPUTERS & INDUSTRIAL ENGINEERING | - |
dc.contributor.googleauthor | Cho, Hang-Min | - |
dc.contributor.googleauthor | Bae, Suk-Joo | - |
dc.contributor.googleauthor | Kim, Jung-Wuk | - |
dc.contributor.googleauthor | Jeong, In-Jae | - |
dc.relation.code | 2011202218 | - |
dc.sector.campus | S | - |
dc.sector.daehak | COLLEGE OF ENGINEERING[S] | - |
dc.sector.department | DEPARTMENT OF INDUSTRIAL ENGINEERING | - |
dc.identifier.pid | ijeong | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.