To meet the competition requirements of jobs submitted by different customers in job-shop scheduling
taking the maximal profit of each job as the scheduling objective
a non-cooperation game model is proposed. In this job-shop scheduling game model
the players correspond to the jobs submitted by related customers
the strategies of each job correspond to the alternative machines related to operations of this job
and the payoff of each job is defined as the weighted composite of finishing time and cost. Therefore
obtaining the optimal scheduling results is determined by the Nash equilibrium point of this non-cooperation game. To find the Nash equilibrium point efficiently
a hybrid adaptive genetic algorithm based on hill-climbing method is designed as well as the adaptive crossover operator and mutation operator. A numerical case study demonstrates the validity of the job-shop scheduling strategy.
关键词
Keywords
references
JIANG Pingyu, ZHOU Guanghui, ZHAO Gang, et al. E-2-MES: an e-service-driven networked manufacturing platform for extended enterprises [J]. International Journal of Computer Integrated Manufacturing, 2007, 20(2/3): 127-142.
ZHOU Guanghui, JIANG Pingyu, ZHANG Guohai. Game theoretical framework for process plan decision of jobs in networked manufacturing [C]∥Proceedings of the IEEE International Conference on Automation and Logistics. Piscataway, NJ USA: IEEE, 2007: 1868-1873.
SAKAWA M, MORI T. An efficient genetic algorithm for job-shop scheduling problems with fuzzy processing time and fuzzy due date [J]. Computers Industrial Engineering, 1999, 36(2): 325-341.
MATTFELD D C,BIERWIRTH C. An efficient genetic algorithm for job shop scheduling with tardiness objectives [J]. European Journal of Operational Research,2004,155(3): 616-630.
YUN Y S. Genetic algorithm with fuzzy logic controller for preemptive and non-preemptive job-shop scheduling problems [J]. Computers Industry Engineering, 2002, 43(3): 623-644.
KIM B H. A new game-theoretic framework for maintenance strategy analysis [J]. IEEE Transactions on Power Systems, 2003, 18(2): 698-706.
ALI R Y. An effective hybrid immune-hill climbing optimization approach for solving design and manufacturing optimization problems in industry[J]. Journal of Materials Processing Technology, 2009, 209(6): 2773-2780.
WANG Xiyuan, WANG Xili. Improve and implement a heuristic search technique-hill-climbing [J]. Journal of Shaanxi Normal University(Natural Science Edition), 1999,27(1): 58-65.
ZHOU Guanghui, ZHANG Guohai, WANG Rui, et al. Dynamic job scheduling method based on real-time production information for manufacturing cell [J]. Journal of Xi'an Jiaotong University, 2009, 43(11): 56-60.
SRINIVAS M, PATNAIK L M. Adaptive probabilities of crossover and mutation in genetic algorithm [J]. IEEE Trans on Systems, Man and Cybernetics, 1994,24(4):656-667.