Advertisement

Scheduling Deteriorating Jobs and Module Changes with Incompatible Job Families on Parallel Machines Using a Hybrid SADE-AFSA Algorithm

  • Yuwei Sun
  • Xiaofei Qian
  • Siwen Liu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11353)

Abstract

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.

Keywords

Scheduling Deteriorating jobs Incompatible job family Module change SADE-AFSA 

Notes

Acknowledgements

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).

References

  1. 1.
    Craig, I.K., Camisani-Calzolari, F.R., Pistorius, P.C.: A contemplative stance on the automation of continuous casting in steel processing. Control Eng. Pract. 9(9), 1013–1020 (2001)CrossRefGoogle Scholar
  2. 2.
    Browne, S., Yechiali, U.: Scheduling deteriorating jobs on a single processor. Oper. Res. 38, 495–498 (1990)CrossRefGoogle Scholar
  3. 3.
    Li, Shisheng, Yuan, Jinjiang: Parallel-machine scheduling with deteriorating jobs and rejection. Theor. Comput. Sci. 411(40–42), 3642–3650 (2010)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Ji, M., Cheng, T.C.E.: Parallel-machine scheduling of simple linear deteriorating jobs. Eur. J. Oper. Res. 202(1), 90–98 (2010)CrossRefGoogle Scholar
  5. 5.
    Cheng, Wenming, Guo, Peng, Zhang, Zeqiang, Zeng, Ming, Liang, Jian: Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs. Math. Prob. Eng. 7, 243–261 (2012)MathSciNetzbMATHGoogle Scholar
  6. 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
  7. 7.
    Akturk, M.Selim, Ghosh, Jay B., Gunes, Evrim D.: Scheduling with tool changes to minimize total completion time: basic results and SPT performance. Eur. J. Oper. Res. 157(3), 784–790 (2004)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Akturk, M.Selim, Ghosh, Jay B., Kayan, Rabia K.: Scheduling with tool changes to minimize total completion time under controllable machining conditions. Comput. Oper. Res. 34(7), 2130–2146 (2007)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Chen, Jen-Shiang: Optimization models for the tool change scheduling problem. Omega 36(5), 888–894 (2008)CrossRefGoogle Scholar
  10. 10.
    Xu, D., Liu, M., Yin, Y., Hao, J.: Scheduling tool changes and special jobs on a single machine to minimize makespan. Omega 41(2), 299–304 (2013)CrossRefGoogle Scholar
  11. 11.
    Guo, Peng, Cheng, Wenming, Wang, Yi: Parallel machine scheduling with step-deteriorating jobs and setup times by a hybrid discrete cuckoo search algorithm. Eng. Optim. 47(11), 1564–1585 (2015)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Wu, W.H., Xu, J., Wu, W.H., Yin, Y., Cheng, I.F., Wu, C.C.: A tabu method for a two-agent single-machine scheduling with deterioration jobs. Comput. Oper. Res. 40(8), 2116–2127 (2013)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Wu, C.C., Wu, W.H., Wu, W.H., Hsu, P.H., Yin, Y., Xu, J.: A single-machine scheduling with a truncated linear deterioration and ready times. Inf. Sci. 256, 109–125 (2014)MathSciNetCrossRefGoogle Scholar
  14. 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
  15. 15.
    Hu, W., Wang, H., Yan, L., Du, B.: A swarm intelligent method for traffic light scheduling: application to real urban traffic networks. Appl. Intell. 44(1), 208–231 (2016)CrossRefGoogle Scholar
  16. 16.
    Pei, Jun, Liu, Xinbao, Pardalos, Panos M., Fan, Wenjuan, Yang, Shanlin: Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times. Ann. Oper. Res. 249, 175–195 (2017)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Pei, Jun, Pardalos, Panos M., Liu, Xinbao, Fan, Wenjuan, Yang, Shanlin: Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan. Eur. J. Oper. Res. 244(1), 13–25 (2015)MathSciNetCrossRefGoogle Scholar
  18. 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. 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. 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. 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
  22. 22.
    Pei, Jun, Liu, Xinbao, Pardalos, Panos M., Migdalas, Athanasios, Yang, Shanlin: Serial-batching Scheduling with Time-dependent Setup Time and Effects of Deterioration and Learning on a Single-machine. J. Global Optim. 67(1), 251–262 (2017)MathSciNetCrossRefGoogle Scholar
  23. 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
  24. 24.
    Yin, Y., Wang, Y., Cheng, T.C.E., Liu, W., Li, J.: Parallel-machine scheduling of deteriorating jobs with potential machine disruptions. Omega 69, 17–28 (2016)CrossRefGoogle Scholar
  25. 25.
    Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discret. Math. 5(1), 287–326 (1979)MathSciNetCrossRefGoogle Scholar
  26. 26.
    Jr, E.G.C., Garey, M.R., Johnson, D.S.: An application of bin packing to multi-processor scheduling. Siam J. Comput. 7(1), 1–17 (1978)MathSciNetGoogle Scholar
  27. 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
  28. 28.
    Shen, W., Guo, X., Wu, C., Wu, D.: Forecasting stock indices using radial basis function neural networks optimized by artificial fish swarm algorithm. Knowl.-Based Syst. 24(3), 378–385 (2011)CrossRefGoogle Scholar
  29. 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
  30. 30.
    Dihua, Sun, Song, XiaoXiao, Zhao, Min: LinJiang Zheng.: Research on a JIT scheduling problem in parallel motorcycle assembly lines considering actual situations. Int. J. Prod. Res. 50(18), 4923–4936 (2012)CrossRefGoogle Scholar
  31. 31.
    Storn, R., Price, K.: Differential evolution: a simple and efficient adaptive scheme for global optimization over continuous spaces. J. Global Optim. 11, 341–359 (1997)MathSciNetCrossRefGoogle Scholar
  32. 32.
    Bhattacharya, S.S., Garlapati, V.K., Banerjee, R.: Optimization of laccase production using response surface methodology coupled with differential evolution. New Biotechnol. 28(1), 31–39 (2011)CrossRefGoogle Scholar
  33. 33.
    Cai, H.R., Chung, C.Y., Wong, K.P.: Application of Differential Evolution Algorithm for Transient Stability Constrained Optimal Power Flow. IEEE Trans. Power Syst. 23(2), 719–728 (2008)CrossRefGoogle Scholar
  34. 34.
    Santucci, Valentino, Baioletti, Marco, Milani, Alfredo: A differential evolution algorithm for the permutation flowshop scheduling problem with total flow time criterion. IEEE Trans. Evol. Comput. 20(5), 682–694 (2016)CrossRefGoogle Scholar
  35. 35.
    Brest, J., Greiner, S., Boskovic, B., Mernik, M., Zumer, V.: Self-adapting control parameters in differential evolution: A comparative study on numerical benchmark problems. IEEE Trans. Evol. Comput. 10(6), 646–657 (2006)CrossRefGoogle Scholar
  36. 36.
    Jordehi, A.Rezaee: Enhanced leader PSO (ELPSO): a new PSO variant for solving global optimization problems. Appl. Soft Comput. 26, 401–417 (2015)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.School of ManagementHefei University of TechnologyHefeiChina

Personalised recommendations