EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Learn to optimise for job shop scheduling: a survey with comparison between genetic programming and reinforcement learning

Meng Xu, Yi Mei, Fangfang Zhang, Mengjie Zhang

Artificial Intelligence Review · 15.03.2025 · 58 (6)

DOI: 10.1007/s10462-024-11059-9 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Artificial Intelligence Review, online erschienen am 15.03.2025. Verfasst von Meng Xu und 3 weiteren Autor:innen. Die Arbeit wurde bisher 34-mal zitiert (Crossref) und nennt 267 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Victoria University of Wellington.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Job shop scheduling holds significant importance due to its relevance and impact on various industrial and manufacturing processes. It involves dynamically assigning and sequencing jobs to machines in a flexible production environment, where job characteristics, machine availability, and other factors might change over time. Genetic programming and reinforcement learning have emerged as powerful approaches to automatically learn high-quality scheduling heuristics or directly optimise sequences of specific job-machine pairs to generate efficient schedules in manufacturing. Existing surveys on job shop scheduling typically provide overviews from a singular perspective, focusing solely on genetic programming or reinforcement learning, but overlook the hybridisation and comparison of both approaches. This survey aims to bridge this gap by reviewing recent developments in genetic programming and reinforcement learning approaches for job shop scheduling problems, providing a comparison in terms of the learning principles and characteristics for solving different kinds of job shop scheduling problems. In addition, this survey identifies and discusses current issues and challenges in the field of learning to optimise for job shop scheduling. This comprehensive exploration of genetic programming and reinforcement learning in job shop scheduling provides valuable insights into the learning principles for optimising different job shop scheduling problems. It deepens our understanding of recent developments, suggesting potential research directions for future advancements.

Förderung

  • Victoria University of Wellington

Zitieren

APA

Xu, M., Mei, Y., Zhang, F., & Zhang, M. (2025). Learn to optimise for job shop scheduling: a survey with comparison between genetic programming and reinforcement learning. Artificial Intelligence Review, 58(6). https://doi.org/10.1007/s10462-024-11059-9

Vancouver

Xu M, Mei Y, Zhang F, Zhang M. Learn to optimise for job shop scheduling: a survey with comparison between genetic programming and reinforcement learning. Artificial Intelligence Review. 2025;58(6). doi:10.1007/s10462-024-11059-9

BibTeX
@article{Xu2025,
  author = {Xu, Meng and Mei, Yi and Zhang, Fangfang and Zhang, Mengjie},
  title = {Learn to optimise for job shop scheduling: a survey with comparison between genetic programming and reinforcement learning},
  journal = {Artificial Intelligence Review},
  year = {2025},
  volume = {58},
  number = {6},
  doi = {10.1007/s10462-024-11059-9}
}
Kostenlos starten →