La planification du personnel : acteurs, actions et termes multiples pour une planification opérationnelle des personnes

La planification des ressources humaines dans les entreprises est d'une tres grande complexite : elle associe de facon intime la vie sociale et familiale et les contraintes professionnelles a la fois des dirigeants de l'entreprise, des responsables fonctionnels, des responsables de proximite et des salaries. Les volumineux travaux publies dans ce domaine depuis de nombreuses decennies temoignent de l'interet economique et social que lui accorde la communaute scientifique internationale. L'un des objectifs de cette these est la caracterisation des differents problemes de planification et la synthese de differentes methodes de resolution. Les objectifs pratiques de la these sont l'analyse et l'implantation de methodes logicielles, s'appuyant sur la Programmation Par Contraintes (PPC). Ces travaux comprennent deux projets de collaboration entre l'Universite Joseph Fourier et l'industrie : Gymnaste (avec COSYTEC S.A.) et Equitime (avec EQUITIME S.A.). Un troisieme projet MOSAR a ete realise pour le compte du Ministere de la Justice. Par rapport aux methodes usuelles, ces travaux permettent de tenir compte des contraintes et preferences individuelles, grâce aux connaissances en la matiere que detiennent les utilisateurs en leur permettant de participer activement a la planification. La these a aussi permis de nombreuses contributions scientifiques autour du theme du modele a multiples niveaux d'agregation du temps. En effet, la legislation de travail en vigueur inclut diverses restrictions au niveau journalier, hebdomadaire, mensuel et annuel. Afin de produire des plannings, legaux respectant toutes ces restrictions, nous proposons de nouveaux modeles et methodes.

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

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

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

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

[5]  Toby Walsh,et al.  Proceedings of AAAI-96 , 1996 .

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

[7]  P. Kam,et al.  : 4 , 1898, You Can Cross the Massacre on Foot.

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

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

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

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

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

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

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

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

[16]  M. D. Wilkinson,et al.  Management science , 1989, British Dental Journal.

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

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

[19]  F. Glover,et al.  In Modern Heuristic Techniques for Combinatorial Problems , 1993 .

[20]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[21]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[22]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

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

[24]  R. Lewontin ‘The Selfish Gene’ , 1977, Nature.

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

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

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

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

[29]  David S. Munro,et al.  In: Software-Practice and Experience , 2000 .

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

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

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

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

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

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

[36]  J. A. Salvato John wiley & sons. , 1994, Environmental science & technology.

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

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

[39]  L. Goddard,et al.  Operations Research (OR) , 2007 .

[40]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

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

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

[43]  Gary M. Thompson Accounting for the Multi-Period Impact of Service When Determining Employee Requirements for Labor Scheduling , 1993 .