A Novel Shuffled Frog-Leaping Algorithm for Flexible Job Shop Scheduling with Interval Processing Time
详细信息 查看官网全文
- 英文论文题名：A Novel Shuffled Frog-Leaping Algorithm for Flexible Job Shop Scheduling with Interval Processing Time
- 论文作者：Deming Lei ; Sanqiang Cao
- 英文论文作者：Deming Lei ; Sanqiang Cao ; School of Automation ; Wuhan University of Technology
- 年：2017
- 作者机构：School of Automation,Wuhan University of Technology;
- 英文论文关键词：Flexible job shop scheduling problem ; Interval processing time ; Shuffled frog-leaping algorithm ; Uncertainty
- 会议召开时间：2017-07-26
- 会议录名称：第36届中国控制会议论文集（B）
- 英文会议录名称：Proceedings of the 36th Chinese Control Conference（B）
- 语种：英文
- 分类号：TB497
- 学会代码：KZLL
- 会议名称：第36届中国控制会议
- 会议地点：中国辽宁大连
- 主办单位：中国自动化学会控制理论专业委员会
- 学会名称：中国自动化学会控制理论专业委员会
- 页数：6
- 文件大小：172k
- 原文格式：D
- 会议级别：全国
摘要
In this study flexible job shop scheduling problem(FJSP) with interval processing times is considered and a novel shuffled frog-leaping algorithm(SFLA) is applied to minimize the maximum interval completion time. Memeplexes are constructed only once and no population shuffling is done. The cooperation of global search and neighborhood search are adopted within the search process of each memeplex. Other strategies such as the handling on the worst solution are also adopted to generate high quality solutions. A new performance metric is used to evaluate interval results. Many experiments are conducted to test the performance of SFLA and computational results show the promising advantages of SFLA on FJSP with interval processing time.
In this study flexible job shop scheduling problem(FJSP) with interval processing times is considered and a novel shuffled frog-leaping algorithm(SFLA) is applied to minimize the maximum interval completion time. Memeplexes are constructed only once and no population shuffling is done. The cooperation of global search and neighborhood search are adopted within the search process of each memeplex. Other strategies such as the handling on the worst solution are also adopted to generate high quality solutions. A new performance metric is used to evaluate interval results. Many experiments are conducted to test the performance of SFLA and computational results show the promising advantages of SFLA on FJSP with interval processing time.
In this study flexible job shop scheduling problem(FJSP) with interval processing times is considered and a novel shuffled frog-leaping algorithm(SFLA) is applied to minimize the maximum interval completion time. Memeplexes are constructed only once and no population shuffling is done. The cooperation of global search and neighborhood search are adopted within the search process of each memeplex. Other strategies such as the handling on the worst solution are also adopted to generate high quality solutions. A new performance metric is used to evaluate interval results. Many experiments are conducted to test the performance of SFLA and computational results show the promising advantages of SFLA on FJSP with interval processing time.
引文
[1]Linguistic-based meta-heuristic optimization model for flexible job shop scheduling.Int J Prod Res40(2002),4523-4543.
[2]Xia W.,Wu Z.An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems.Comput Ind Eng 48(2005),409-425.
[3]Li J.Q.,Pan Q.K.,Xie S.X.An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems.Appl Math Comput 218(2012),9395-9371.
[4]Li J.Q.,Pan Q.K.,Tasgetiren M.F.A discrete artificial bee colony algorithm for the multiobjective flexible job-shop scheduling problem with maintenance.Appl Math Model38(2014),1111-1132.
[5]Wang L.,Wang S.Y.,Liu M.A Pareto-based estimation of distribution algorithm for the multi-objective flexible job-shop scheduling problem.Int J Prod Res 51(2013),3574-3592
[6]Yuan Y.,Xu H.Multiobjective flexible job shop scheduling using memetic algorithms.IEEE Trans Auto Sci Eng12(2015),336-353.
[7]Ahmadi E.,Zandieh M.,Farrokh M.,Emami S.M.A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithm.Comput Oper Res,73(2016),56-66.
[8]Li X.Y.,Gao L.An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem.Int JProd Econ,174(2016),93-110.
[9]Lei D.M.A genetic algorithm for flexible job shop scheduling with fuzzy processing time.Int J Prod Res.48(2010):2995-3013.
[10]Lei D.M.Co-evolutionary genetic algorithm for fuzzy flexible job shop scheduling.Appl Soft Comput 12(2012),2237-2245.
[11]Lei D.M.,Guo X.P.Swarm-based neighbourhood search algorithm for fuzzy flexible job shop scheduling.Int J Prod Res,50(2012):1639-1649.
[12]Wang L.,Zhou G.,Xu Y.,Liu M.A hybrid artificial bee colony algorithm for the fuzzy flexible job-shop scheduling problem Int J Prod Res 51(2013),3593-3608
[13]Wang S.Y.,Wang L.,Xu Y.,Liu M.An effective estimation of distribution algorithm for the flexible job-shop scheduling problem with fuzzy processing time,Int J Prod Res 51(2013),3778-3793
[14]Xu Y.,Wang L.,Wang S.Y.,Liu M.An effective teaching-learning-based optimization algorithm for the flexible job-shop scheduling problem with fuzzy processing time.Neurocomputing 148(2015),260-268
[15]Gao K.Z.,Suganthan P.N.,Pan Q.K.,Chua T.J.,Chin S.,Cai T.X.An improved artificial bee colony algorithm for flexible job-shop scheduling problem with fuzzy processing time Exp Syst Appl 65(2016),52-67
[16]Gao K.Z.,Suganthan P.N.,Pan Q.K.,Tasgetiren M.F.An effective discrete harmony search algorithm for flexible job shop scheduling problem with fuzzy processing time.Int JProd Res 53(2016),5896-5911
[17]Mokhtari H.,Dadgar M.Scheduling optimization of a stochatic flexible job-shop system with time-varying machine failure rate Comput Oper Res 61(2015),31-45
[18]Lei D.M.Population-based neighborhood search for job shop scheduling with interval processing time Comput Ind Eng 61(2011),1200-1208
[19]Lei D.M.,Guo X.P.An effective neighborhood search for scheduling in dual resource constrained interval job shop with environmental objective.Int J Prod Econ 159(2015),296-303
[20]Han Y.Y.,Gong D.W.,Jin Y.C.,Pan Q.K.Evolutionary multi-objective blocking lot-streaming flow shop scheduling with interval processing time Appl Soft Comput 42(2016),229-245
[21]Eusuff M.M.,Lansey K.E.,Pasha F.Shuffled frog-leaping algorithm:a memetic meta-heuristics for discrete optimization Eng Opt 38(2006),129-154
[22]Rahimi-Vahed A.,Dangchi M.,Rafiei H.,Salimi E.A novel hybrid multi-objective shuffled frog-leaping algorithm for a bi-criteria permutation flow shop scheduling problem.Int JAdv Manuf Technol 41(2009)1227-1239
[23]Pan Q.K.,Wang L.,Gao L.,Li J.Q.An effective shuffled frog-leaping for lot streaming flow shop scheduling problem.Int J Adv Manuf Technol 52(2011),699-713
[24]Lei D.M.,Guo X.P.A shuffled frog leaping algorithm for hybrid flow shop scheduling with two agents Exp Syst Appl 42(2015),9333-9339
[25]Bierwirth C.A generalized permutation approach to job shop scheduling with genetic algorithm.OR Spec 17(1995),87-92
[26]Brandimarte P.Routing and scheduling in a flexible job shop by tabu search.Anna Oper Res 41(1993),157-183
[2]Xia W.,Wu Z.An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems.Comput Ind Eng 48(2005),409-425.
[3]Li J.Q.,Pan Q.K.,Xie S.X.An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems.Appl Math Comput 218(2012),9395-9371.
[4]Li J.Q.,Pan Q.K.,Tasgetiren M.F.A discrete artificial bee colony algorithm for the multiobjective flexible job-shop scheduling problem with maintenance.Appl Math Model38(2014),1111-1132.
[5]Wang L.,Wang S.Y.,Liu M.A Pareto-based estimation of distribution algorithm for the multi-objective flexible job-shop scheduling problem.Int J Prod Res 51(2013),3574-3592
[6]Yuan Y.,Xu H.Multiobjective flexible job shop scheduling using memetic algorithms.IEEE Trans Auto Sci Eng12(2015),336-353.
[7]Ahmadi E.,Zandieh M.,Farrokh M.,Emami S.M.A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithm.Comput Oper Res,73(2016),56-66.
[8]Li X.Y.,Gao L.An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem.Int JProd Econ,174(2016),93-110.
[9]Lei D.M.A genetic algorithm for flexible job shop scheduling with fuzzy processing time.Int J Prod Res.48(2010):2995-3013.
[10]Lei D.M.Co-evolutionary genetic algorithm for fuzzy flexible job shop scheduling.Appl Soft Comput 12(2012),2237-2245.
[11]Lei D.M.,Guo X.P.Swarm-based neighbourhood search algorithm for fuzzy flexible job shop scheduling.Int J Prod Res,50(2012):1639-1649.
[12]Wang L.,Zhou G.,Xu Y.,Liu M.A hybrid artificial bee colony algorithm for the fuzzy flexible job-shop scheduling problem Int J Prod Res 51(2013),3593-3608
[13]Wang S.Y.,Wang L.,Xu Y.,Liu M.An effective estimation of distribution algorithm for the flexible job-shop scheduling problem with fuzzy processing time,Int J Prod Res 51(2013),3778-3793
[14]Xu Y.,Wang L.,Wang S.Y.,Liu M.An effective teaching-learning-based optimization algorithm for the flexible job-shop scheduling problem with fuzzy processing time.Neurocomputing 148(2015),260-268
[15]Gao K.Z.,Suganthan P.N.,Pan Q.K.,Chua T.J.,Chin S.,Cai T.X.An improved artificial bee colony algorithm for flexible job-shop scheduling problem with fuzzy processing time Exp Syst Appl 65(2016),52-67
[16]Gao K.Z.,Suganthan P.N.,Pan Q.K.,Tasgetiren M.F.An effective discrete harmony search algorithm for flexible job shop scheduling problem with fuzzy processing time.Int JProd Res 53(2016),5896-5911
[17]Mokhtari H.,Dadgar M.Scheduling optimization of a stochatic flexible job-shop system with time-varying machine failure rate Comput Oper Res 61(2015),31-45
[18]Lei D.M.Population-based neighborhood search for job shop scheduling with interval processing time Comput Ind Eng 61(2011),1200-1208
[19]Lei D.M.,Guo X.P.An effective neighborhood search for scheduling in dual resource constrained interval job shop with environmental objective.Int J Prod Econ 159(2015),296-303
[20]Han Y.Y.,Gong D.W.,Jin Y.C.,Pan Q.K.Evolutionary multi-objective blocking lot-streaming flow shop scheduling with interval processing time Appl Soft Comput 42(2016),229-245
[21]Eusuff M.M.,Lansey K.E.,Pasha F.Shuffled frog-leaping algorithm:a memetic meta-heuristics for discrete optimization Eng Opt 38(2006),129-154
[22]Rahimi-Vahed A.,Dangchi M.,Rafiei H.,Salimi E.A novel hybrid multi-objective shuffled frog-leaping algorithm for a bi-criteria permutation flow shop scheduling problem.Int JAdv Manuf Technol 41(2009)1227-1239
[23]Pan Q.K.,Wang L.,Gao L.,Li J.Q.An effective shuffled frog-leaping for lot streaming flow shop scheduling problem.Int J Adv Manuf Technol 52(2011),699-713
[24]Lei D.M.,Guo X.P.A shuffled frog leaping algorithm for hybrid flow shop scheduling with two agents Exp Syst Appl 42(2015),9333-9339
[25]Bierwirth C.A generalized permutation approach to job shop scheduling with genetic algorithm.OR Spec 17(1995),87-92
[26]Brandimarte P.Routing and scheduling in a flexible job shop by tabu search.Anna Oper Res 41(1993),157-183
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |