24 search results - page 3 / 5 » The fuzzy single machine scheduling problem - some general p... |
ALGORITHMICA
2002
13 years 7 months ago
2002
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
DAM
1998
13 years 7 months ago
1998
We study a discrete problem of scheduling activities of several types under the constraint that at most a single activity can be scheduled to any one period. Applications of such ...
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
DAM
2007
13 years 7 months ago
2007
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...
ESANN
2003
13 years 8 months ago
2003
The resource constraint project scheduling problem (RCPSP) is an NP-hard benchmark problem in scheduling which takes into account the limitation of resources’ availabilities in ...