A BRILS metaheuristic for non-smooth flow-shop problems with failure-risk costs
作者：
Highlights：
• Our approach of PFSP includes risk of machine failures due to lack of breaks.
• We model the problem as a non-smooth optimization problem.
• We propose the use of a biased-randomized algorithm to solve it.
• We combine Iterated Local Search with biased randomization of classical heuristics.
• Our approach outperforms other approaches just based on the makespan.
摘要
•Our approach of PFSP includes risk of machine failures due to lack of breaks.•We model the problem as a non-smooth optimization problem.•We propose the use of a biased-randomized algorithm to solve it.•We combine Iterated Local Search with biased randomization of classical heuristics.•Our approach outperforms other approaches just based on the makespan.
论文关键词：65K05,90C26,90C27,90C59,Heuristic algorithms,Biased randomization,Iterated Local Search,Scheduling,Flow-shop,Non-smooth objective functions
论文评审过程：Received 1 July 2014, Revised 8 September 2015, Accepted 9 September 2015, Available online 25 September 2015, Version of Record 10 November 2015.
论文官网地址：https://doi.org/10.1016/j.eswa.2015.09.011
