Scaling adaptive agent-based reactive job-shop scheduling to large-scale problems
Autor(en): | Gabel, T. Riedmiller, M. |
Stichwörter: | Decision making; Knowledge acquisition; Problem solving; Reinforcement learning; Search engines; Strategic planning, Dispatching strategy; Empirical evaluation; Job-shop scheduling; Large-scale problems, Scheduling | Erscheinungsdatum: | 2007 | Journal: | Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2007 | Startseite: | 259 | Seitenende: | 266 | Zusammenfassung: | Most approaches to tackle job-shop scheduling problems assume complete task knowledge and search for a centralized solution. In this work, we adopt an alternative view on scheduling problems where each resource is equipped with an adaptive agent that, independent of other agents, makes job dispatching decisions based on its local view on the plant and employs reinforcement learning to improve its dispatching strategy. We will delineate which extensions are necessary to render this learning approach applicable to job-shop scheduling problems of current standards of difficulty and present results of an adequate empirical evaluation. © 2007 IEEE. |
Beschreibung: | Conference of 2007 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2007 ; Conference Date: 1 April 2007 Through 5 April 2007; Conference Code:70215 |
ISBN: | 9781424407040 | DOI: | 10.1109/SCIS.2007.367699 | Externe URL: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-34548795271&doi=10.1109%2fSCIS.2007.367699&partnerID=40&md5=966bfb5d322c2a2298aafaa536c50bba |
Zur Langanzeige
Seitenaufrufe
2
Letzte Woche
1
1
Letzter Monat
1
1
geprüft am 18.05.2024