1095 search results - page 75 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
143
click to vote
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
—OFDM systems are the major cellular platforms for supporting ubiquitous high performance mobile applications. However, there remain a number of research challenges to be tackled...
124
click to vote
AOR
2007
15 years 4 months ago
2007
We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines....
146
click to vote
COR
2007
15 years 4 months ago
2007
When the processing times of jobs are controllable, selected processing times affect both the manufacturing cost and the scheduling performance.A well-known example for such a cas...
143
click to vote
EMSOFT
2009
Springer
15 years 7 months ago
2009
Springer
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
154
click to vote
COR
2011
14 years 10 months ago
2011
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...