Optimization of Dynamic Job-Shop Scheduling Based on Game Theory

Article Preview

Abstract:

To deal with uncertain dynamic interferences occurred in the workshop, and meet the competition requirements of jobs submitted by different customers, a dynamic job-shop scheduling model based on game theory is presented. In order to find the Nash equilibrium point of the model effectively, dynamic rescheduling judgment based on event-driven policy is adopted, and a hybrid genetic algorithm is designed. The case study is carried out to demonstrate the validity of above dynamic job-shop scheduling methods.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1045-1048

Citation:

Online since:

August 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] G.H. Zhou, P.Y. Jiang and G.H. Zhang: Proc. of IEEE Int. Conf. on Automation and Logistics (Jinan, China, 2007), p.1868.

Google Scholar

[2] L. Chruch, U. Reha: International Journal of Computer Integrated Manufacturing, Vol. 55 (1992), p.153.

Google Scholar

[3] Y.S. Son, R. Baldick: IEEE Transaction on Evolutionary Computation, Vol. 8 (2004), p.305.

Google Scholar

[4] G.Y. Shi: International Journal of Systems Science, Vol. 28 (1997), p.25.

Google Scholar

[5] G.H. Zhou, R. Wang, P.Y. Jiang: Journal of Xi'an Jiaotong University, Vol. 44(2010), p.35 (In Chinese).

Google Scholar