{"title":"Lorenz dominance based metaheuristic to solve a hybrid flowshop scheduling problem with sequence dependent setup times","authors":"Xiaohui Li, H. Chehade, F. Yalaoui, L. Amodeo","doi":"10.1109/CCCA.2011.6031492","DOIUrl":null,"url":null,"abstract":"This paper deals with a multiobjective hybrid flowshop scheduling problem with sequence dependent setup times. Two different objectives are considered to be optimized at once. Our first contribution is to propose a special encoding for the studied problem. Then, our second contribution is that a new metaheuristic based on the Lorenz dominance relationship (L-NSGA) is developed here to solve the studied problem. The goal is to improve the search ability of the original metaheuristic which is based on the Pareto dominance relationship (NSGA-II). The experimental result shows the efficiency of L-NSGA to solve this problem.","PeriodicalId":259067,"journal":{"name":"2011 International Conference on Communications, Computing and Control Applications (CCCA)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Communications, Computing and Control Applications (CCCA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCCA.2011.6031492","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
Abstract
This paper deals with a multiobjective hybrid flowshop scheduling problem with sequence dependent setup times. Two different objectives are considered to be optimized at once. Our first contribution is to propose a special encoding for the studied problem. Then, our second contribution is that a new metaheuristic based on the Lorenz dominance relationship (L-NSGA) is developed here to solve the studied problem. The goal is to improve the search ability of the original metaheuristic which is based on the Pareto dominance relationship (NSGA-II). The experimental result shows the efficiency of L-NSGA to solve this problem.