388 search results - page 11 / 78 » A Mixed Closure-CSP Method to Solve Scheduling Problems |
COR
2010
13 years 8 months ago
2010
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
AAAI
1994
13 years 10 months ago
1994
It has recently been shown that local search is surprisingly good at nding satisfying assignments for certain computationally hard classes of CNF formulas. The performance of basi...
ISPDC
2007
IEEE
14 years 3 months ago
2007
IEEE
Mixed-parallel applications can take advantage of largescale computing platforms but scheduling them efficiently on such platforms is challenging. In this paper we compare the tw...
PDP
2003
IEEE
14 years 2 months ago
2003
IEEE
We consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent pr...
IPCO
2004
13 years 10 months ago
2004
We consider the problem of minimizing the weighted sum of job completion times on a single machine (subject to certain job weights) with an additional side constraint on the weigh...