A mixed closure-CSP method for solving scheduling problems
type: Item
instance of: scholarly article
title: A mixed closure-CSP method for solving scheduling problems
zbMATH Open document ID: 1087.90024
DOI: 10.1023/B:APIN.0000033636.14272.95
author: María Isabel Alfonso
author: Federico Barber
published in: Applied Intelligence
publication date: 2005-03-15T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 2145994
zbMATH Keywords: planning and scheduling
zbMATH Keywords: temporal reasoning
zbMATH Keywords: heuristic search
MaRDI profile type: Publication
full work available at URL: b:apin.0000033636.14272.95
OpenAlex ID: W1988866671
description: scientific article; zbMATH DE number 2145994