Pruning search spaces by dominance rules: a case study in the job shop scheduling
by Maria R. Sierra, Ramiro Varela
International Journal of Reasoning-based Intelligent Systems (IJRIS), Vol. 2, No. 1, 2010

Abstract: In this paper, we propose a pruning method based on dominance relations among states for reducing the search space in best-first search. We apply this method to an A* algorithm that explores the space of active schedules for the job shop scheduling problem with makespan minimisation. We conducted an experimental study over conventional benchmarks. The results show that the proposed method is able to reduce both the space and the time in searching for optimal schedules and that it outperforms other approach taken from the literature.

Online publication date: Wed, 02-Dec-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Reasoning-based Intelligent Systems (IJRIS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com