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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
