908 search results - page 65 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
147
click to vote
AISB
1995
Springer
15 years 9 months ago
1995
Springer
This paper discusses a series of recombination operators for the timetabling problem. These operators act upon a direct representation of the timetable and maintain the property of...
142
click to vote
EVOW
2003
Springer
15 years 11 months ago
2003
Springer
This paper considers the problem of minimizing the response time for a given database workload by a proper choice of indexes. This problem is NP-hard and known in the literature as...
173
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...
161
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
The Vehicle Routing Problem’s main objective is to find the lowest-cost set of routes to deliver goods to customers, which have a service time window, using a fleet of identic...
169
click to vote
CP
2007
Springer
15 years 10 months ago
2007
Springer
Recent research has focused on using the power of look-ahead to speed up the resolution of the Max-SAT problem. Indeed, look-ahead techniques such as Unit Propagation (UP) allow to...