Coordination mechanisms with hybrid local policies

Document Type

Article

Publication Date

11-1-2011

Abstract

We study coordination mechanisms for scheduling n jobs on m parallel machines where agents representing the jobs interact to generate a schedule. Each agent acts selfishly to minimize the completion time of his/her own job, without considering the overall system performance that is measured by a central objective. The performance deterioration due to the lack of a central coordination, the so-called price of anarchy, is determined by the maximum ratio of the central objective function value of an equilibrium schedule divided by the optimal value. In the first part of the paper, we consider a mixed local policy with some machines using the SPT rule and other machines using the LPT rule. We obtain the exact price of anarchy for the problem of minimizing the makespan and some bounds for the problem of minimizing the total completion time. In the second part of the paper, we consider parallel machine scheduling subject to eligibility constraints. We devise new local policies based on the flexibilities and the processing times of the jobs. We show that the newly devised local policies outperform both the SPT and the LPT rules. © 2011 Elsevier B.V. All rights reserved.

Identifier

80054701710 (Scopus)

Publication Title

Discrete Optimization

External Full Text Location

https://doi.org/10.1016/j.disopt.2011.05.001

ISSN

15725286

First Page

513

Last Page

524

Issue

4

Volume

8

Grant

0969830

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS