Two-Person Cooperative Games on Total Completion Time Scheduling with Changeable Processing Time
JIN Ji
Abstract：This paper studies two-person Nash bargaining problem,in which job processing time depends on its start time,each person is equipped with one machine and the processing cost is defined as minimized total completion time.It focuses on how to divide the jobs reasonably in order to make every participant satisfied with cooperation profit.
Keywords：schedulinggamecooperationprofitprocessing timelinear function
Publication Date：2013-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：6( 35-39,74 )