Multi objective dynamic job shop scheduling using composite dispatching rule and reinforcement learning

1Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

The applications of composite dispatching rules for multi objective dynamic scheduling have been widely studied in literature. In general, a composite dispatching rule is a combination of several elementary dispatching rules, which is designed to optimize multiple objectives of interest under a certain scheduling environment. The relative importance of elementary dispatching rules is modeled by weight factors. A critical issue for implementation of composite dispatching rule is that the inappropriate weight values may result in poor performance. This paper presents an offline scheduling knowledge acquisition method based on reinforcement learning using simulation technique. The scheduling knowledge is applied to adjust the appropriate weight values of elementary dispatching rules in composite manner with respect to work in process fluctuation of machines during online scheduling. Implementation of the proposed method in a two objectives dynamic job shop scheduling problem is demonstrated and the results are satisfactory. © 2011 The Institute of Electrical Engineers of Japan.

Cite

CITATION STYLE

APA

Chen, X., Lin, H. W., Hao, X. C., & Murata, T. (2011). Multi objective dynamic job shop scheduling using composite dispatching rule and reinforcement learning. IEEJ Transactions on Electronics, Information and Systems, 131(6), 1241–1249. https://doi.org/10.1541/ieejeiss.131.1241

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free