A mixed closure-CSP method for solving scheduling problems

DOI10.1023/B:APIN.0000033636.14272.95zbMath1087.90024OpenAlexW1988866671MaRDI QIDQ1768502

María Isabel Alfonso, Federico Barber

Publication date: 15 March 2005

Published in: Applied Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:apin.0000033636.14272.95

zbMATH Keywords

heuristic searchtemporal reasoningplanning and scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

This page was built for publication: A mixed closure-CSP method for solving scheduling problems