AI*IA 2005: Advances in Artificial Intelligence

DOI10.1007/11558590MaRDI QIDQ5475751zbMATH OpenOpenAlexFDO

Authors María R. Sierra, Ramiro Varela

Publication date 27 June 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11558590

zbMATH Keywords

Heuristic SearchA* Nilssons algorithmJob Shop Scheduling

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 1974088
• Depth-first heuristic search for the job shop scheduling problem
• Scheduling the General Job-Shop
• Generalized best-first search strategies and the optimality of A*
• A heuristic search algorithm for flow-shop scheduling

Cited in

(6)

• Optimal and heuristic solutions for a scheduling problem arising in a foundry
• scientific article; zbMATH DE number 67460 (Why is no real title available?)
• Simple heuristics for scheduling with limited intermediate storage
• scientific article; zbMATH DE number 5669804 (Why is no real title available?)
• Heuristics to Schedule Service Engineers within Time Windows
• scientific article; zbMATH DE number 1974088 (Why is no real title available?)

This page was built for publication: AI*IA 2005: Advances in Artificial Intelligence

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