1095 search results - page 84 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
110
click to vote
SDM
2008
SIAM
14 years 11 months ago
2008
SIAM
Maximum margin clustering (MMC) is a recently proposed clustering method, which extends the theory of support vector machine to the unsupervised scenario and aims at finding the m...
116
click to vote
JPDC
2008
14 years 10 months ago
2008
Electron tomography (ET) combines electron microscopy and the principles of tomographic imaging in order to reconstruct the threedimensional structure of complex biological specim...
COR
2006
14 years 10 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...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Due to its optimality on a single machine for the problem of minimizing average flow time, ShortestRemaining-Processing-Time (SRPT) appears to be the most natural algorithm to con...
108
click to vote
AAIM
2007
Springer
15 years 4 months ago
2007
Springer
Packet scheduling in networks with quality of service constraints has been extensively studied as a single criterion scheduling problem. The assumption underlying single criterion ...