21 search results - page 1 / 5 » Minimizing the earliness-tardiness costs on a single machine |
TASE
2008
IEEE
13 years 4 months ago
2008
IEEE
This paper addresses the general single-machine earliness-tardiness problem with distinct release dates, due dates, and unit costs. The aim of this research is to obtain an exact n...
COR
2006
13 years 4 months ago
2006
In this paper the one-machine scheduling problem with linear earliness and tardiness costs is considered. The7 cost functions are job dependent and asymmetric. The problem consist...
IPPS
2009
IEEE
13 years 11 months ago
2009
IEEE
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
ICML
2003
IEEE
14 years 5 months ago
2003
IEEE
Theoretical and experimental analyses of bagging indicate that it is primarily a variance reduction technique. This suggests that bagging should be applied to learning algorithms ...
ORL
2002
13 years 4 months ago
2002
We consider on-line scheduling of unit time jobs on a single machine with job-dependent penalties. The jobs arrive on-line (one by one) and can be either accepted and scheduled, o...