Q-learning algorithm performance for M-machine, N-jobs flow shop scheduling problems to minimize makespan (Q5154491)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Q-learning algorithm performance for M-machine, N-jobs flow shop scheduling problems to minimize makespan |
scientific article; zbMATH DE number 7406268
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Q-learning algorithm performance for M-machine, N-jobs flow shop scheduling problems to minimize makespan |
scientific article; zbMATH DE number 7406268 |
Statements
5 October 2021
0 references
flow-shop
0 references
makespan
0 references
optimization
0 references
scheduling
0 references
Q-learning
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8999017477035522
0 references
0.8080959916114807
0 references
0.755466103553772
0 references
0.7512353658676147
0 references
