A Monte-Carlo tree search algorithm for the flexible job-shop scheduling in manufacturing systems

Flexible job-shop scheduling problem (FJSP) is an extension of the simple JSP with additional features of routing flexibility. It is an essential class of sequencing and planning problems that can apply in many real-life applications, especially in the field of manufacturing systems and production m...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Flexible services and manufacturing journal Jg. 35; H. 2; S. 548 - 571
Hauptverfasser:	Saqlain, M., Ali, S., Lee, J. Y.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.06.2023 Springer Nature B.V
Schlagworte:	Algorithms Completion time Engineering HyperText Markup Language Job shop scheduling Machines Manufacturing Operations Management Operations Research/Decision Theory Performance evaluation Processes Production management Production scheduling Scheduling Search algorithms Flexible job-shop scheduling Production scheduling Monte-Carlo tree search Reinforcement learning Smart manufacturing
ISSN:	1936-6582, 1936-6590
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!