Sciweavers

1095 search results - page 75 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
ICC
2007
IEEE
116views Communications» more  ICC 2007»
15 years 4 months ago
A New Cross Layer Approach to QoS-Aware Proportional Fairness Packet Scheduling in the Downlink of OFDM Wireless Systems
—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...
Zhen Kong, Jiangzhou Wang, Yu-Kwong Kwok
75
Voted
AOR
2007
107views more  AOR 2007»
14 years 10 months ago
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms
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....
Juraj Hromkovic, Tobias Mömke, Kathleen Stein...
102
Voted
COR
2007
106views more  COR 2007»
14 years 10 months ago
Scheduling parallel CNC machines with time/cost trade-off considerations
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...
Sinan Gurel, M. Selim Akturk
EMSOFT
2009
Springer
15 years 2 months ago
Modular static scheduling of synchronous data-flow networks: an efficient symbolic representation
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...
Marc Pouzet, Pascal Raymond
COR
2011
14 years 4 months ago
Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines
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...
Sven Oliver Krumke, Alfred Taudes, Stephan Westpha...