erationnelle des personnes

[1]  Gary M. Thompson.  Representing employee requirements in labour tour scheduling , 1993 .

[2]  Jeffrey L. Arthur,et al.  A Multiple Objective Nurse Scheduling Model , 1981 .

[3]  Stephen E. Bechtold,et al.  Implicit modeling of flexible break assignments in optimal shift scheduling , 1990 .

[4]  Ehud Gudes,et al.  Combining rules and constraints for employee timetabling , 1997 .

[5]  D. Warner,et al.  A Mathematical Programming Model for Scheduling Nursing Personnel in a Hospital , 1972 .

[6]  Michael W. Carter,et al.  Work Force Size and Single Shift Schedules with Variable Demands , 1985 .

[7]  Rudy Hung.  Multiple-shift workforce scheduling under the 3–4 workweek with different weekday and weekend labor requirements , 1994 .

[8]  Ehud Gudes,et al.  Employee Timetabling, Constraint Networks and Knowledge-Based Rules: A Mixed Approach , 1995, PATAT.

[9]  D. Costa,et al.  A tabu search algorithm for computing an operational timetable , 1994 .

[10]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[11]  Rangarajan Narasimhan,et al.  An Algorithm For Multiple Shift Scheduling of Hierarchical Workforce On Four-Day Or Three-Day Workweeks , 2000 .

[12]  X. Cai,et al.  A genetic algorithm for scheduling staff of mixed skills under multi-criteria , 2000, Eur. J. Oper. Res..

[13]  Helmut Simonis,et al.  Application Development with the CHIP System , 1995, WLP.

[14]  J. L. Byrne,et al.  Scheduling of Toll Collectors , 1973 .

[15]  Nysret Musliu,et al.  Efficient generation of rotating workforce schedules , 2000, Discret. Appl. Math..

[16]  Dorit S. Hochbaum,et al.  Approximation Algorithms for the Set Covering and Vertex Cover Problems , 1982, SIAM J. Comput..

[17]  Gideon Schechtman,et al.  Randomized approximation of bounded multicovering problems , 1997, Algorithmica.

[18]  T. Grossman,et al.  Computational Experience with Approximation Algorithms for the Set Covering Problem , 1994 .

[19]  Dorit S. Hochbaum,et al.  A fast approximation algorithm for the multicovering problem , 1986, Discret. Appl. Math..

[20]  Michael J. Brusco,et al.  Constrained nurse staffing analysis , 1993 .

[21]  Nicolas Beldiceanu,et al.  Introducing global constraints in CHIP , 1994 .

[22]  Georges Weil,et al.  The Nurse Scheduling Problem: a Combinatorial Problem, Solved by the Combination of Constraint Programming and Real Users Heuristics , 1998, MedInfo.

[23]  Yves Caseau,et al.  A deductive and object-oriented approach to a complex scheduling problem , 2004, Journal of Intelligent Information Systems.

[24]  Kim Lin Chew.  Cyclic Schedule for Apron Services , 1991 .

[25]  Pascal Van Hentenryck.  Constraint satisfaction in logic programming , 1989, Logic programming.

[26]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[27]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[28]  William L. Berry,et al.  Heuristic Methods for Telephone Operator Shift Scheduling: An Experimental Analysis , 1976 .

[29]  J. Beasley,et al.  A genetic algorithm for the set covering problem , 1996 .

[30]  Larry W. Jacobs,et al.  Optimal Models for Meal-Break and Start-Time Flexibility in Continuous Tour Scheduling , 2000 .

[31]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[32]  James J. Browne,et al.  Introduction to Employee Scheduling , 1992 .

[33]  Manuel Laguna,et al.  Tabu Search , 1997 .

[34]  Georges Weil,et al.  Cyclical Staff Scheduling Using Constraint Logic Programming , 2000, PATAT.

[35]  George M. White,et al.  A logic approach to the resolution of constraints in timetabling , 1992 .

[36]  Hamilton Emmons,et al.  Off-Day Scheduling with Hierarchical Worker Categories , 1991, Oper. Res..

[37]  Brigitte Jaumard,et al.  A generalized linear programming model for nurse scheduling , 1996, Eur. J. Oper. Res..

[38]  Helmut Simonis,et al.  Modelling Producer/Consumer Constraints , 1995, CP.

[39]  M. J. Maher,et al.  Model Building in Mathematical Programming , 1978 .

[40]  Marco Chiarandini,et al.  Solving Employee Timetabling Problems with Flexible Workload using Tabu Search , 2002 .

[41]  Larry W. Jacobs,et al.  A simulated annealing approach to the cyclic staff-scheduling problem , 1993 .

[42]  Kenneth R. Baker,et al.  Workforce Allocation in Cyclical Scheduling Problems: A Survey , 1976 .

[43]  Raymond Trémolières,et al.  Le problème des roulements de quarts pour les entreprises à feu continu , 1976 .

[44]  Nagraj Balakrishnan,et al.  A network model for the rotating workforce scheduling problem , 1990, Networks.

[45]  Gilbert Laporte,et al.  The art and science of designing rotating schedules , 1999, J. Oper. Res. Soc..

[46]  H. D. Ratliff,et al.  Unnetworks, with Applications to Idle Time Scheduling , 1978 .

[47]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[48]  Bart Selman,et al.  Boosting Combinatorial Search Through Randomization , 1998, AAAI/IAAI.

[49]  Kenneth R. Baker,et al.  Scheduling a Full-Time Workforce to Meet Cyclic Staffing Requirements , 1974 .

[50]  Oktay Günlük,et al.  An integer programming model for the weekly tour scheduling problem , 2001 .

[51]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[52]  Reuven Bar-Yehuda,et al.  A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem , 1981, J. Algorithms.

[53]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[54]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[55]  Kenneth R. Baker,et al.  Workforce Scheduling with Cyclic Demands and Day-Off Constraints , 1977 .

[56]  Marco Schaerf,et al.  Local Search Techniques for High School Timetabling , 1995 .

[57]  E. Jacquet-Lagreze,et al.  The shift scheduling problem : different formulations and solution methods , 1998 .

[58]  Jonathan F. Bard,et al.  Solving large-scale tour scheduling problems , 1994 .

[59]  Jean-Charles Pomerol,et al.  Systèmes interactifs d'aide à la décision et systèmes experts , 1989 .

[60]  T. Aykin.  Optimal Shift Scheduling with Multiple Break Windows , 1996 .

[61]  Georges Weil,et al.  Constraint programming for nurse scheduling , 1995 .

[62]  Kamel Heus.  Gestion des plannings infirmiers : application des techniques de programmation par contraintes , 1996 .

[63]  A. Eiben.  Evolutionary algorithms and constraint satisfaction: definitions, survey, methodology, and research directions , 2001 .

[64]  Colin Potts,et al.  Design of Everyday Things , 1988 .

[65]  George B. Dantzig,et al.  Letter to the Editor - A Comment on Edie's "Traffic Delays at Toll Booths" , 1954, Oper. Res..

[66]  M. Segal,et al.  The Operator-Scheduling Problem: A Network-Flow Approach , 1974, Oper. Res..

[67]  Lars Vestergaard Kragelund.  Solving a timetabling problem using hybrid genetic algorithms , 1997 .