Improved Q‐learning algorithm for solving permutation flow shop scheduling problems
Abstract Generally, scheduling problems refer to allocation of available shared resources and the sorting of production tasks, in order to satisfy the specified performance target within a certain time. The fundamental scheduling problem is that all jobs need to be processed on the same route, which...
| Main Authors: | , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-03-01
|
| Series: | IET Collaborative Intelligent Manufacturing |
| Subjects: | |
| Online Access: | https://doi.org/10.1049/cim2.12042 |