703 search results - page 59 / 141 » Maintenance scheduling problems as benchmarks for constraint... |
IPCCC
2006
IEEE
15 years 3 months ago
2006
IEEE
This paper addresses the problem of improving quality of security for real-time parallel applications on heterogeneous clusters. We propose a new security- and heterogeneity-drive...
CP
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...
CP
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal ...
INFOCOM
1996
IEEE
15 years 1 months ago
1996
IEEE
Two protocols for scheduling variable-length packet transmissions in an optical passive star network using wavelength division multiplexing WDM are speci ed and analyzed. These pr...
79
Voted
WSC
2007
15 years 8 hour ago
2007
In this paper we introduce the completed unit algorithm (CU-AL), a probabilistic scheduling methodology for repetitive projects. The algorithm has two main advantages, simplicity ...