Reinforcement learning approaches for the parallel machines job shop scheduling problem

Yailen Martinez Jimenez, Wauters Tony, Ann Nowe, De Causmaecker Patrick, Katja Verbeeck

    Research output: Chapter in Book/Report/Conference proceedingConference paper

    Abstract

    This paper addresses the application of AI techniques in a practical OR problem, i.e. scheduling. Scheduling is a scientific domain concerning the allocation of tasks to a limited set of resources over time. The goal of scheduling is to maximize (or minimize) different optimization criteria such as the makespan (i.e. the completion time of the last operation in the schedule), the occupation rate of a machine or the total tardiness. In this area, the scientific community usually classifies the problems according to the characteristics of the systems studied. Important characteristics are: the number of machines available (one machine, parallel machines), the shop type (Job Shop, Open Shop or Flow Shop), the job characteristics (such as preemption allowed or not, equal processing times or not) and so on [1]. In this work we present two Reinforcement Learning approaches for the Parallel Machines Job Shop Scheduling Problem (JSP-PM).
    Original languageEnglish
    Title of host publicationProceedings of the International conference on interdisciplinary research on technology, education and communication, itec2010
    Number of pages2
    Publication statusPublished - May 2010
    EventInternational conference on interdisciplinary research on technology, education and communication - , Belgium
    Duration: 23 May 201029 May 2010

    Publication series

    NameProceedings of the International conference on interdisciplinary research on technology, education and communication, itec2010

    Conference

    ConferenceInternational conference on interdisciplinary research on technology, education and communication
    Abbreviated titleitec2010
    Country/TerritoryBelgium
    Period23/05/1029/05/10

    Keywords

    • Reinforcement Learning
    • Parallel Machines Job Shop Scheduling

    Fingerprint

    Dive into the research topics of 'Reinforcement learning approaches for the parallel machines job shop scheduling problem'. Together they form a unique fingerprint.

    Cite this