547 search results - page 31 / 110 » Preference-Based Search for Scheduling |
91
Voted
IJCAI
1997
15 years 12 days ago
1997
This paper presents a technique, called GENH, that automatically generates search heuristics for scheduling problems. The impetus for developing this technique is the growing cons...
101
Voted
AAAI
2008
15 years 1 months ago
2008
Hybrid Scheduling Problems (HSPs) contain both temporal and finite-domain variables, as well as constraints between them. A hybrid constraint over temporal and finite-domain varia...
ICN
2007
Springer
15 years 5 months ago
2007
Springer
There has been an increasing number of network deployments that provide dedicated connections through on-demand and in-advance scheduling in support of highperformance application...
TWC
2008
14 years 11 months ago
2008
A low complexity user scheduling algorithm based on a novel adaptive Markov chain Monte Carlo (AMCMC) method is proposed to achieve the maximal sum capacity in an uplink multiple-i...
ESWA
2010
14 years 9 months ago
2010
Most previous research into the job-shop scheduling problem has concentrated on finding a single optimal solution (e.g., makespan), even though the actual requirement of most prod...