2714 search results - page 51 / 543 » Approximation Schemes for Scheduling |
56
Voted
IJIPM
2010
14 years 9 months ago
2010
69
Voted
WICOMM
2010
14 years 7 months ago
2010
109
Voted
ORL
2008
15 years 13 days ago
2008
We provide a monotone O(m2/3 )-approximation algorithm for scheduling related machines with precedence constraints.
129
Voted
IPCO
1998
15 years 1 months ago
1998
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
SIAMCOMP
2010
14 years 7 months ago
2010
Abstract. In this paper we study variants of the non-preemptive parallel job scheduling problem where the number of machines is polynomially bounded in the number of jobs. For this...