AI*IA 2005: Advances in Artificial Intelligence

DOI10.1007/11558590zbMATH Open1155.68513OpenAlexW2251909639MaRDI QIDQ5475751FDOQ5475751

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)

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimal and heuristic solutions for a scheduling problem arising in a foundry
• Simple heuristics for scheduling with limited intermediate storage
• Heuristics to Schedule Service Engineers within Time Windows
• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• 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 👍 👎

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)