Author:
Liu Lili,Gu Yanhong,Ren Han,Tang Guochun
Abstract
Abstract
This paper considers the problem of two-person cooperative games on minimizing the makespan. A special case of this problem is proved NP-hard, and a dynamic programming algorithm is presented for the general case, which runs in pseudo-polynomial time and indicates that this problem is binary NP-hard. This paper also adopts List Scheduling (LS) and Longest Processing Time (LPT) algorithms for classical parallel machines scheduling problem to cooperative game problem and develops the performance ratios of the algorithms.
Subject
General Physics and Astronomy
Reference5 articles.
1. The bargaining problem [J];John;Econometrica,1950
2. Two person cooperative games [J];John;Econometrica,1953
3. Optimization and approximation in deterministic sequencing and scheduling: A survey [J];Ronald;ADM,1979
4. Maximum lateness scheduling problem on two-person cooperative games [J];Yanhong;Journal of Combinatorial Optimization,2013
5. Two-person cooperative games on makespan scheduling [J];Ji;Journal of Shanghai Second Polytechnic University,2011