loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: María R. Sierra 1 and Ramiro Varela 2

Affiliations: 1 University of Cantabria, Facultad de Ciencias, Spain ; 2 University of Oviedo, Spain

ISBN: 978-989-8111-51-7

Keyword(s): Heuristic Search, Best First Search, Pruning by Dominance, Job Shop Scheduling.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Enterprise Software Technologies ; Intelligent Problem Solving ; Knowledge Engineering and Ontology Development ; Knowledge-Based Systems ; Software Engineering ; Symbolic Systems

Abstract: Best-first graph search is a classic problem solving paradigm capable of obtaining exact solutions to optimization problems. As it usually requires a large amount of memory to store the effective search space, in practice it is only suitable for small instances. In this paper, we propose a pruning method, based on dominance relations among states, for reducing the search space. We apply this method to an A∗ algorithm that explores the space of active schedules for the Job Shop Scheduling Problem with makespan minimization. The A∗ algorithm is guided by a consistent heuristic and it is combined with a greedy algorithm to obtain upper bounds during the search process. We conducted an experimental study over a conventional benchmark. The results show that the proposed method is able to reduce both the space and the time in searching for optimal schedules so as it is able to solve instances with 20 jobs and 5 machines or 9 jobs and 9 machines. Also, the A∗ is exploited with heuristic weig hting to obtain sub-optimal solutions for larger instances. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 100.25.43.188

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
R. Sierra M.; Varela R. and (2008). PRUNING SEARCH SPACE BY DOMINANCE RULES IN BEST FIRST SEARCH FOR THE JOB SHOP SCHEDULING PROBLEM.In Proceedings of the Third International Conference on Software and Data Technologies - Volume 1: ICSOFT, ISBN 978-989-8111-51-7, pages 273-280. DOI: 10.5220/0001896102730280

@conference{icsoft08,
author={María {R. Sierra} and Ramiro Varela},
title={PRUNING SEARCH SPACE BY DOMINANCE RULES IN BEST FIRST SEARCH FOR THE JOB SHOP SCHEDULING PROBLEM},
booktitle={Proceedings of the Third International Conference on Software and Data Technologies - Volume 1: ICSOFT,},
year={2008},
pages={273-280},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001896102730280},
isbn={978-989-8111-51-7},
}

TY - CONF

JO - Proceedings of the Third International Conference on Software and Data Technologies - Volume 1: ICSOFT,
TI - PRUNING SEARCH SPACE BY DOMINANCE RULES IN BEST FIRST SEARCH FOR THE JOB SHOP SCHEDULING PROBLEM
SN - 978-989-8111-51-7
AU - R. Sierra, M.
AU - Varela, R.
PY - 2008
SP - 273
EP - 280
DO - 10.5220/0001896102730280

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.