UNIVERSITE PARIS VII - DENIS DIDEROT U.F.R. D'INFORMATIQUE

[1]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[2]  Giovanni Rinaldi,et al.  A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

[3]  Nancy Wogrin,et al.  Rule-Based Programming With Ops 5 , 1988 .

[4]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[5]  Takeshi Yamada,et al.  A Genetic Algorithm Applicable to Large-Scale Job-Shop Problems , 1992, PPSN.

[6]  Ramón Alvarez-Valdés Olaguíbel,et al.  Chapter 5 – HEURISTIC ALGORITHMS FOR RESOURCE-CONSTRAINED PROJECT SCHEDULING: A REVIEW AND AN EMPIRICAL ANALYSIS , 1989 .

[7]  Egon Balas,et al.  Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm , 1969, Oper. Res..

[8]  Judea Pearl,et al.  Heuristics : intelligent search strategies for computer problem solving , 1984 .

[9]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

[10]  Nils Klarlund,et al.  Graph types , 1993, POPL '93.

[11]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[12]  S. L. van de Velde,et al.  Machine scheduling and Lagrangian relaxation , 1991 .

[13]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Local Search , 1996, INFORMS J. Comput..

[14]  Giovanni Rinaldi,et al.  Computational results with a branch and cut code for the capacitated vehicle routing problem , 1998 .

[15]  François Laburthe,et al.  Cumulative Scheduling with Task Intervals , 1996, JICSLP.

[16]  Gotha.  Les problèmes d'ordonnancement , 1993 .

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

[18]  J. Barnes,et al.  Solving the job shop scheduling problem with tabu search , 1995 .

[19]  Maurice Nivat,et al.  Reconstructing Convex Polyominoes from Horizontal and Vertical Projections , 1996, Theor. Comput. Sci..

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

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

[22]  Mauro Dell'Amico,et al.  Applying tabu search to the job-shop scheduling problem , 1993, Ann. Oper. Res..

[23]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

[24]  Egon Balas,et al.  Implementation of a Linear Time Algorithm for Certain Generalized Traveling Salesman Problems , 1996, IPCO.

[25]  Roseaux,et al.  Exercices et problèmes résolus de recherche opérationnelle , 1987 .

[26]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[27]  L. Krajewski,et al.  Operations Management , 1994 .

[28]  Claude Le Pape,et al.  Implementation of resource constraints in ILOG SCHEDULE: a library for the development of constraint-based scheduling systems , 1994 .

[29]  Michel Gendreau,et al.  An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows , 1998, Transp. Sci..

[30]  Ralph E. Gomory,et al.  An algorithm for integer solutions to linear programs , 1958 .

[31]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[32]  Jean-Yves Potvin,et al.  A parallel route building algorithm for the vehicle routing and scheduling problem with time windows , 1993 .

[33]  Krzysztof R. Apt,et al.  From Chaotic Iteration to Constraint Propagation , 1997, ICALP.

[34]  L. Bodin.  ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .

[35]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

[36]  J. Beasley.  An algorithm for set covering problem , 1987 .

[37]  Martín Abadi,et al.  Formal Parametric Polymorphism , 1993, Theor. Comput. Sci..

[38]  J. Erschler,et al.  Raisonnement temporel sous contraintes de ressource et problèmes d'ordonnancement , 1991 .

[39]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[40]  Robert A. Russell,et al.  Hybrid Heuristics for the Vehicle Routing Problem with Time Windows , 1995, Transp. Sci..

[41]  Jean-francois Puget,et al.  A C++ implementation of CLP , 1997 .

[42]  Paul M. Thompson,et al.  Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems , 1993, Oper. Res..

[43]  Jacques Desrosiers,et al.  An Optimal Algorithm for the Traveling Salesman Problem with Time Windows , 1991, Oper. Res..

[44]  D. de Werra,et al.  An introduction to timetabling , 1985 .

[45]  Jean-Charles Régin,et al.  A Filtering Algorithm for Constraints of Difference in CSPs , 1994, AAAI.

[46]  Erwin Pesch,et al.  Evolution based learning in a job shop scheduling environment , 1995, Comput. Oper. Res..

[47]  Pierre Lopez.  Approche énergétique pour l'ordonnancement de tâches sous contraintes de temps et de ressources. (Energy-based approach for task scheduling under time and resource constraints) , 1991 .

