Abstract
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.
This work has been supported by project FEDER-MCYT TIC2003-04153 and by FICYT under grant BP04-021.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brucker, P., Jurisch, B., Sievers, B.: A branch and bound algorithm for the job-shop scheduling problem. Discrete Applied Mathematics 49, 107–127 (1994)
Carlier, J., Pinson, E.: Adjustment of heads and tails for the job-shop problem. European Journal of Operational Research 78, 146–161 (1994)
Giffler, B., Thomson, G.L.: Algorithms for Solving Production Scheduling Problems. Operations Reseach 8, 487–503 (1960)
Jain, A.S., Meeran, S.: Deterministic job-shop scheduling: Past, present and future. European Journal of Operational Research 113, 390–434 (1999)
Nilsson, N.: Principles of Artificial Intelligence, Tioga, Palo Alto, CA (1980)
Sadeh, N., Fox, M.S.: Variable and Value Ordering Heuristics for the Job Shop Scheduling Constraint Satisfaction Problem. Artificial Intelligence 86, 1–41 (1996)
Varela, R., Soto, E.: Scheduling as Heuristic Search with State Space Reduction. In: Garijo, F.J., Riquelme, J.-C., Toro, M. (eds.) IBERAMIA 2002. LNCS (LNAI), vol. 2527, pp. 815–824. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sierra, M.R., Varela, R. (2005). Optimal Scheduling with Heuristic Best First Search. In: Bandini, S., Manzoni, S. (eds) AI*IA 2005: Advances in Artificial Intelligence. AI*IA 2005. Lecture Notes in Computer Science(), vol 3673. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11558590_17
Download citation
DOI: https://doi.org/10.1007/11558590_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29041-4
Online ISBN: 978-3-540-31733-3
eBook Packages: Computer ScienceComputer Science (R0)