Sciweavers

3 search results - page 1 / 1
» Optimal solutions for unrelated parallel machines scheduling...
Sort
View
EOR
2010
113views more  EOR 2010»
13 years 4 months ago
Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations
We consider the unrelated parallel machines scheduling problem where jobs have earliness and tardiness penalties and a common due date. We formulate this problem and some of its v...
Marie-Christine Plateau, Yasmin A. Rios-Solis
STOC
2005
ACM
156views Algorithms» more  STOC 2005»
14 years 4 months ago
Convex programming for scheduling unrelated parallel machines
We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . ...
Yossi Azar, Amir Epstein
ESANN
2004
13 years 6 months ago
Sparse LS-SVMs using additive regularization with a penalized validation criterion
This paper is based on a new way for determining the regularization trade-off in least squares support vector machines (LS-SVMs) via a mechanism of additive regularization which ha...
Kristiaan Pelckmans, Johan A. K. Suykens, Bart De ...