A Game Theoretic Approach to Job Shop Scheduling

Wen Rui Jiang; Cong Lu; Fang Zhen Li

doi:10.4028/www.scientific.net/AMM.66-68.960

Paper Titles

Numerical Analysis of Ground Vibration Induced by High-Speed Train on Viaduct
p.937

Study on the Rapid Design and Optimization Technology of Forklift Styling
p.944

Study on the Serial Design of Chain Wheel of the Roller Chain Based on Pro/E
p.950

Effect of Gas Nitriding on CO₂ Corrosion Behavior of 40Cr Steel
p.956

A Game Theoretic Approach to Job Shop Scheduling
p.960

Hybrid Particle Swarm Algorithm for Solving Multiprocessor Problem
p.966

Study on Enterprise Network Based on B2B Website Platform
p.973

Accident Warning and Fast Reaction in Emergency Management of Manufacturing Enterprises
p.978

Non-Invasive Test of Soft Tissue for Tissue Reaction in Needle Biopsy
p.983

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 66-68A Game Theoretic Approach to Job Shop Scheduling

A Game Theoretic Approach to Job Shop Scheduling

Abstract:

This paper proposes a non-cooperative game approach based on neural network (GMBNN) to solve the job shop scheduling problem. Machines in manufacturing task are defined as players and strategies consist of all the feasible programs which are selected by dispatching rules for minimizing the mean flowtime. Strategies for the game model are generated from a backpropagation neural network, which selects combination of the rules for the machines. Case study shows that the GMBNN can be an effective approach to solve the job shop scheduling problem.

You might also be interested in these eBooks

Mechanical, Materials and Manufacturing Engineering

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 66-68)

Pages:

960-965

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.66-68.960

Citation:

Cite this paper

Online since:

July 2011

Authors:

Wen Rui Jiang, Cong Lu, Fang Zhen Li

Keywords:

Dispatching Rule, Game Theory, Job Shop Scheduling, Neural Network (NN)

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Y. P. FOO, Y. Takefuji: Stochastic neural networks for solving job-shop scheduling: Parts 1. problem representation [A]. Proceedings of the IEEE International Conference on Neural Networks (1988), pp.275-282.

DOI: 10.1109/icnn.1988.23939

Google Scholar

[2] W. L. Wang and Q. D. Wu: A new method solving job shop scheduling problems based on hopfield neural networks. CIMS, Vol. 7, No. 12 (2001), pp.7-12.

Google Scholar

[3] G. Mosheiov, D. Oron: A note on the SPT heuristic for solving scheduling problems with generalized due dates. Computers & Operations Research, Vol. 31, No. 5 (2004), pp.645-655.

DOI: 10.1016/s0305-0548(03)00018-2

Google Scholar

[4] J. M. Framinan, M. S. Nagano, Joao Vitor Mocellin: An efficient heuristic for total flowtime minimization in no-wait flowshops. Int J Adv Manuf Technol, Vol. 46 (2010), pp.1049-1057.

DOI: 10.1007/s00170-009-2154-0

Google Scholar

[5] G. Zhou, R. Wang, P. Jiang, G. Zhang: Non-cooperation game model and hybrid adaptive genetic algorithm for job-shop scheduling. Journal of Xi'an Jiaotong University, Vol. 44, No. 5 (2010), pp.35-39.

Google Scholar

[6] G. Zhou, P. Jiang and G. Zhang: Game theoretical framework for process plan decision of jobs in networked manufacturing. Proceedings of the IEEE International Conference on Automation and Logistics (2007), pp.1868-1873.

DOI: 10.1109/ical.2007.4338878

Google Scholar

[7] B. H. Kim: A new game-theoretic framework for maintenance strategy analysis. IEEE Transactions on Power Systems, Vol. 18, No. 2 (2003), pp.698-706.

DOI: 10.1109/tpwrs.2003.811013

Google Scholar

[8] C. Rajendran, O. Holthaus: A comparative study of dispatching rules in dynamic flowshops and job shops. Eur J Oper Res, Vol. 116 (1999), pp.156-170.

DOI: 10.1016/s0377-2217(98)00023-x

Google Scholar