Improved Q‐learning algorithm for solving permutation flow shop scheduling problems
Improved Q‐learning algorithm for solving permutation flow shop scheduling problems
About this item
Full title
Author / Creator
Publisher
Wuhan: John Wiley & Sons, Inc
Journal title
Language
English
Formats
Publication information
Publisher
Wuhan: John Wiley & Sons, Inc
Subjects
More information
Scope and Contents
Contents
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 is called flow shop scheduling problems (FSSP). The goal o...
Alternative Titles
Full title
Improved Q‐learning algorithm for solving permutation flow shop scheduling problems
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_doaj_primary_oai_doaj_org_article_657f57d1e3b8437c8ff6353414a89000
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_doaj_primary_oai_doaj_org_article_657f57d1e3b8437c8ff6353414a89000
Other Identifiers
ISSN
2516-8398
E-ISSN
2516-8398
DOI
10.1049/cim2.12042
