Genetic reinforcement learning approach to the machine scheduling problem

Abstract

This paper focuses on the development of a learning-based heuristic for the machine scheduling problem, which automatically captures the search control knowledge or the common features of good schedules while generating a number of schedules. Defining states and actions of the machine shop, the machine scheduling problem is transformed into a problem of reinforcement learning (RL) in which a learner or a scheduler will learn to select the right action at each state of the machine shop, using the reward from a schedule evaluator for executing the action. Implementing the proposed reinforcement learning with a genetic algorithm results in the genetic reinforcement learning (GRL) approach to the machine scheduling problem. Although the learning-based heuristic has the overhead of acquiring knowledge on the problem, it can be easily adapted for a wide variety of machine scheduling problems due to the weak dependence on the problem structures and objectives. A GRL-based scheduler, called EVIS (Evolutionary Intracell Scheduler), has been developed and applied to various classes of machine scheduling problems, such as the job-shop scheduling, the flow-shop scheduling and the open-shop scheduling problems, and even the processor scheduling problem, the performance evaluation of EVIS with a number of different problem instances has shown that the learning-based heuristic is robust and its performance is comparable with that of other problem-specific heuristics or search-oriented heuristics in the quality of solutions.