908 search results - page 61 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
100
click to vote
AIPS
2008
15 years 4 months ago
2008
Planning as heuristic search is a powerful approach to solving domain independent planning problems. In recent years, various successful heuristics and planners like FF, LPG, FAST...
126
click to vote
CF
2008
ACM
15 years 4 months ago
2008
ACM
Volunteer Computing (VC) is a paradigm that takes advantage of idle cycles from computing resources donated by volunteers and connected through the Internet to compute large-scale...
108
click to vote
ACISICIS
2007
IEEE
15 years 8 months ago
2007
IEEE
This paper addresses the problem of finding a feasible solution for the University Course Timetabling Problem (UCTP), i.e. a solution that satisfies all the so-called hard const...
119
Voted
ECAI
2004
Springer
15 years 7 months ago
2004
Springer
In this paper we describe IPSS (Integrated Planning and Scheduling System), a domain independent solver that integrates an AI heuristic planner, that synthesizes courses of actions...
EVOW
2006
Springer
15 years 5 months ago
2006
Springer
This paper proposes an evolutionary algorithm (EA) that is applied to the traveling salesman problem (TSP). Existing approximation methods to address the TSP known to be state-of-t...