Sciweavers

1292 search results - page 14 / 259
» Revisiting the optimal scheduling problem
Sort
View
FCS
2008
13 years 10 months ago
Autonomous Scheduling
Abstract. Autonomous scheduling deals with the problem - how to enable agents to schedule a set of interdependent tasks in such a way that whatever schedule they choose for their t...
Chetan Yadati, Cees Witteveen, Yingqian Zhang, Men...
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 5 months ago
On Optimal Single-Item Auctions
We revisit the problem of designing the profit-maximizing single-item auction, solved by Myerson in his seminal paper for the case in which bidder valuations are independently dis...
Christos H. Papadimitriou, George Pierrakos
GECCO
2000
Springer
141views Optimization» more  GECCO 2000»
14 years 1 days ago
A steady-state evolutionary algorithm for the job shop problem
This paper describes an evolutionary search scheduling algorithm (ESSA) for the job shop scheduling problem (JSSP). If no specific knowledge of the problem is included in the EA t...
Patrick van Bael, Dirk Devogelaere, Marcel Rijckae...
IJCAI
2003
13 years 9 months ago
Contract Algorithms and Robots on Rays: Unifying Two Scheduling Problems
We study two apparently different, but formally similar, scheduling problems. The first problem involves contract algorithms, which can trade off run time for solution quality, a...
Daniel S. Bernstein, Lev Finkelstein, Shlomo Zilbe...
AI
2010
Springer
13 years 8 months ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...