Sciweavers

501 search results - page 8 / 101
» Scheduling Abstractions for Local Search
Sort
View
SLS
2007
Springer
120views Algorithms» more  SLS 2007»
14 years 1 months ago
A Study of Neighborhood Structures for the Multiple Depot Vehicle Scheduling Problem
This paper introduces the ”block moves” neighborhood for the Multiple Depot Vehicle Scheduling Problem. Experimental studies are carried out on a set of benchmark instances to ...
Benoît Laurent, Jin-Kao Hao
COR
2010
121views more  COR 2010»
13 years 7 months ago
Parallel machine scheduling with precedence constraints and setup times
This paper presents different methods for solving parallel machine scheduling problems with precedence constraints and setup times between the jobs. Limited discrepancy search met...
Bernat Gacias, Christian Artigues, Pierre Lopez
AIM
2004
13 years 7 months ago
An AI Planning-based Tool for Scheduling Satellite Nominal Operations
Satellite domains are becoming a fashionable area of research within the AI community due to the complexity of the problems that these domains need to solve. With the current US a...
María Dolores Rodríguez-Moreno, Dani...
GECCO
2004
Springer
125views Optimization» more  GECCO 2004»
14 years 22 days ago
Population-Based Iterated Local Search: Restricting Neighborhood Search by Crossover
Abstract. Iterated local search (ILS) is a powerful meta-heuristic algorithm applied to a large variety of combinatorial optimization problems. Contrary to evolutionary algorithms ...
Dirk Thierens
CP
2005
Springer
14 years 26 days ago
Parallel Local Search in Comet
Abstract. The availability of commodity multiprocessors offers significant opportunities for addressing the increasing computational requirements of optimization applications. To...
Laurent Michel, Pascal Van Hentenryck