Reinforcement Learning approaches for the Parallel Machines Job Shop Scheduling Problem

Yailen Martinez Jimenez, Wauters Tony, Ann Nowe, Katja Verbeeck, De Causmaecker Patrick, Juliett Suarez, Rafael Bello

    Onderzoeksoutput: Conference paper

    Samenvatting

    This paper presents two Reinforcement Learning approaches for the Parallel Machines Job Shop Scheduling Problem. This NP-hard optimization problem where operations have to be assigned to machines of different workcenters, each workcenter having a number of identical parallel machines, is hard to solve and is therefore tackled with learning based methods. The objective used is the minimization of the schedule makespan. Two viewpoints are taken, one where resources are intelligent agents and have to choose what operation to process next, and another where operations themselves are seen as the agents that have to choose their mutual scheduling order. As Reinforcement Learning methods we use a value iteration method (Q-Learning) and a policy iteration method
    (Learning Automata). The results of both approaches improve on recent published results from the literature.
    Originele taal-2English
    TitelProceedings of the Cuba-Flanders Workshop on Machine Learning and Knowledge Discovery
    StatusPublished - feb 2010

    Publicatie series

    NaamProceedings of the Cuba-Flanders Workshop on Machine Learning and Knowledge Discovery

    Vingerafdruk

    Duik in de onderzoeksthema's van 'Reinforcement Learning approaches for the Parallel Machines Job Shop Scheduling Problem'. Samen vormen ze een unieke vingerafdruk.

    Citeer dit