Learning policies for single machine job dispatching

Yi-Chi Wang

doi:10.1016/j.rcim.2004.07.003

Learning policies for single machine job dispatching

2004-12-01

38

PRE

AI

DOI：10.1016/j.rcim.2004.07.003

Original

Original request for help

Save

Abstract

En 中文

Reinforcement learning (RL) has received some attention in recent years from a,gent-based researchers because it deals with the problem of how an autonomous agent can learn to select proper actions for achieving its goals through interacting with its environment. Each time after an agent performs an action, the environment's response, as indicated by its new state, is used by the agent to reward or penalize its action. The agent's goal is to maximize the total amount of reward it receives over the long run. Although there have been several successful examples demonstrating the usefulness of RL, its application to manufacturing systems has not been fully explored. In this study, a single machine agent employs the Q-learning algorithm to develop a decision-making policy on selecting the appropriate dispatching rule from among three given dispatching rules. The system objective is to minimize mean tardiness. This paper presents a factorial experiment design for studying the settings used to apply Q-learning to the single machine dispatching rule selection problem. The factors considered in this study include two related to the agent's policy table design and three for developing its reward function. This study not only investigates the main effects of this Q-learning application but also provides recommendations for factor settings and useful guidelines for future applications of Q-learning to agent-based production scheduling. (C) 2004 Elsevier Ltd. All rights reserved.

Keywords:

reinforcement learning

Q-learning algorithm

dispatching rule selection

Learning policies for single machine job dispatching

Abstract

AI Summary

Journal

Organization