Scheduling Deteriorating Jobs and Module Changes with Incompatible Job Families on Parallel Machines Using a Hybrid SADE-AFSA Algorithm
This research is motivated by a scheduling problem found in the special steel industry of continuous casting processing, where the special steel is produced on the parallel machines, i.e., the continuous casting machine, and each machine can produce more than one types of special steel. Usually, different types of special steel have diversity alloy content, which generates distinct cooling requirements. Consequently, the job families are incompatible, different types of special steel cannot be continuous process. This indicates that the machine will pause for a period of time to execute the module change activity between two adjacent job families. In this context, we attempt to investigate a parallel machine scheduling problem with the objective of minimizing the makespan, i.e., the completion time of the last job. The effect of deterioration, incompatible job families, and the module change activity are taken into consideration simultaneously, and the actual processing time of each job depends on its starting time and normal processing time. A hybrid SADE-AFSA algorithm combining Self-Adaptive Differential Evolution (SADE) and Artificial fish swarm algorithm (AFSA) is proposed to tackle this problem. Finally, the computational experiments are conducted to evaluate the performance of the proposed algorithm.
KeywordsScheduling Deteriorating jobs Incompatible job family Module change SADE-AFSA
This work is supported by the National Natural Science Foundation of China (Nos. 71601065, 71231004, 71501058, 71690235, 71690230), and Innovative Research Groups of the National Natural Science Foundation of China (71521001), the Humanities and Social Sciences Foundation of the Chinese Ministry of Education (No. 15YJC630097), Anhui Province Natural Science Foundation (No. 1608085QG167). Panos M. Pardalos is partially supported by the project of “Distinguished International Professor by the Chinese Ministry of Education” (MS2014HFGY026).
- 6.Liu, M., Shijin W., Chengbin, C.: Scheduling deteriorating jobs with past-sequence-dependent delivery times. Int. J. Prod. Econ. 144(2), 418−421 (2013).Google Scholar
- 14.Mir, M., Salehi, S., Rezaeian, J.: A robust hybrid approach based on particle swarm optimization and genetic algorithm to minimize the total machine load on unrelated parallel machines. Appl. Soft Comput. 41, 488−504 (2016)Google Scholar
- 18.Pei, J., Liu, X., Pardalos, P.M., Fan, W., Yang, S.: Single machine serial-batching scheduling with independent setup time and deteriorating job processing times. Optim. Lett. 9(1), 91−104 (2015)Google Scholar
- 19.Pei, Jun, Liu, Xinbao, Pardalos, Panos M., Li, Kai, Fan, Wenjuan, Migdalas, Athanasios: Single-machine serial-batching scheduling with a machine availability constraint, position-dependent processing time, and time-dependent set-up time. Optim. Lett. 11(7), 1257–1271 (2017)MathSciNetCrossRefGoogle Scholar
- 20.Pei, J., Liu, X., Fan, W., Pardalos, P.M., Lu, S.: A hybrid BA-VNS algorithm for coordinated serial-batching scheduling with deteriorating jobs, financial budget, and resource constraint in multiple manufacturers. Omega (2017). https://doi.org/10.1016/j.omega.2017.12.003
- 21.Liu, X., Lu, S., Pei, J., Pardalos, P.M.: A hybrid VNS-HS algorithm for a supply chain scheduling problem with deteriorating jobs. Int. J. Prod. Res. (2017). https://doi.org/10.1080/00207543.2017.1418986
- 23.Fan, W., Pei, J., Liu, X., Pardalos, P.M., Kong, M.: Serial-batching group scheduling with release times and the combined effects of deterioration and truncated job-dependent learning. J. Global Optim. (2017). https://doi.org/10.1007/s10898-017-0536-7
- 27.Xiaolei, L.I., Shao, Z., Qian, J.: An optimizing method based on autonomous animats: fish-swarm algorithm. Syst. Eng.-theory Pract. 22(11), 32–38 (2002)Google Scholar
- 29.Li, Z., Zhang, H., Xu, J., Zhai, Q.: Recognition and localization of harmful acoustic signals in wireless sensor network based on artificial fish swarm algorithm. Dev. Neurosci. 9(1), 53−60 (2013).Google Scholar