Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Dynamic parallel machine scheduling with random breakdowns using the learning agent

Dynamic parallel machine scheduling with random breakdowns using the learning agent Agent technology has been widely applied in the manufacturing process due to its flexibility, autonomy, and scalability. In this paper, the learning agent is proposed to solve a problem which considers random breakdowns. The duty of the agent, which is based on the Q-learning algorithm, is to dynamically assign arriving jobs to idle machines according to the current state of its environment. A state-action table involving machine breakdowns is constructed to define the state of the agent's environment. Three rules, including SPT (Shortest Processing Time), EDD (Earliest Due Date) and FCFS (First Come First Served), are used as actions of the agent, and the -greedy policy is adopted by the agent to select an action. In the simulation experiment, two different objectives, including minimising the maximum lateness and minimising the percentage of tardy jobs, are utilised to validate the ability of the learning agent. The results demonstrate that the proposed agent is suitable for the complex parallel machine environment. Keywords: parallel machine; dynamic scheduling; reinforcement learning; Qlearning; learning agent; machine breakdowns. Reference to this paper should be made as follows: Yuan, B., Jiang, Z. and Wang, L. (2016) ` with random breakdowns using the learning agent', Int. J. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Services Operations and Informatics Inderscience Publishers

Dynamic parallel machine scheduling with random breakdowns using the learning agent

Loading next page...
 
/lp/inderscience-publishers/dynamic-parallel-machine-scheduling-with-random-breakdowns-using-the-2CNxYtwUFI
Publisher
Inderscience Publishers
Copyright
Copyright © 2016 Inderscience Enterprises Ltd.
ISSN
1741-539X
eISSN
1741-5403
DOI
10.1504/IJSOI.2016.080083
Publisher site
See Article on Publisher Site

Abstract

Agent technology has been widely applied in the manufacturing process due to its flexibility, autonomy, and scalability. In this paper, the learning agent is proposed to solve a problem which considers random breakdowns. The duty of the agent, which is based on the Q-learning algorithm, is to dynamically assign arriving jobs to idle machines according to the current state of its environment. A state-action table involving machine breakdowns is constructed to define the state of the agent's environment. Three rules, including SPT (Shortest Processing Time), EDD (Earliest Due Date) and FCFS (First Come First Served), are used as actions of the agent, and the -greedy policy is adopted by the agent to select an action. In the simulation experiment, two different objectives, including minimising the maximum lateness and minimising the percentage of tardy jobs, are utilised to validate the ability of the learning agent. The results demonstrate that the proposed agent is suitable for the complex parallel machine environment. Keywords: parallel machine; dynamic scheduling; reinforcement learning; Qlearning; learning agent; machine breakdowns. Reference to this paper should be made as follows: Yuan, B., Jiang, Z. and Wang, L. (2016) ` with random breakdowns using the learning agent', Int. J.

Journal

International Journal of Services Operations and InformaticsInderscience Publishers

Published: Jan 1, 2016

There are no references for this article.