Investigating the Monte-Carlo Tree Search approach for the job shop scheduling problem
The Job Shop Scheduling Problem (JSSP) is a well-known optimization problem in manufacturing, where the goal is to determine the optimal sequence of jobs across different machines to minimize a given objective. In this work, we focus on minimizing the weighted sum of job completion times. We explore...
محفوظ في:
| المؤلفون الرئيسيون: | , , |
|---|---|
| التنسيق: | Artigo |
| اللغة: | Inglês |
| منشور في: |
Elsevier
2025-01-01
|
| سلاسل: | EURO Journal on Computational Optimization |
| الموضوعات: | |
| الوصول للمادة أونلاين: | http://www.sciencedirect.com/science/article/pii/S2192440625000152 |
| الوسوم: |
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|