Sciweavers

301 search results - page 18 / 61
» Job Sequencing with Exponential Functions of Processing Time...
Sort
View
STOC
2005
ACM
156views Algorithms» more  STOC 2005»
15 years 9 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
EOR
2007
117views more  EOR 2007»
14 years 9 months ago
Considering manufacturing cost and scheduling performance on a CNC turning machine
A well known industry application that allows controllable processing times is the manufacturing operations on CNC machines. For each turning operation as an example, there is a n...
Sinan Gurel, M. Selim Akturk
SIAMCOMP
2010
104views more  SIAMCOMP 2010»
14 years 4 months ago
Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service
Often server systems do not implement the best known algorithms for optimizing average Quality of Service (QoS) out of concern of that these algorithms may be insufficiently fair ...
Nikhil Bansal, Kirk Pruhs
90
Voted
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
15 years 2 months ago
Preemptive Online Scheduling with Reordering
We consider online preemptive scheduling of jobs, arriving one by one, on m identical parallel machines. A buffer of a fixed size K > 0, which assists in partial reordering of...
György Dósa, Leah Epstein
95
Voted
BMCBI
2008
211views more  BMCBI 2008»
14 years 9 months ago
CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment
Background: Searching for similarities in protein and DNA databases has become a routine procedure in Molecular Biology. The Smith-Waterman algorithm has been available for more t...
Svetlin Manavski, Giorgio Valle