126 search results - page 19 / 26 » A Global Constraint for Total Weighted Completion Time |
COR
2010
14 years 11 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...
104
click to vote
MP
2002
14 years 11 months ago
2002
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
In this paper, we investigate the transmission completion time minimization problem in a two-user additive white Gaussian noise (AWGN) broadcast channel, where the transmitter is ...
ICCAD
2008
IEEE
15 years 6 months ago
2008
IEEE
— The area-I/O flip-chip package provides a high chip-density solution to the demand of more I/O’s in VLSI designs; it can achieve smaller package size, shorter wirelength, an...
RTCSA
1999
IEEE
15 years 4 months ago
1999
IEEE
In this paper; we describe optimal algorithmsfor incorporating error recovery in the imprecise computation model. In that model eack task compriser a mandatory and an optional par...