|Table of Contents|

Two Cooperative Game Problem on Scheduling With Linear Processing Time of Its Starting Time(PDF)

南京师范大学学报（工程技术版）[ISSN:1006-6977/CN:61-1281/TN]

Issue:
2012年04期
Page:
87-92
Research Field:
Publishing date:

Info

Title:
Two Cooperative Game Problem on Scheduling With Linear Processing Time of Its Starting Time
Author(s):
Jin Ji
Foundation Department,Suzhou Vocational University,Suzhou 215104,China
Keywords:
scheduling;  game;  cooperation; profit; maximum flow time;  linear function
PACS:
O225
DOI:
-
Abstract:
In the real world， there exist many situation where many persons need cooperate in order to complete a project． We establish a mathematical model of the problem where two persons process a batch of jobs by cooperation． Each person offers a single machine and each job with linear processing time of its starting time just needs to be processed once． If we define the minimized maximum flow time as a processing cost，determine a division of these jobs which not only considers the efficiency of each person but also embodies the fairness principle， to yield a reasonable cooperative( processing) profit allocation scheme acceptable to them．

References:

［1］ Chen Q L． A new discrete Bargaining model on job partition between two manufacturers［D］． Hongkong: The Chinese University of Hong Kong， 2006．
［2］ Nash J F． The bargaining problem［J］． Econometrica， 1950， 18( 2) : 155-162．
［3］ Nash J F． Two person cooperative games［J］． Econometrica， 1953， 21( 1) : 128-140．
［4］ Gan X B，Gu Y H，Vairaktarakis G L， et al． A scheduling problem with one producer and the bargaining counterpart with two producers［J］． Lecture Notes in Computer Science， 2007， 4614: 305-316．
［5］ Gu Y H，Chen Q L． Some Extended Knapsack Problems Involving Job Partition Between Two Parties［J］． Appl Math J Chinese Univ Ser B， 2007， 22( 3) : 366-370．
［6］ Gu Y H，Fan J，Tang G C， et al． Maximum latency scheduling problem on two-person cooperative games［J /OL］． Journal of Combinatorial Optimization，( 2011－11－16) ［2012－04－18］． http: / /www． springerlink． com/content /6mm57855x5598kv8 / fulltext． pdf．
［7］ Gu Y H，Goh M，Chen Q L，et al． A new two-party bargaining mechanism［J /OL］． Journal of Combinatorial Optimization， ( 2011－11－02) ［2012－04－18］． http: / /www． springerlink． com/content /q40684034261hh62 /fulltext． pdf．
［8］ 金霁，顾燕红，唐国春． 最大完工时间排序的两人合作博弈［J］． 上海第二工业大学学报， 2011， 28( 1) : 14-17． Jin Ji，Gu Yanhong，Tang Guochun． Two-person cooperative games on makespan scheduling［J］． Journal of Shanghai Second Polytechnic University， 2011， 28( 1) : 14-17． ( in Chinese)
［9］ 顾燕红，金霁，唐国春． 加工时间可变最大流程时间排序的纳什合作博弈［J］． 重庆师范大学学报: 自然科学版， 2012， 29 ( 4) : 18-23． Gu Yanhong， Jin Ji，Tang Guochun． Nash bargaining on maximum flow time scheduling with changeable processing time［J］． Journal of Chongqing Normal University: Natural Science Edition， 2012， 29( 4) : 18-23． ( in Chinese)
［10］ Muthoo A． Bargaining Theory With Applications［M］． Cambridge，United Kingdom: Cambridge University Press， 1999．

Memo

Memo:
-
Last Update: 2013-03-21