45 search results - page 9 / 9 » Variable Neighbourhood Search for Job Shop Scheduling Proble... |
CP
2007
Springer
14 years 1 months ago
2007
Springer
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...
EOR
2007
13 years 7 months ago
2007
: In this paper, the RCPSP (Resource Constrained Project Scheduling Problem) is solved using a linear programming model. Each activity may or may not be preemptive. Each variable i...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Gene libraries have been added to Artificial Immune Systems in analogy to biological immune systems, but to date no careful study of their effect has been made. This work investig...
ECAI
2004
Springer
14 years 1 months ago
2004
Springer
Super solutions are a mechanism to provide robustness to constraint programs [10]. They are solutions in which, if a small number of variables lose their values, we are guaranteed ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We consider the Offline Ad Slot Scheduling problem, where advertisers must be scheduled to sponsored search slots during a given period of time. Advertisers specify a budget constr...