Sciweavers

740 search results - page 59 / 148
» Analysis of Scheduling Algorithms with Reservations
Sort
View
COR
2007
80views more  COR 2007»
14 years 10 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
CL
2004
Springer
14 years 9 months ago
Nesting analysis of mobile ambients
A new algorithm is introduced for analyzing possible nestings in mobile ambient calculus. It improves both time and space complexities of the technique proposed by Nielson and Sei...
Chiara Braghin, Agostino Cortesi, Riccardo Focardi...
77
Voted
CORR
2008
Springer
94views Education» more  CORR 2008»
14 years 10 months ago
Minimum Dissatisfaction Personnel Scheduling
: In this paper we consider two problems regarding the scheduling of available personnel in order to perform a given quantity of work, which can be arbitrarily decomposed into a se...
Mugurel Ionut Andreica, Romulus Andreica, Angela A...
RTAS
2010
IEEE
14 years 8 months ago
Scheduling Suspendable, Pipelined Tasks with Non-Preemptive Sections in Soft Real-Time Multiprocessor Systems
While most prior work on multiprocessor real-time scheduling focuses on independent tasks, dependencies due to non-preemptive sections, suspensions, and pipelinebased precedence c...
Cong Liu, James H. Anderson
ESA
2008
Springer
153views Algorithms» more  ESA 2008»
14 years 11 months ago
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and > 0, correctly de...
Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, S...