Sciweavers

2714 search results - page 12 / 543
» Approximation Schemes for Scheduling
Sort
View
CORR
2004
Springer
153views Education» more  CORR 2004»
14 years 9 months ago
Cauchy Annealing Schedule: An Annealing Schedule for Boltzmann Selection Scheme in Evolutionary Algorithms
Abstract-Boltzmann selectionis an important selection mechanism in evolutionary algorithms as it has theoretical properties which help in theoretical analysis. However, Boltzmann s...
Ambedkar Dukkipati, M. Narasimha Murty, Shalabh Bh...
CORR
2010
Springer
146views Education» more  CORR 2010»
14 years 6 months ago
Multi-Criteria Evaluation of Partitioning Schemes for Real-Time Systems
In this paper we study the partitioning approach for multiprocessor real-time scheduling. This approach seems to be the easiest since, once the partitioning of the task set has be...
Irina Lupu, Pierre Courbin, Laurent George, Jo&eum...
DISOPT
2006
155views more  DISOPT 2006»
14 years 9 months ago
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...
Dorit S. Hochbaum, Asaf Levin
COR
2007
80views more  COR 2007»
14 years 9 months ago
Scheduling with tool changes to minimize total completion time under controllable machining conditions
Scheduling under controllable machining conditions has been studied for some time. Scheduling with tool changes, particularly due to tool wear, has just begun to receive attention...
M. Selim Akturk, Jay B. Ghosh, Rabia K. Kayan
CORR
2010
Springer
113views Education» more  CORR 2010»
14 years 9 months ago
A Fair and Efficient Packet Scheduling Scheme for IEEE 802.16 Broadband Wireless Access Systems
This paper proposes a fair and efficient QoS scheduling scheme for IEEE 802.16 BWA systems that satisfies both throughput and delay guarantee to various real and non-real time app...
Prasun Chowdhury, Iti Saha Misra