Solving rostering tasks as constraint optimization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2079 LNCS, Issue , 2001, Pages 191-212

  Meyer Auf'm Hofe, Harald ^a  

^a GWI SIEDA GmbH   (Germany)

Author keywords

Artificial intelligence; Commercial packages; Constraint based methods; Employee timetabling; Local search; Soft computing

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATION THEORY; CONSTRAINED OPTIMIZATION; LEARNING ALGORITHMS; LOCAL SEARCH (OPTIMIZATION); NURSING; SOFT COMPUTING; SCHEDULING;

COMMERCIAL PACKAGES; CONSTRAINT BASED METHOD; CONSTRAINT OPTIMIZATIONS; CONSTRAINT PROCESSING; EMPLOYEE TIMETABLING; LOCAL SEARCH; PROBLEM REPRESENTATION; TREE SEARCH ALGORITHM; WORKING TIME ACCOUNTS;

SCHEDULING; OPTIMIZATION;

EID: 84889578133     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44629-x_12     Document Type: Conference Paper

References (23)

1. Abdennadher, S., Schlenker, H.: INTERDIP - an Interactive Constraint Based Nurse Scheduler. In: Proc. Int. Conf. on Practical Applications of Constraint Technology and Logic Programming. Practical Applications Expo, London (1999)
2. Bacchus, F., van Run, P.: Dynamic Variable Ordering in CSPs. In: Montanari, U., Rossi, F. (eds.): Proc. 1st Int. Conf. on Principles and Practice of Constraint Programming. Springer-Verlag, Berlin Heidelberg NewYork (1995) 258-275
3. Bistarelli, S., Fargier, H., Montanari, U., Rossi, F., Schiex, T., Verfaillie, G.: Semiring-Based CSPs and Valued CSPs: Basic Properties and Comparisons. In: Jampel, M. (ed.): Over-Constrained Systems. Springer-Verlag, Berlin Heidelberg NewYork (1996)
4. Borning, A., Freeman-Benson, B., Wilson, M.: Constraint Hierarchies. Lisp and Symbolic Comput. 5 (1992) 233-270
5. Darmoni, S.J., Fajner, A., Leforestier, A., Mahe, N.: Horoplan: Computer-Assisted Nurse Scheduling Using Constraint-Based Programming. J. Soc. for Health Systems 5 (1995) 41-54
6. Dincbas, M., Van Hentenryck, P., Simonis, H., Aggoun, A., Graf, T., Berthier, F.: The Constraint Logic Programming Language CHIP. In: Proc. Int. Conf. on Fifth Generation Computer Systems (1988)
7. Dubois, D., Fargier, H., Prade, H.: The Calculus of Fuzzy Restrictions as a Basis for Flexible Constraint Satisfaction. In: Proc. 2nd IEEE Int. Conf. on Fuzzy Systems (San Francisco, CA) (1993) 1131-1136
8. Fages, F., Fowler, J., Sola, T.: Handling Preferences in Constraint Logic Programming with Relational Optimization. In: Jampel, M. (ed.): Over-Constrained Systems. Springer-Verlag, Berlin Heidelberg NewYork (1996)
9. Freuder, E.C.,Wallace, R.J.: Partial Constraint Satisfaction. Artif. Intell. 58 (1992) 21-70
10. Gaschnig, J.: A General Backtrack Algorithm that Eliminates Most Redundant Checks. In: Proc. IJCAI-77 (Cambridge, MA) (1977)
11. Meyer auf'm Hofe, H.: Partial Satisfaction of Constraint Hierarchies in Reactive and Interactive Configuration. In: Hower,W. Ruttkay, Z. (eds.): ECAI-96Workshop on Non-Standard Constraint Processing (1996) 61-72
12. Meyer auf'm Hofe, H.: ConPlan/SIEDAplan: Personnel Assignment as a Problem of Hierarchical Constraint Satisfaction. In: PACT-97: Proc. 3rd Int. Conf. on the Practical Application of Constraint Technology (Practical Application Expo, London) (1997) 257-272
13. Meyer auf'm Hofe, H.: Kombinatorische Optimierung mit Constraintverfahren - Problemlösung ohne anwendungsspezifische Suchstrategien. DISKI - Dissertationen zur Künstlichen Intelligenz, Vol. 242. Infix, Akademische Verlagsgesellschaft (2000) ISBN 3-89838-242-7
14. Meyer auf'm Hofe, H., Abecker, A.: ConPlan: Solving Scheduling Problems Represented by Soft Constraints. In: ISIAC-98: Proc. Int. Symp. on Intelligent Automation and Control (Anchorage, AK) (1998) 245-250
15. Nilsson, N.: Principles of Artificial Intelligence. In: Symbolic Computation. Springer-Verlag, Berlin Heidelberg NewYork (1982) chapter 3.2
16. Schiex, T., Fargier, H., Verfaillie, G.: Valued Constraint Satisfaction Problems: Hard and Easy Problems. In: Mellish, C. (ed.): IJCAI-95: Proc. 14th Int. Joint Conf. on Artif. Intell. Kaufmann, San Francisco, CA (1995) 631-637
17. Snow, P., Freuder, E.C.: Improved Relaxation and Search Methods forApproximate Constraint Satisfaction with a Maximin Criterion. In: Proc. 8th Biennial Conf. of the Can. Soc for Comput. Studies of Intelligence (1990) 227-230
18. Steinmann, O., Strohmeier, A., Stützle, T.: Tabu Search vs. Random Walk. In: Brewka, G., Habel, C., Nebel, B. (eds.): KI-97: Advances in Artificial Intelligence. LNAI, Vol. 1303. Springer-Verlag, Berlin Heidelberg NewYork (1997) 337-348
19. Tsang, E.: Foundations of Constraint Satisfaction. Computation in Cognitive Science. Academic, London (1993) ISBN 0-12-701610-4
20. Wallace, M., Novello, S., Schimpf, J.: Eclipse - a Platform for Constraint Logic Programming. ICL Systems J. 12 (1997) 159-200
21. Wallace, R.J.: Analysis of Heuristic Methods for Partial Constraint Satisfaction Problems. In: CP-96: Proc. 2nd Int. Conf. on Principles and Practice of Constraint Processing. Springer-Verlag, Berlin Heidelberg NewYork (1996) 482-496
22. Weil, G., Heus, K.: Eliminating Interchangeable Values in the Nurse Scheduling Problem Formulated as a Constraint Satisfaction Problem. In: CONSTRAINT-95: The FLAIRS-95 Int.Workshop on Constraint-Based Reasoning (Melbourne Beach, FL) (1995)
23. Zadeh, L.A.: Fuzzy Sets. Information and Control 8 (1965) 338-353