NON-COOPERATION GAME FOR CUSTOMER’S COMPETITION DRIVEN JOB SCHEDULE

ZHOU Guanghui^{1, 2}  JIANG Pingyu^{1, 2}  HUANG Guoquan³

(1. State Key Laboratory for Manufacturing Systems Engineering, Xi’an Jiaotong University, Xi’an 710049;

2. School of Mechanical Engineering, Xi’an Jiaotong University, Xi’an 710049;

3. Department of Industrial and Manufacturing Systems Engineering, University of Hong Kong, Hong Kong, China) 

Abstract: From the perspective of viewing customer’s competition requirements and on the basis of analyzing the goal of each manufacturing task submitted by correspondent customer maximizing its own payoffs (mainly focusing on the finishing time of each manufacturing task), together with the deficiency of traditional strategies, methods and models of task schedule, a non-cooperation game model with complete information for task schedule is presented and established. In this task scheduling model, the players correspond to the jobs submitted respectively by related customers, the strategies of each job correspond to the selectable geographical distributive machines related to the processes of this job, and the payoff of each job is defined as the reciprocal of its finishing time. As such, obtaining the optimal scheduling results is determined by the Nash equilibrium (NE) point of this game. In order to find the NE point, genetic algorithm is introduced. A numerical case study is given to demonstrate the feasibility of above methods.

Key words: Task schedule   Non-cooperative game  Nash equilibrium point  Genetic algorithm

CLC No: TP273

机械制造系统工程国家重点实验室开放课题研究基金和教育部新世纪优秀人才支持计划资助项目(NCET-04-0928). Received 20050715, received in revised form 20060205