|
Q-learning algorithm performance for m-machine, n-jobs flow shop scheduling problems to minimize makespan This publication appears in: Investigacion Operacional Authors: Y. César Fonseca-Reyna, Y. Martinez Jimenez and A. Nowé Volume: 38 Issue: 3 Pages: 281-290 Publication Date: Jan. 2017
Abstract: Flow Shop Scheduling Problems circumscribes an important class of sequencing problems in the field of production planning. The problem considered here is to find a permutation of jobs to be sequentially processed on a number of machines under the restriction that the processing of each job has to be continuous with respect to the objective of minimizing the completion time of all jobs, known in literature as makespan or Cmax. This problem is as NP-hard, it is typical of combinatorial optimization and can be found in manufacturing environments, where there are conventional machines-tools and different types of pieces which share the same route. The following research presents a Reinforcement Learning algorithm known as Q-Learning to solve problems of the Flow Shop category. This algorithm is based on learning an action-value function that gives the expected utility of taking a given action in a given state where an agent is associated to each of the resources. To validate the quality of the solutions, test cases of the specialized literature are used and the results obtained are compared with the reported optimal results.
|
