908 search results - page 68 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
115
click to vote
CL
2000
Springer
15 years 5 months ago
2000
Springer
Boolean circuits offer a natural, structured, and compact representation of Boolean functions for many application domains. In this paper a tableau method for solving satisfiabilit...
113
click to vote
CEC
2005
IEEE
15 years 4 months ago
2005
IEEE
Timetabling problems are constraint optimization problems proven to be NP complete. Furthermore, evaluation of violations is costly, and there is no common data format for represen...
117
click to vote
EUROSYS
2006
ACM
15 years 11 months ago
2006
ACM
—Restoring data operations after a disaster is a daunting task: how should recovery be performed to minimize data loss and application downtime? Administrators are under consider...
103
click to vote
IDA
2008
Springer
15 years 2 months ago
2008
Springer
Meta-heuristics such as simulated annealing, genetic algorithms and tabu search have been successfully applied to many difficult optimization problems for which no satisfactory pro...
116
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...