Scheduling as heuristic search with state space reduction

DOI10.1007/3-540-36131-6_83MaRDI QIDQ4422237zbMATH OpenFDO

Authors Ramiro Varela, E. Soto

Publication date 3 September 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2527/25270815.htm

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

• AI*IA 2005: Advances in Artificial Intelligence
• Problem and Heuristic Space Search Strategies for Job Shop Scheduling
• Depth-first heuristic search for the job shop scheduling problem
• Reducing the solution space of optimal task scheduling
• An effective near-optimal state-space search method: an application to a scheduling problem

Cited in

(7)

• The space reduction method: A method to reduce the size of search spaces
• A search control for scheduling problems
• An effective near-optimal state-space search method: an application to a scheduling problem
• Reducing the solution space of optimal task scheduling
• AI*IA 2005: Advances in Artificial Intelligence
• Recent Advances in Constraints
• Simple heuristics for scheduling with limited intermediate storage

This page was built for publication: Scheduling as heuristic search with state space reduction

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