On the Boundary of Planning and Scheduling: A Study

Roman Barták · 1999

Planning and scheduling are areas attracting an unceasing attention of computer science community. However, despite of their similar character, planning and scheduling problems are usually handled independently using different methods and technologies. While Artificial Intelligence technology is more relevant for planning problems, Operations Research has a long tradition in studying scheduling problems. Recently, Constraint Programming brings a fresh breeze to both areas as it allows a combination of various methods to solve the planning and scheduling problems within single declarative framework. In the

Read the paper · More papers on PaperTik