Minimizing the Worst Slowdown: Off-Line and On-Line

Herve Moulin

Working Papers from Rice University, Department of Economics

Abstract: Minimizing the slowdown (expected sojourn time divided by job size) is a key concern of fairness in scheduling and queuing problems where job sizes are very heterogeneous. We look for protocols (service disciplines) capping the worst slowdown (called here liability) a job may face no matter how large (or small) the other jobs are. In the scheduling problem (all jobs released at the same time), allowing the server to randomize the order of service cuts almost in half the liability profiles feasible under deterministic protocols. The same statement holds if cash transfers are feasible and users have linear waiting costs.

Date: 2005-04
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.ruf.rice.edu/~econ/papers/2005papers/slowdn6.pdf

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ecl:riceco:2005-03

Access Statistics for this paper

More papers in Working Papers from Rice University, Department of Economics Contact information at EDIRC.
Bibliographic data for series maintained by ().