A mixed closure-CSP method for solving scheduling problems

DOI10.1023/B:APIN.0000033636.14272.95MaRDI QIDQ1768502zbMATH OpenOpenAlexFDO

Authors 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 searchplanning and schedulingtemporal reasoning

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1708123
• Applying constraint satisfaction techniques to job shop scheduling
• Constraint propagation techniques for the disjunctive scheduling problem
• Temporal constraint satisfaction techniques in job shop scheduling problem solving
• scientific article; zbMATH DE number 2166451

Cited in

(2)

• scientific article; zbMATH DE number 1708123 (Why is no real title available?)
• ACLIPS: A capacity and lead time integrated procedure for scheduling

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

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