[48]  Yves Caseau.  Étude et réalisation d'un langage objet : lore , 1987 .

[49]  J. Carlier,et al.  Adjustment of heads and tails for the job-shop problem , 1994 .

[50]  Richard E. Korf,et al.  Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..

[51]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

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

[53]  Pascal Van Hentenryck,et al.  The Cardinality Operator: A New Logical Connective for Constraint Logic Programming , 1990, WCLP.

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

[55]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[56]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[57]  Henri Beringer,et al.  A CLP Language Handling Disjunctions of Linear Constraints , 1993, ICLP.

[58]  Vasek Chvátal,et al.  Edmonds polytopes and a hierarchy of combinatorial problems , 1973, Discret. Math..

[59]  J. Carlier,et al.  Une méthode arborescente pour résoudre les problèmes cumulatifs , 1991 .

[60]  Gilbert Laporte,et al.  New Insertion and Postoptimization Procedures for the Traveling Salesman Problem , 1992, Oper. Res..

[61]  Erik Demeulemeester,et al.  New Benchmark Results for the Resource-Constrained Project Scheduling Problem , 1997 .

[62]  William J. Cook,et al.  A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

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

[64]  Alexander A. Stepanov,et al.  C++ Standard Template Library , 2000 .

[65]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[66]  Gert Smolka,et al.  Encapsulated Search for Higher-order Concurrent Constraint Programming , 1994, ILPS.

[67]  Yves Rochat,et al.  Probabilistic diversification and intensification in local search for vehicle routing , 1995, J. Heuristics.

[68]  Gert Smolka.  The Oz Programming Model , 1996 .

[69]  Yves Caseau,et al.  Constraint satisfaction with an object-oriented knowledge representation language , 1994, Applied Intelligence.

[70]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[71]  J M Wilson.  Optimization and Computational Logic , 1998, J. Oper. Res. Soc..

[72]  Gordon F. Royle,et al.  Graph Domination, Tabu Search and the Football Pool Problem , 1997, Discret. Appl. Math..

[73]  J. M. Tamarit,et al.  Project scheduling with resource constraints: A branch and bound approach , 1987 .

[74]  Philippe Baptiste,et al.  A Theoretical and Experimental Comparison of Constraint Propagation Techniques for Disjunctive Scheduling , 1995, IJCAI.

[75]  François Laburthe,et al.  Solving Small TSPs with Constraints , 1997, ICLP.

[76]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[77]  Martin W. P. Savelsbergh,et al.  Local search in routing problems with time windows , 1984 .

[78]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[79]  Edmond Schonberg,et al.  Programming with Sets: An Introduction to SETL , 1986 .

[80]  Matthew L. Ginsberg,et al.  Limited Discrepancy Search , 1995, IJCAI.

[81]  Bertrand Meyer,et al.  Eiffel: The Language , 1991 .

[82]  Nicolas Beldiceanu,et al.  Extending CHIP in order to solve complex scheduling and placement problems , 1993, JFPL.

[83]  Martin E. Dyer,et al.  Formulating the single machine sequencing problem with release dates as a mixed integer program , 1990, Discret. Appl. Math..

[84]  Joxan Jaffar,et al.  Constraint logic programming , 1987, POPL '87.

[85]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

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

[87]  Jonathan F. Bard,et al.  A GRASP for the Vehicle Routing Problem with Time Windows , 1995, INFORMS J. Comput..

[88]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[89]  Jack Edmonds,et al.  Matroids and the greedy algorithm , 1971, Math. Program..

[90]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

[91]  Jacques Desrosiers,et al.  A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems , 1998 .

[92]  Michael W. Carter,et al.  OR Practice - A Survey of Practical Applications of Examination Timetabling Algorithms , 1986, Oper. Res..

[93]  G. Reinelt.  The traveling salesman: computational solutions for TSP applications , 1994 .

[94]  François Laburthe,et al.  Improved CLP Scheduling with Task Intervals , 1994, ICLP.

[95]  Rainer Kolisch,et al.  Characterization and generation of a general class of resource-constrained project scheduling problems , 1995 .

[96]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[97]  Jean-Louis Laurière,et al.  A Language and a Program for Stating and Solving Combinatorial Problems , 1978, Artif. Intell..