An effective near-optimal state-space search method: an application to a scheduling problem

DOI10.1023/B:AIRE.0000044304.00402.9FMaRDI QIDQ1768895zbMATH OpenFDO

Authors Reza Zamani

Publication date 15 March 2005

Published in Artificial Intelligence Review (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/B:AIRE.0000044304.00402.9F

zbMATH Keywords

iterative-deepeninglearning real-timeschedulingsearchstate-space

Mathematics Subject Classification ID

Searching and sorting (68P10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• scientific article; zbMATH DE number 1974088
• scientific article; zbMATH DE number 1548192
• Learning for efficient search
• State-Space Search
• The time complexity of A^* with approximate heuristics on multiple-solution search spaces

Cited in

(4)

• Finding improving directions in Lagrangian relaxation by fictitious play: A NASA scheduling application
• A polarized adaptive schedule generation scheme for the resource-constrained project scheduling problem
• scientific article; zbMATH DE number 1974088 (Why is no real title available?)
• scientific article; zbMATH DE number 1548192 (Why is no real title available?)

This page was built for publication: An effective near-optimal state-space search method: an application to a scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1768895)