Principles of artificial intelligence
Principles of artificial intelligence
A branch and bound algorithm for the job-shop scheduling problem
Discrete Applied Mathematics - Special volume: viewpoints on optimization
Scheduling as Heuristic Search with State Space Reduction
IBERAMIA 2002 Proceedings of the 8th Ibero-American Conference on AI: Advances in Artificial Intelligence
| Hi-index | 0.00 |
A* Nilsson´s algorithm is a systematic search paradigm that allows for exploiting domain knowledge to obtain optimal solutions. In this paper we apply A* to the Job Shop Scheduling problem. We restrict the search to the space of active schedules and exploit the Jackson' preemptive schedule to design a good heuristic function. Our objective is to study the extent to which this approach is able to solve this problem to optimality. Moreover we propose a method to obtain suboptimal solutions when no optimal ones are reached within a reasonable amount of time. We report results from an experimental study and compare with other well-known exact search paradigms such as backtracking and branch and bound.