نتایج جستجو برای: scheduling mechanisms

تعداد نتایج: 602802  

Journal: :Concurrency and Computation: Practice and Experience 2016

2005
Vincenzo Auletta Roberto De Prisco Paolo Penna Giuseppe Persiano

We study the online version of the scheduling problem Q||Cmax involving selfish agents, considered by Archer and Tardos in [FOCS 2001], where jobs must be scheduled on m related machines, each of them owned by a different selfish agent. We present a general technique for transforming competitive online algorithms for Q||Cmax into truthful online mechanisms with a small loss of competitiveness. ...

2008
Birgit Heydenreich Debasis Mishra Rudolf Müller Marc Uetz

We study the design of optimal mechanisms in a setting where job-agents compete for being processed by a service provider that can handle one job at a time. Each job has a processing time and incurs a waiting cost. Jobs need to be compensated for waiting. We consider two models, one where only the waiting costs of jobs are private information (1-d), and another where both waiting costs and proc...

2008
Ask Just Jensen Kasper Hallenborg Yves Demazeau

This paper will present an agent based solution to control chemical processes in a manufacturing environment; items should undergo chemical reactions in different chemical baths to be processed by the system. Recipes for the processes only specify minimum and maximum times for each bath, and recipes depend strongly on characteristics of the item. We have applied the PACO paradigm for reactive a...

Journal: :Games and Economic Behavior 2015
Richard Cole José R. Correa Vasilis Gkatzelis Vahab S. Mirrokni Neil Olver

Article history: Received 9 October 2011 Available online 3 May 2013 JEL classification: C72 D71 D82

Journal: :Math. Oper. Res. 2012
Itai Ashlagi Shahar Dobzinski Ron Lavi

We consider the problem of designing truthful mechanisms on m unrelated machines, to minimize some optimization goal. Nisan and Ronen (1999) consider the specific goal of makespan minimization, and show a lower bound of 2, and an upper bound of m. This large gap inspired many attempts that yielded positive results for several special cases, but very partial success for the general case: the low...

2017
Jonathan Yaniv

1 Abbreviations and Notation 3

Journal: :international journal of hospital research 0
arezoo atighehchian department of management, faculty of administrative sciences and economics, university of isfahan, isfahan, iran. mohammad mehdi sepehri department of industrial engineering, tarbiat modares university, tehran. pejman shadpour hasheminejad kidney center, hospital management research center, iran university of medical sciences, tehran, iran.

background and objectives: operating room (or) scheduling is key to optimal operating room productivity. the significant uncertainty associated with surgery duration renders scheduling of surgical operation a challenging task. this paper proposes a novel computational stochastic model to optimize scheduling of surgeries with uncertain durations. the model considers various surgical operation co...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید