501 search results - page 23 / 101 » Scheduling Abstractions for Local Search |
AAAI
2006
13 years 8 months ago
2006
The scalability of graph-search algorithms can be greatly extended by using external memory, such as disk, to store generated nodes. We consider structured duplicate detection, an...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, a novel discrete differential evolution (DDE) algorithm is presented to solve the permutation flowhop scheduling problem with the makespan criterion. The DDE algori...
DAC
2007
ACM
14 years 8 months ago
2007
ACM
tive Guidance Strategy for Abstraction-Guided Simulation Flavio M. De Paula Alan J. Hu Department of Computer Science, University of British Columbia, {depaulfm, ajh}@cs.ubc.ca D...
ISCIS
2005
Springer
14 years 27 days ago
2005
Springer
Abstract. We investigate the problem of enumerating schedules, consisting of course-section assignments, in increasing order of the number of conflicts they contain. We define th...
SEAL
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. This paper deals with the problem of nurse rostering in Belgian hospitals. This is a highly constrained real world problem that was (until the results of this research we...