Bargaining and Scheduling of a Set of Jobs between Two Manufacturers
Co-authorQuanle Chen*, and Yongjian Li**
*Department of Systems Engineering & Engineering Management. The Chinese University of Hong Kong Shatin, N.T., Hong Kong **School of Business, Nankai University Tianjin, P.R. ChinaAlessandro Agnetis, Dario Pacciarelli, Ameur Soukhal, Nguyen Huynh Tuong
We consider a class of scheduling problems where two manufacturers have jointly secured a set of jobs. Each job may bring a certain profit to the party who processes it, subject to a number of constraints including due date and resource constraints. The two parties are facing the problem of how to split the jobs into two subsets, to be undertaken by each of them respectively. The job partition must be fair and mutually beneficial, based on the requirements of the job processing, the resource availability of the two parties, and the level of efforts of the two parties in securing the jobs. We establish a model to address the problem, based on the Nash Bargaining theory. Algorithms to determine the job partition and scheduling solutions are developed.