Abstract
The job scheduling problem is a classic operations research problem in which agents have jobs to be executed by machines in given time slots, with each machine being able to process only one job at a time. We study this problem using cooperative game theory, focusing on how to divide the minimum cost (of executing all jobs) between the agents. First, we characterize the set of stable allocations, which all charge only users whose jobs are executed in peak-demand time periods. Second, we introduce a number of natural properties that allow to split the cost in a fair and consistent way. Using these desirable properties, we offer axiomatizations for two cost sharing methods that stand out: the peak-demand rule and the peak-interval rule.
Sign-in/Register to access full text options 
Free) 
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 call
