Structure of a simple scheduling polyhedron
Mathematical Programming: Series A and B
Scheduling to minimize average completion time: off-line and on-line algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Developments from a June 1996 seminar on Online algorithms: the state of the art
Developments from a June 1996 seminar on Online algorithms: the state of the art
Truthful Mechanisms for One-Parameter Agents
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Mechanisms for discrete optimization with rational agents
Mechanisms for discrete optimization with rational agents
Scheduling Algorithms
Fast monotone 3-approximation algorithm for scheduling related machines
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Truthful approximation mechanisms for scheduling selfish related machines
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
On designing truthful mechanisms for online scheduling
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
A monotone approximation algorithm for scheduling with precedence constraints
Operations Research Letters
| Hi-index | 0.00 |
We provide a general scheme for constructing monotone algorithms for a wide class $\mathcal{C}$ of scheduling problems Q|prec,r j |γ on related machines with precedence constraints and/or release dates. Our scheme works in the offline and the online setting. It takes as input two approximation/competitive algorithms for the (simpler) scheduling problems P|prec,r j |γ on identical machines and 1|prec,r j |γ on a single machine and then generically constructs a monotone approximation/ competitive algorithm for the problem on related machines. Monotone algorithms are necessary and sufficient for the design of truthful scheduling mechanisms in the setting with selfish machines. The algorithms constructed by our scheme are among the first monotone algorithms for scheduling problems with precedence constraints. For example, we show that our scheme applies to the problems of minimizing the makespan or the weighted sum of completion times when the jobs have precedence constraints and/or release dates.