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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Flexible services and manufacturing journal Ročník 35; číslo 2; s. 548 - 571
Hlavní autoři:	Saqlain, M., Ali, S., Lee, J. Y.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.06.2023 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!