Abstract
We study parallel-machine scheduling games with deteriorating jobs. The processing time of a job increases proportionally with its starting time by a positive deterioration rate. Each job acts selfishly aiming to minimize its completion time while choosing a machine on which it will be processed. Machines are equipped with coordination mechanisms to diminish chaos caused by jobs’ competition. We consider three coordination mechanisms in this paper, namely Smallest Deterioration Rate first, Largest Deterioration Rate first and MAKESPAN policy. Under these mechanisms, we precisely quantify the inefficiency of their Nash Equilibriums by investigating the Price of Anarchy (PoA) and the Price of Stability (PoS), concerning minimization of social costs including the makespan and the total machine load. By using some new methods, we obtain parametrical bounds on the PoA and PoS, and demonstrate that most of these bounds are tight.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
