Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH
 QUICK SEARCH:   [advanced]


     


OPERATIONS RESEARCH,
Published online in Articles in Advance, October 28, 2009
DOI: 10.1287/opre.1090.0732
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Google Scholar
Right arrow Articles by Heydenreich, B.
Right arrow Articles by Uetz, M.

Mechanism Design for Decentralized Online Machine Scheduling

Birgit Heydenreich, Rudolf Müller, Marc Uetz

Department of Quantitative Economics, Maastricht University, 6200 MD Maastricht, The Netherlands
Department of Quantitative Economics, Maastricht University, 6200 MD Maastricht, The Netherlands
Department of Applied Mathematics, University of Twente, 7500 AE Enschede, The Netherlands

birgit.heydenreich{at}gmail.com
r.muller{at}maastrichtuniversity.nl
m.uetz{at}utwente.nl

Traditional optimization models assume a central decision maker who optimizes a global system performance measure. However, problem data is often distributed among several agents, and agents make autonomous decisions. This gives incentives for strategic behavior of agents, possibly leading to suboptimal system performance. Furthermore, in dynamic environments, machines are locally dispersed and administratively independent. Examples are found both in business and engineering applications. We investigate such issues for a parallel machine scheduling model where jobs arrive online over time. Instead of centrally assigning jobs to machines, each machine implements a local sequencing rule and jobs decide for machines themselves. In this context, we introduce the concept of a myopic best-response equilibrium, a concept weaker than the classical dominant strategy equilibrium, but appropriate for online problems. Our main result is a polynomial time, online mechanism that—assuming rational behavior of jobs—results in an equilibrium schedule that is 3.281-competitive with respect to the maximal social welfare. This is only slightly worse than state-of-the-art algorithms with central coordination.

Subject classifications: online machine scheduling; total weighted completion time; decentralization; mechanism design; competitive equilibrium.
History: Received February 2007; revision received April 2008; accepted December 2008.







HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH
Copyright © 2009 by INFORMS.