The Over-Constrained Scheduling Model (OCSM) is introduced as a way to accommodate negotiation in over-constrained, distributed scheduling problems. The OCSM is appropriate for negotiation among a group of peers and is also applicable to a manager that must balance conflicting views of its workers. The distributed scheduling algorithm that is used selects a candidate from the priority list of resource requests and inserts that candidate into the evolving timetable. Two protocols are required. The minimax protocol assures equitable power among the peers. The bumping protocol allows reactive scheduling by using a request's total worth to dictate when a new request can seize a previously assigned resource. A request's total worth is the sum of its priority value, its ordering value, and any bonus points received by previous negotiations. Three styles of negotiation are examined: unilateral, verbose, and periodic. Results from sample scenarios are also presented
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.