Journal of the Korea Safety Management & Science (대한안전경영과학회지)

Korea Safety Management & Science (대한안전경영과학회)
권호 표지
DOI QR코드

DOI QR Code

A Study on Memetic Algorithm-Based Scheduling for Minimizing Makespan in Unrelated Parallel Machines without Setup Time

작업준비시간이 없는 이종 병렬설비에서 총 소요 시간 최소화를 위한 미미틱 알고리즘 기반 일정계획에 관한 연구

  • Tehie Lee (Incheon National University Graduate School, Industrial & Management Engineering) ;
  • Woo-Sik Yoo (Incheon National University, Dept. of Industrial & Management Engineering)
  • 이태희 (인천대학교 산업경영공학과) ;
  • 유우식 (인천대학교 산업경영공학과)
  • Received : 2023.03.20
  • Accepted : 2023.06.22
  • Published : 2023.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

This paper is proposing a novel machine scheduling model for the unrelated parallel machine scheduling problem without setup times to minimize the total completion time, also known as "makespan". This problem is a NP-complete problem, and to date, most approaches for real-life situations are based on the operator's experience or simple heuristics. The new model based on the Memetic Algorithm, which was proposed by P. Moscato in 1989, is a hybrid algorithm that includes genetic algorithm and local search optimization. The new model is tested on randomly generated datasets, and is compared to optimal solution, and four scheduling models; three rule-based heuristic algorithms, and a genetic algorithm based scheduling model from literature; the test results show that the new model performed better than scheduling models from literature.

Keywords

Acknowledgement

본 논문은 인천대학교 2021년도 자체 연구비 지원에 의하여 연구되었음.

References

  1. O. H. Ibarra, C. E. Kim(1977), "Heuristic algorithms for scheduling independent tasks on nonidentical processors." Journal of the ACM, 24:280-289. https://doi.org/10.1145/322003.322011
  2. A. A. E. A. Elhafiz(2017a), "ACTA: Average of completion time algorithm." International Journal of Computer Applications, 172(8):18-22. https://doi.org/10.5120/ijca2017915193
  3. A. A. E. A. Elhafiz(2017b), "HASA: Half the average scheduling algorithm." Circulation in Computer Science, 2(9):35-39. https://doi.org/10.22632/ccs-2017-252-58
  4. P. Moscato(1989), "On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms." Technical Report C3P 826, Caltech Con-Current Computation Program 158-79, California Institute of Technology, Pasadena, CA.
  5. S. Baluja, R. Caruana(1995), "Removing the genetics from the standard genetic algorithm." Machine Learning Proceedings, 1995:38-46. https://doi.org/10.1016/B978-1-55860-377-6.50014-1
  6. A. Shukla, et al.(2015), "Comparative review of selection techniques in genetic algorithm." 2015 International Conference on Futuristic Trends on Computational Analysis and Knowledge Management (ABLAZE), pp. 515-519.
  7. T. Schnier, J. Gero(1998), "Dominant and recessive genes in evolutionary systems applied to spatial reasoning." Advanced Topics in Artificial Intelligence, pp. 127-136.
  8. S. Balin(2011a), "Non-identical parallel machine scheduling using genetic algorithm." Expert Systems with Applications, 38(6):6814-6821. https://doi.org/10.1016/j.eswa.2010.12.064
  9. S. Balin(2011b), "Parallel machine scheduling with fuzzy processing times using a robust genetic algorithm and simulation." Information Sciences, 181(17):3551-3569. https://doi.org/10.1016/j.ins.2011.04.010
  10. J. H. Holland(1975), Adaptation in natural and artificial system. Cambridge: MIT Press.
  11. Y. G. Kim(2017), METAHEURISTICS. Chonnam National University Press.
  12. E. Horowitz, S. Sahni(1976), "Exact and approximate algorithms for scheduling non-identical processors." Journal of the ACM, 23(2): 317-327. https://doi.org/10.1145/321941.321951
  13. N. Piersma, W. Van Dijk(1996), "A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search." Mathematical and Computer Modeling, 24(9):11-19. https://doi.org/10.1016/0895-7177(96)00150-1
  14. B. Srivastava(1998), "An effective heuristic for minimizing makespan on unrelated parallel machines." Journal of the Operational Research Society, 49(8):886-894.
  15. M. Ghirardi, C. N. Potts(2005), "Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach." European Journal of Operational Research, 165(2): 457-467. https://doi.org/10.1016/j.ejor.2004.04.015
  16. R. Tavakkoli-Moghaddam, et al.(2009), "Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints." Computers & Operations Research, 36(12):3224-3230. https://doi.org/10.1016/j.cor.2009.02.012
  17. J. Ding, et al.(2020), "A hybrid memetic algorithm for the parallel machine scheduling problem with job deteriorating effects." IEEE Transactions on Emerging Topics in Computational Intelligence, 4(3):385-397. https://doi.org/10.1109/TETCI.2019.2935773