908 search results - page 35 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
129
click to vote
MP
2006
15 years 1 months ago
2006
In the paper we address the Distance-Constrained Capacitated Vehicle Routing Problem (DCVRP), where k minimum-cost routes through a central depot have to be constructed so as to co...
131
click to vote
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
In recent decades, many meta-heuristics, including genetic algorithm (GA), ant colony optimization (ACO) and various local search (LS) procedures have been developed for solving a...
100
click to vote
AAAI
1998
15 years 3 months ago
1998
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...
120
click to vote
JUCS
2008
15 years 1 months ago
2008
: In this article we present the development of a web application called SHARP Online: An Adaptive Hypermedia System Applied to Mathematical Problem Solving. The pedagogical basis ...
124
click to vote
RTCSA
2006
IEEE
15 years 7 months ago
2006
IEEE
(m,k)-firm constraints have been used to schedule tasks in soft/firm real-time systems under overloaded conditions. In general, they are provided by application designers to guara...