393 search results - page 20 / 79 » Personnel scheduling: Models and complexity |
152
click to vote
KBS
2007
15 years 6 months ago
2007
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
171
click to vote
ISCAPDCS
2004
15 years 8 months ago
2004
Scheduling and load-balancing techniques play an integral role in reducing the overall execution time of scientific applications on clustered multi-node systems. The increasing co...
175
click to vote
IPPS
2006
IEEE
16 years 17 days ago
2006
IEEE
This paper deals with scheduling divisible load applications on star networks, in presence of return messages. This work is a follow-on of [6, 7], where the same problem was consi...
182
click to vote
CJ
2004
15 years 6 months ago
2004
This paper describes a way to manage the modeling and analysis of Scheduled Maintenance Systems (SMS) within an analytically tractable context. We chose a significant case study h...
135
click to vote
INFOCOM
2003
IEEE
15 years 12 months ago
2003
IEEE
— Instability in packet-switching networks is normally associated with overload conditions, since queueing network models show that, in simple configurations, only overload gene...