1095 search results - page 38 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
139
Voted
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
134
click to vote
STOC
1989
ACM
15 years 8 months ago
1989
ACM
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
145
click to vote
WSC
2008
15 years 6 months ago
2008
In an assembly line with high labor proportion, the workforce planning and scheduling is a very complex problem. At the background of increasing labor costs, it is very important ...
115
click to vote
CNSM
2010
15 years 2 months ago
2010
Many industries experience an explosion in digital content. This explosion of electronic documents, along with new regulations and document retention rules, sets new requirements f...
157
click to vote
SUTC
2006
IEEE
15 years 10 months ago
2006
IEEE
Energy management in sensor networks is crucial to prolong the network lifetime. Though existing sleep scheduling algorithms save energy, they lead to a large increase in end-to-e...