Document Type



Small businesses must overcome daily struggles in order to survive in a competitive environment. One of these complex but necessary tasks is the scheduling of employees into shifts. By using a customized Constraint Satisfaction Problem (CSP), a generic backtracking algorithm can be applied to greatly improve both quality of the schedule as well as the time in which it takes to calculate it.


Marius Călin Silaghi

Publication Date




To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.