Application of NBS for a Negotiable Third-Party Scheduling Problem with a Due-Window

摘要

Nash Bargaining Solution (NBS) is a solution scheme for a specific bargaining situation in which two players bargain over the partition of a valuable object (O). This paper considers an application of NBS to a negotiable third-party scheduling problem, where a producer (second-party) receives a number of jobs from a customer (first-party), and has to seek another producer (third-party) to complete this task together due to insufficient processing capacity. The two producers bargain on the partition of these jobs. We develop the relevant models and algorithms for the problem.