Scheduling as Heuristic Search with State Space Reduction

Authors:
Ramiro Varela;Elena Soto
Affiliations:
-;-
Venue:
IBERAMIA 2002 Proceedings of the 8th Ibero-American Conference on AI: Advances in Artificial Intelligence
Year:
2002

Citing 6
Cited 1

Principles of artificial intelligence

Principles of artificial intelligence
New search spaces for sequencing problems with application to job shop scheduling

Management Science
Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem

Artificial Intelligence
Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics

Artificial Intelligence
Planning as heuristic search

Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Production scheduling and rescheduling with genetic algorithms

Evolutionary Computation

Optimal scheduling with heuristic best first search

AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we confront the Job Shop Scheduling problem by means of an A* algorithm for heuristic state space searching. This algorithm can guarantee optimal solutions, i.e. it is admissible, under certain conditions, but in this case it requires an amount of memory that grows linearly as the search progresses. We hence start by focusing on techniques that enable us to reduce the size of the search space while maintaining the ability of reaching optimal schedules. We then relax some of the conditions that guarantee optimality in order to achieve a further reduction in the number of states visited. We report results from an experimental study showing the extent to which this reduction is worth carrying out in practice.