Sciweavers

506 search results - page 26 / 102
» State-Dependent Deadline Scheduling
Sort
View
IPL
2002
86views more  IPL 2002»
13 years 9 months ago
A polynomial algorithm for lot-size scheduling of two type tasks
We study the problem of scheduling unit time tasks of two types on m parallel identical machines. For each type, given numbers of tasks are required to be completed by the specifi...
Mikhail Y. Kovalyov, Marcus Pattloch, Günter ...
RTS
2006
138views more  RTS 2006»
13 years 9 months ago
An Analysis of Fixed-Priority Schedulability on a Multiprocessor
A new feasibility test for preemptive scheduling of periodic or sporadic real-time tasks on a single-queue m-server system allows for arbitrary fixed task priorities and arbitrary...
Theodore P. Baker
INFOCOM
1991
IEEE
14 years 1 months ago
Queueing Performance with Impatient Customers
customer which exceeds its deadline will either leave the queue without service or stay in the queue to get unsucWe consider the problem of scheduling impatient CUS- cessful servic...
Zheng-Xue Zhao, Shivendra S. Panwar, Donald F. Tow...
CEE
2007
107views more  CEE 2007»
13 years 9 months ago
A non-preemptive scheduling algorithm for soft real-time systems
Real-time systems are often designed using preemptive scheduling and worst-case execution time estimates to guarantee the execution of high priority tasks. There is, however, an i...
Wenming Li, Krishna M. Kavi, Robert Akl
COR
2010
129views more  COR 2010»
13 years 8 months ago
Flexible solutions in disjunctive scheduling: General formulation and study of the flow-shop case
We consider the context of decision support for schedule modification after the computation off-line of a predictive optimal (or near optimal) schedule. The purpose of this work i...
Mohamed Ali Aloulou, Christian Artigues