By Topic

Dynamic single machine scheduling using Q-learning agent

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Lian-fang Kong ; Coll. of Electr. Power Eng., South China Univ. of Technol., Guangzhou, China ; Jie Wu

Single machine scheduling methods have attracted a lot of attentions in recent years. Most dynamic single machine scheduling problems in practice have been addressed using dispatching rules. However, no single dispatching rule has been found to perform well for all important criteria, and no rule takes into account the status or the other resources of system's environment. In this research, an intelligent agent-based single machine scheduling system is proposed, where the agent is trained by a new improved Q-learning algorithm. In such scheduling system, agent selects one of appropriate dispatching rules for machine based on available information. The agent was trained by a new simulated annealing-based Q-learning algorithm. The simulation results show that the simulated annealing-based Q-learning agent is able to learn to select the best dispatching rule for different system objectives. The results also indicate that simulated annealing-based Q-learning agent could perform well for all criteria, which is impossible when using only one dispatching rule independently.

Published in:

Machine Learning and Cybernetics, 2005. Proceedings of 2005 International Conference on  (Volume:5 )

Date of Conference:

18-21 Aug. 2005