关键词: 排序博弈, 最大延迟, 合作收益, 效率, 公平

Abstract:

In the real activities,it is often the case that a job requires the cooperation of more than one person.In this paper,we study the case in which there are some jobs for two persons to complete by cooperation,each job requiring the same processing time and each person having only one machine used for machining.This is a two-person cooperation scheduling games with the minimum of maximum delay as the processing cost.In building the model,both the efficiency of cooperative parties and the fairness principle are considered.By determining a proper division of this batch of parts,the jobs will be distributed to two machines,and thus the corresponding cooperation income distribution is reasonable and can be accepted by both sides.Firstly this paper analyzes the existence and the number of the optimal solutions of the model.Several numerical examples are used to verify the validity of the model.

Key words: scheduling games;the maximum delay;cooperation income;efficiency;fairness