Combining rules and constraints for employee timetabling

International Journal of Intelligent Systems

Volumn 12, Issue 6, 1997, Pages 419-439

  Meisels, Amnon ^a   Gudes, Ehud ^a   Solotorevsky, Gadi ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; KNOWLEDGE BASED SYSTEMS; PLANNING; SCHEDULING;

EMPLOYEE TIMETABLING;

INTELLIGENT CONTROL;

EID: 0031162057     PISSN: 08848173     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-111X(199706)12:6<419::AID-INT1>3.0.CO;2-P     Document Type: Article

References (34)

1. B.Y. Choueiry and B. Faltings, "Interactive resource allocation problem decomposition and temporal abstractions," in Current Trends in AI Planning, Backstrom and Sandwell (Eds.), IOS Press, 1994, pp. 87-104.
2. B.Y. Choueiry and B. Faltings. "Temporal abstractions and a partitioning heuristic for interactive resource allocations," in Notes of Workshop on Knowledge-Based Production Planning, Scheduling and Control, IJCAI-93, Chambery, France, 1993, pp. 59-72.
3. E. Tsang, Foundations of Constraint Satisfaction, Academic Press, New York, 1993.
4. M.C. Golumbic, "Algorithmic aspects of perfect graphs," Annals of Discrete Math., 21, 1984, pp. 301-323.
5. G. Solotorevsky, E. Gudes, and A. Meisels, "Raps - A rule-based language for specifying resource allocation of time-tabling problems," IEEE Trans. DKE, 6, 681-698 (1994).
6. G. Trzewik, E. Gudes, A. Meisels, G. Solotorevsky, and M. Elhadad, "Traps - Time dependent resource allocation language," Int. J. Expert. Syst. Res. Appl., to appear.
7. G. Solotorevsky, A. Meisels, and E. Gudes, "Easystaff - The easy way for staff scheduling," Homepage: http://www.shibutzit,com., May, 1996.
8. R. Dechter, and J. Pearl, "Network-based heuristics for constraint satisfaction problems," Artif. Intell., 34, 1-38 (1988).
9. R. Dechter, "Constraint networks," In S.C. Shapiro, Ed., Encyclopedia of Artificial Intelligence, 2nd Ed. Wiley, New York, 1992, pp. 276-285.
10. R.M. Haralick and G.L. Elliott, "Increasing tree search efficiency for constraint satisfaction problems." Artif. Intell., 14, 263-313 (1980).
11. P. Prosser, 'Hybrid algorithms for the constraint satisfaction problem,' Computat. Intell., 9, 268-299 (1993).
12. R. Burns and M. Carter, "Work force size and single shift schedules with variable demands," Manage. Sci. 31, 599-607 (1985).
13. R. Nanda and J. Browner, Introduction to Employee Scheduling, Van Nostrand Reinhold, New York, 1992.
14. S. Darmoni, A. Fajner, A. Leforestier, and N. Mahe, "Horoplan: Computer-aided nurses scheduling using constraint programming," Preprint, Rouen University, France, 1993.
15. Y. Caseau, P. Giullo, and E. Levenez," A deductive and object-oriented approach to a complex scheduling problem," In DOOD93, Phoenix, Az, 1993.
16. A. Khader and J. Buchanan, "School timetabling: A knowledge-based approach," in Proc. 1st Intern. Conf. Practice and Theo. Autom. Timetabling, Edinburgh, Scotland, 1995, pp. 99-111.
17. M. Golumbic and R. Feldman, "Interactive scheduling as a constraint satisfaction problem," Annals of Mathematics and AI, 1, 49-73 (1990).
18. B. Nag and A. Sinha, "Esom: An expert system for multicriteria scheduling," Expert Syst. Appl., 3, 463-479 (1991).
19. Le Kang and G.M. White, "A logic approach to the resolution of constraints in timetabling." Eurp. Jou. Oper. Res., 61, 100-112 (1992).
20. B.M. Smith, "Phase transition and the mushy region in csp," in Proceedings of the 11th European Conference on Artificial Intelligence, Amsterdam, The Netherlands, 1994, pp. 100-104.
21. R. Dechter and I. Meiri, "Experimental evaluation of preprocessing techniques in constraint satisfaction problems," in Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, Detroit, MI, 1989, pp. 271-277.
22. A. Meisels, J. El-Saana, and E. Gudes, "Decomposing and solving timetabling constraint networks," Computational Intelligence, 1997.
23. J.C. Regini, "A filtering algorithm for constraints of difference in csps," in AAAI-94, Seattle, WA, 1994, pp. 362-367.
24. B.Y. Choueiry and B. Faltings, "A decomposition heuristic for resource allocation," in Proceedings of the 11th European Conference on Artificial Intelligence, Amsterdam, 1994, pp. 585-589.
25. M. Arkin and E.B. Silverberg, "Scheduling jobs with fixed start and end times," Discrete AppL Math. 18, 1-8 (1987).
26. A. Agoun and N. Beldiceanu, "Overview of the chip compiler," in Proc. of the 8th ICLP, Paris, 1991.
27. P. Baptiste and C. Le Pape, "A theoretical and experimental comparison of constraint propagation techniques for disjunctive scheduling," in IJCAI-95, Montreal, Canada, 1995, pp. 600-606.
28. A.B. Philips S. Minton, M.D. Johnston, and P. Laird, "Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems," The AI J., 58, 161-205 (1992).
29. P. Van Hentenryck, Constraint Satisfaction in Logic Programming, MIT Press, 1989.
30. G. Solotorevsky, E. Shimony, and A. Meisels, "Csps with counters: A likelihood-based heuristic," In Proc. Workshop on Non Standard Constraint Processing, ECAI96, Budapest, August, 1996, pp. 107-118.
31. J. Gaschnig, "A general backtracking algorithm that eliminates most redundant tests," in Proceedings of the Fifth International Joint Conference on Artificial Intelligence, Cambridge, MA, 1977. p. 457.
32. A. Monfroglio, "Timetabling through a deductive database: A case study." Data Knowl. Eng., 3, 1-27 (1988).
33. E. Gudes, A. Meisels, and G. Solotorevsky, "Easystaff 4.0-User's manuel," Schedu-LOGIC, Beer-Sheva, Israel, 1997.
34. A. Meisels and N. Lusternik, "Experiments on networks of employee timetabling problems," Submitted to PATAT97. December 1996.