文章基本信息

标题：Truthful Prompt Scheduling for Minimizing Sum of Completion Times
本地全文：下载
作者：Alon Eden ; Michal Feldman ; Amos Fiat 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2018
卷号：112
页码：1-14
DOI：10.4230/LIPIcs.ESA.2018.27
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：We give a prompt online mechanism for minimizing the sum of [weighted] completion times. This is the first prompt online algorithm for the problem. When such jobs are strategic agents, delaying scheduling decisions makes little sense. Moreover, the mechanism has a particularly simple form of an anonymous menu of options.
关键词：Scheduling; Mechanism design; Online algorithms