An Adaptive Clonal Selection Algorithm with Stage Mutation Operation for Unrelated Parallel Machine Scheduling Problem with Sequence-Dependent Setup Times

This paper proposes an adaptive clonal selection algorithm (CSA) to solve the unrelated parallel machine scheduling problem (UPMSP) with sequence-dependent setup time constraints. The objective is to find the sequence which minimizes the makesepan. CSA is a newly discovered population-based evolutionary algorithm based on the clonal selection principle and the immune system. In order to improve the performance of CSA, a local search operation is adopted to strengthen the search ability. In addition, an adaptive clonal factor and a stage mutation operation are introduced to enhance the exploration and exploitation of the algorithm. The performance of the proposed adaptive clonal selection algorithm is compared with genetic algorithm (GA), Simulated Annealing (SA) and basic CSA on 320 randomly generated instances. The results demonstrate the superiority of the proposed method and confirm its potential to solve the UPMSP with sequence-dependent setup time constraints especially when the scale of the instances is very large.

[1]  Jeng-Fung Chen,et al.  Unrelated parallel machine scheduling with secondary resource constraints , 2005 .

[2]  Hao,et al.  Particle Swarm Optimization for Parallel Machine Scheduling Problem with Machine Eligibility Constraints , 2010 .

[3]  Fernando José Von Zuben,et al.  Learning and optimization using the clonal selection principle , 2002, IEEE Trans. Evol. Comput..

[4]  Panos M. Pardalos,et al.  Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times , 2008, Comput. Oper. Res..

[5]  John Lu,et al.  Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective , 2001 .

[6]  Jeng-Fung Chen,et al.  Scheduling on unrelated parallel machines with sequence- and machine-dependent setup times and due-date constraints , 2009 .

[7]  Chuen-Lung Chen,et al.  Hybrid metaheuristics for unrelated parallel machine scheduling with sequence-dependent setup times , 2009 .

[8]  Geun-Cheol Lee,et al.  Bottleneck-focused scheduling for a hybrid flowshop , 2004 .

[9]  J. C. Tay,et al.  Applying the Clonal Selection Principle to Find Flexible Job-Shop Schedules , 2005, ICARIS.

[10]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[11]  Jonathan F. Bard,et al.  Heuristics for the flow line problem with setup costs , 1998, Eur. J. Oper. Res..

[12]  Yanchun Liang,et al.  Clonal Selection Based Memetic Algorithm for Job Shop Scheduling Problems , 2008 .