A hybrid cuckoo search and variable neighborhood descent for single and multiobjective scheduling problems

作者：Hanoun Samer^*; Creighton Doug; Nahavandi Saeid

来源：International Journal of Advanced Manufacturing Technology, 2014, 75(9-12): 1501-1516.

DOI：10.1007/s00170-014-6262-0

• Cuckoo search (CS)
• Meta-heuristics
• Scheduling optimization

Cuckoo search (CS) is a relatively new meta-heuristic that has proven its strength in solving continuous optimization problems. This papers applies cuckoo search to the class of sequencing problems by hybridizing it with a variable neighborhood descent local search for enhancing the quality of the obtained solutions. The L,vy flight operator proposed in the original CS is modified to address the discrete nature of scheduling problems. Two well-known problems are used to demonstrate the effectiveness of the proposed hybrid CS approach. The first is the NP-hard single objective problem of minimizing the weighted total tardiness time () and the second is the multiobjective problem of minimizing the flowtime and the maximum tardiness T (m a x) for single machine (). For the first problem, computational results show that the hybrid CS is able to find the optimal solutions for all benchmark test instances with 40, 50, and 100 jobs and for most instances with 150, 200, 250, and 300 jobs. For the second problem, the hybrid CS generated solutions on and very close to the exact Pareto fronts of test instances with 10, 20, 30, and 40 jobs. In general, the results reveal that the hybrid CS is an adequate and robust method for tackling single and multiobjective scheduling problems.

• 出版日期2014-12