Scheduling is an AI problem because we can model many scheduling problems as Constraint Satisfaction Problems (CSPs). Consider this: You have twelve employees, each of whom have different inflexible schedules. Some employees can only work on certain days of the week. Some employees can only work during certain hours of the day. And a few of these employees cannot work together for various reasons. How would you determine what possible schedules will satisfy all of these constraints? How would you determine if it is even possible to satisfy all of these constraints? Traditionally, this is a class of problem referred to as "NP," meaning it is easy to check if a particular combination will satisfy the constraints (or not), but it is traditionally extremely difficult to actually generate the solutions.
Commandment Intelligence has experienced a major breakthrough in our research of CSPs. Contact us today, and we can help you!