You can view the full text of this article for free using the link below.

Title: A hybrid cuckoo search metaheuristic algorithm for solving single machine total weighted tardiness scheduling problems with sequence dependent setup times

Authors: M.K. Marichelvam; M. Geetha

Addresses: Department of Mechanical Engineering, Kamaraj College of Engineering and Technology, Virudhunagar 626001, Tamil Nadu, 626001, India ' Department of Mathematics, Kamaraj College of Engineering and Technology, Virudhunagar 626001, Tamil Nadu, 626001, India

Abstract: In this paper, we present a hybrid algorithm based on cuckoo search algorithm to solve the single machine total weighted tardiness (SMTWT) scheduling problems with sequence dependent setup times which have been proved to be strongly NP-hard. Three different dispatching rules are incorporated with the initial random solutions of the cuckoo search (CS) algorithm to improve the solution quality. Computational results show that the proposed algorithm is very competitive to many metaheuristic algorithms in the literature.

Keywords: metaheuristics; cuckoo search; total weighted tardiness; NP-hard; single machine scheduling; sequence dependent setup times; dispatching rules.

DOI: 10.1504/IJCCIA.2016.077463

International Journal of Computational Complexity and Intelligent Algorithms, 2016 Vol.1 No.1, pp.23 - 34

Accepted: 26 Mar 2013
Published online: 02 Jul 2016 *

Full-text access for editors Access for subscribers Free access Comment on this article