images

2016

MAGOULÈS Frédéric, ZHAO Hai-Xiang
Data Mining and Machine Learning in Building Energy Analysis

2015

BARBIER Franck, RECOUSSINE Jean-Luc
COBOL Software Modernization: From Principles to Implementation with the BLU AGE® Method

CHEN Ken
Performance Evaluation by Simulation and Analysis with Applications to Computer Networks

CLERC Maurice
Guided Randomness in Optimization (Metaheuristics Set - Volume 1)

DURAND Nicolas, GIANAZZA David, GOTTELAND Jean-Baptiste, ALLIOT Jean-Marc
Metaheuristics for Air Traffic Management (Metaheuristics Set - Volume 2)

MAGOULÈS Frédéric, ROUX François-Xavier, HOUZEAUX Guillaume Parallel Scientific Computing

MUNEESAWANG Paisarn, YAMMEN Suchart
Visual Inspection Technology in the Hard Disk Drive Industry

2014

BOULANGER Jean-Louis
Formal Methods Applied to Industrial Complex Systems

BOULANGER Jean-Louis
Formal Methods Applied to Complex Systems: Implementation of the B Method

GARDI Frédéric, BENOIST Thierry, DARLAY Julien, ESTELLON Bertrand, MEGEL Romain
Mathematical Programming Solver based on Local Search

KRICHEN Saoussen, CHAOUACHI Jouhaina
Graph-related Optimization and Decision Support Systems

LARRIEU Nicolas, VARET Antoine
Rapid Prototyping of Software for Avionics Systems: Model-oriented Approaches for Complex Systems Certification

OUSSALAH Mourad Chabane
Software Architecture 1
Software Architecture 2

PASCHOS Vangelis Th
Combinatorial Optimization – 3-volume series, 2nd Edition
Concepts of Combinatorial Optimization – Volume 1, 2nd Edition
Problems and New Approaches – Volume 2, 2nd Edition
Applications of Combinatorial Optimization – Volume 3, 2nd Edition

QUESNEL Flavien
Scheduling of Large-scale Virtualized Infrastructures: Toward Cooperative Management

RIGO Michel
Formal Languages, Automata and Numeration Systems 1: Introduction to Combinatorics on Words
Formal Languages, Automata and Numeration Systems 2: Applications to Recognizability and Decidability

SAINT-DIZIER Patrick
Musical Rhetoric: Foundations and Annotation Schemes

TOUATI Sid, DE DINECHIN Benoit
Advanced Backend Optimization

2013

ANDRÉ Etienne, SOULAT Romain
The Inverse Method: Parametric Verification of Real-time Embedded Systems

BOULANGER Jean-Louis
Safety Management for Software-based Equipment

DELAHAYE Daniel, PUECHMOREL Stéphane
Modeling and Optimization of Air Traffic

FRANCOPOULO Gil
LMF — Lexical Markup Framework

GHÉDIRA Khaled
Constraint Satisfaction Problems

ROCHANGE Christine, UHRIG Sascha, SAINRAT Pascal Time-Predictable Architectures

WAHBI Mohamed
Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems

ZELM Martin et al.
Enterprise Interoperability

2012

ARBOLEDA Hugo, ROYER Jean-Claude
Model-Driven and Software Product Line Engineering

BLANCHET Gérard, DUPOUY Bertrand
Computer Architecture

BOULANGER Jean-Louis
Industrial Use of Formal Methods: Formal Verification

BOULANGER Jean-Louis
Formal Method: Industrial Use from Model to the Code

CALVARY Gaëlle, DELOT Thierry, SÈDES Florence, TIGLI Jean-Yves
Computer Science and Ambient Intelligence

MAHOUT Vincent
Assembly Language Programming: ARM Cortex-M3 2.0: Organization, Innovation and Territory

MARLET Renaud
Program Specialization

SOTO Maria, SEVAUX Marc, ROSSI André, LAURENT Johann
Memory Allocation Problems in Embedded Systems: Optimization Methods

2011

BICHOT Charles-Edmond, SIARRY Patrick
Graph Partitioning

BOULANGER Jean-Louis
Static Analysis of Software: The Abstract Interpretation

CAFERRA Ricardo
Logic for Computer Science and Artificial Intelligence

HOMES Bernard
Fundamentals of Software Testing

KORDON Fabrice, HADDAD Serge, PAUTET Laurent, PETRUCCI Laure
Distributed Systems: Design and Algorithms

KORDON Fabrice, HADDAD Serge, PAUTET Laurent, PETRUCCI Laure
Models and Analysis in Distributed Systems

LORCA Xavier
Tree-based Graph Partitioning Constraint

TRUCHET Charlotte, ASSAYAG Gerard
Constraint Programming in Music

VICAT-BLANC PRIMET Pascale et al.
Computing Networks: From Cluster to Cloud Computing

2010

AUDIBERT Pierre
Mathematics for Informatics and Computer Science

BABAU Jean-Philippe et al.
Model Driven Engineering for Distributed Real-Time Embedded Systems 2009

BOULANGER Jean-Louis
Safety of Computer Architectures

MONMARCHE Nicolas et al.
Artificial Ants

PANETTO Hervé, BOUDJLIDA Nacer
Interoperability for Enterprise Software and Applications 2010

PASCHOS Vangelis Th
Combinatorial Optimization – 3-volume series
Concepts of Combinatorial Optimization – Volume 1
Problems and New Approaches – Volume 2
Applications of Combinatorial Optimization – Volume 3

SIGAUD Olivier et al.
Markov Decision Processes in Artificial Intelligence

SOLNON Christine
Ant Colony Optimization and Constraint Programming

AUBRUN Christophe, SIMON Daniel, SONG Ye-Qiong et al.
Co-design Approaches for Dependable Networked Control Systems

2009

FOURNIER Jean-Claude
Graph Theory and Applications

GUEDON Jeanpierre
The Mojette Transform / Theory and Applications

JARD Claude, ROUX Olivier
Communicating Embedded Systems / Software and Design

LECOUTRE Christophe
Constraint Networks / Targeting Simplicity for Techniques and Algorithms

2008

BANÂTRE Michel, MARRÓN Pedro José, OLLERO Hannibal, WOLITZ Adam
Cooperating Embedded Systems and Wireless Sensor Networks

MERZ Stephan, NAVET Nicolas
Modeling and Verification of Real-time Systems

PASCHOS Vangelis Th
Combinatorial Optimization and Theoretical Computer Science: Interfaces and Perspectives

WALDNER Jean-Baptiste
Nanocomputers and Swarm Intelligence

2007

BENHAMOU Frédéric, JUSSIEN Narendra, O’SULLIVAN Barry
Trends in Constraint Programming

JUSSIEN Narendra
A to Z of Sudoku

2006

BABAU Jean-Philippe et al.
From MDD Concepts to Experiments and Illustrations – DRES 2006

HABRIAS Henri, FRAPPIER Marc
Software Specification Methods

MURAT Cecile, PASCHOS Vangelis Th
Probabilistic Combinatorial Optimization on Graphs

PANETTO Hervé, BOUDJLIDA Nacer
Interoperability for Enterprise Software and Applications 2006 / IFAC-IFIP I-ESA’2006

2005

GÉRARD Sébastien et al.
Model Driven Engineering for Distributed Real Time Embedded Systems

PANETTO Hervé
Interoperability of Enterprise Software and Applications 2005

Bibliography

  1. [ABD 04] ABDELMAGUID T.F., NASSEF A.O., KAMAL B.A. et al., “A hybrid GA/heuristic approach to the simultaneous scheduling of machines and automated guided vehicles”, International Journal of Production Research, vol. 42, no. 2, pp. 267–281, 2004.
  2. [ABO 11] ABO-HAMAD W., ARISHA A., “Simulation-optimisation methods in supply chain applications: a review”, The Irish Journal of Management, vol. 30, no. 2, pp. 95–124, 2011.
  3. [ADU 15] ADULYASAK Y., CORDEAUET J.F., JANS R., “The production routing problem: a review of formulations and solution algorithms”, Computers & Operations Research, vol. 55, pp. 141–152, 2015.
  4. [ALM 09] ALMEDER C., PREUSSER M., HARTL R.F., “Simulation and optimization of supply chains: alternative or complementary approaches?”, OR Spectrum, vol. 31, no. 1, pp. 95–119, 2009.
  5. [AND 10] ANDERSSON H., HOFF A., CHRISTIANSEN M. et al., “Industrial aspects and literature survey: combined inventory management and routing”, Computers & Operations Research, vol. 37, no. 9, pp. 1515–1536, 2010.
  6. [ARC 07] ARCHETTI C., BERTAZZI L., LAPORTEET G. et al., “A branch-and-cut algorithm for a vendor-managed inventory-routing problem”, Transportation Science, vol. 41, no. 3, pp. 382–391, 2007.
  7. [ARC 12] ARCHETTI C., BERTAZZI L., HERTZ A. et al., “A hybrid heuristic for an inventory routing problem”, INFORMS Journal on Computing, vol. 24, no. 1, pp. 101–116, 2012.
  8. [BEL 83] BELL W.J., DALBERTO L.M., FISHER M.L. et al., “Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer”, Interfaces, vol. 13, no. 6, pp. 4–23, 1983.
  9. [BIL 95] BILGE Ü., ULUSOY G., “A time window approach to simultaneous scheduling of machines and material handling system in an FMS”, Operations Research, vol. 43, no. 6, pp. 1058–1070, 1995.
  10. [BIX 99] BIXBY R., CHVÁTALET V., COOK W., Finding Tours in the TSP, Rheinische Friedrich-Wilhelms-Universität Bonn, 1999.
  11. [BLU 03] BLUM C., ROLI A., “Metaheuristics in combinatorial optimization: overview and conceptual comparison”, ACM Computing Surveys, vol. 35, pp. 268–308, 2003.
  12. [BLU 11] BLUM C., PUCHINGER J., RAIDLET G. et al., “Hybrid metaheuristics in combinatorial optimization: a survey”, Applied Soft Computing, vol. 11, pp. 4135–4151, 2011.
  13. [CAM 70] CAMPBELL H.G., DUDEK R.A., SMITH M.L., “A heuristic algorithm for the n job, m machine sequencing problem”, Management Science, vol. 16, no. 10, pp. 630–637, 1970.
  14. [CAM 04] CAMPBELL A.M., SAVELSBERGH M.W.P., “A decomposition approach for the inventory-routing problem”, Transportation Science, vol. 38, no. 4, pp. 488–502, 2004.
  15. [CHA 11] CHAUDHRY I.A., MAHMOOD S., SHAMI M., “Simultaneous scheduling of machines and automated guided vehicles in flexible manufacturing systems using genetic algorithms”, Journal of Central South University of Technology, vol. 18, no. 5, pp. 1473–1486, 2011.
  16. [CHR 77] CHRISTOFIDES N., Worst-case analysis of a new heuristic for the travelling salesman problem, Report 388, Carnegie-Mellon University, Pittsburgh, 1977.
  17. [CLE 04] CLERC M., “Discrete particle swarm optimization, illustrated by the traveling salesman problem” New Optimization Techniques in Engineering, Springer Berlin Heidelberg, pp. 219–239, 2004.
  18. [COE 13] COELHO L.C., CORDEAUET J.F., LAPORTE G., “Thirty years of inventory routing”, Transportation Science, vol. 48, no. 1, pp. 1–19, 2013.
  19. [COL 91] COLORNI A., DORIGO M., MANIEZZO V., “Distributed optimization by ant colonies”, 1st European Conference on Artificial Life, Paris, pp. 134–142, 1991.
  20. [COO 08] COOREN Y., CLERC M., SIARRY P., “Initialization and displacement of the particles in TRIBES, a parameter-free particle swarm optimization algorithm”, Adaptive and Multilevel Metaheuristics, Springer Berlin Heidelberg, pp. 199–219, 2008.
  21. [CUD 15] CUDA R., GUASTAROBA G., SPERANZA M.G., “A survey on two-echelon routing problems”, Computers & Operations Research, vol. 55, pp. 185–199, 2015.
  22. [DAG 98] DA GAMA F.S., CAPTIVO M.E., “A heuristic approach for the discrete dynamic location problem”, Location Science, vol. 6, pp. 211–223, 1998.
  23. [DAN 90] DANTZIG G.B., Origins of the Simplex Method, ACM Digital Library, pp. 141–151, 1990.
  24. [DER 02] DEROUSSI L., Heuristiques, métaheuristiques et systèmes de voisinage: application à des problèmes théoriques et industriels de type TSP et ordonnancement, PhD Thesis, University Blaise Pascal, Clermont-Ferrand, 2002.
  25. [DER 05] DEROUSSI L., GOURGAND M., NORRE S., “An efficient PSO for combinatorial optimization”, International Conference on Industrial Engineering and Systems Management (IESM), Marrakech, Morocco, 2005.
  26. [DER 06] DEROUSSI L., NORREET S.M., GOURGAND, New effective neighborhoods for the permutation flow shop problem, Research report LIMOS RR-06-09, 2006.
  27. [DER 08] DEROUSSI L., GOURGAND M., TCHERNEV N., “A simple metaheuristic approach to the simultaneous scheduling of machines and automated guided vehicles”, International Journal of Production Research, vol. 46, no. 8, pp. 2143–2164, 2008.
  28. [DER 12] DERBEL H., JARBOUI B., HANAFI S. et al., “Genetic algorithm with iterated local search for solving a location-routing problem”, Expert Systems with Applications, vol. 39, no. 3, pp. 2865–2871, 2012.
  29. [DER 13] DEROUSSI L., GOURGAND M., “A scheduling approach for the design of flexible manufacturing systems”, in SIARRY P. (ed.), Heuristics: Theory and Applications, Nova Science Publishers, pp. 223–244, 2013.
  30. [DER 14] DEROUSSI L., GRANGEON N., NORRE S., “Techniques d’hybridation à base de métaheuristiques pour optimiser des systèmes logistiques”, Métaheuristiques, Eyrolles, pp. 363–386, 2014.
  31. [DES 96] DESAI R., PATIL R., “SALO: combining simulated annealing and local optimization for efficient global optimization”, Proceedings of the 9th Florida AI Research Symposium (FLAIRS), pp. 233–237, 1996.
  32. [DIM 00] DIMACS TSP CHALLENGE, Library of instances for the TSP, available at http://dimacs.rutgers.edu/Challenges/TSP/, 2000.
  33. [DIM 03] DUMITRESCU I., STÜTZLE T., “Combinations of local search and exact algorithms”, Applications of Evolutionary Computing, Springer Berlin Heidelberg, pp. 211–223, 2003.
  34. [DOR 97] DORIGO M., GAMBARDELLA L.M., “Ant colony system: a cooperative learning approach to the traveling salesman problem”, IEEE Transactions on Evolutionary Computation, vol. 1, no. 1, pp. 53–66, 1997.
  35. [DOU 13] DOULABI S.H.H., SEIFI A., “Lower and upper bounds for location-arc routing problems with vehicle capacity constraints”, European Journal of Operational Research, vol. 224, no. 1, pp. 189–208, 2013.
  36. [DRE 97] DREXL A., KIMMS A., “Lot sizing and scheduling–survey and extensions”, European Journal of Operational Research, vol. 99, no. 2, pp. 221–235, 1997.
  37. [DRE 15] DREXL M., SCHNEIDER M., “A survey of variants and extensions of the location-routing problem”, European Journal of Operational Research, vol. 241, pp. 283–308, 2015.
  38. [DRI 07] DRIRA A., PIERREVALET H., HAJRI-GABOUJ S., “Facility layout problems: a survey”, Annual Reviews in Control, vol. 31, no. 2, pp. 255–267, 2007.
  39. [DUH 11] DUHAMEL C., LACOMME P., PRODHON C., “Efficient frameworks for greedy split and new depth first search split procedures for routing problems”, Computers & Operations Research, vol. 38, no. 4, pp. 723–739, 2011.
  40. [EBE 95] EBERHART R.C., KENNEDY J., “A new optimizer using particle swarm theory”, Proceedings of the 6th International Symposium on Micro Machine and Human Science, vol. 1, pp. 39–43, 1995.
  41. [EDM 65] EDMONDS J., “Paths, trees, and flowers”, Canadian Journal of Mathematics, vol. 17, no. 3, pp. 449–467, 1965.
  42. [FEO 95] FEO T.A., RESENDE M.G., “Greedy randomized adaptive search procedures”, Journal of Global Optimization, vol. 6, no. 2, pp. 109–133, 1995.
  43. [FLE 93] FLEURY G., Méthodes stochastiques et déterministes pour les problèmes NP-difficiles, PhD Thesis, University Blaise Pascal, Clermont-Ferrand, 1993.
  44. [FLE 02] FLESZAR K., HINDI K.S., “New heuristics for one-dimensional bin-packing”, Computers & Operations Research, vol. 29, no. 7, pp. 821–839, 2002.
  45. [FOR 61] FORRESTER J.W., Industrial Dynamics, MIT Press, Cambridge, MA, 1961.
  46. [FRE 95] FREDMAN M.L., JOHNSON D.S., MCGEOCH L.A. et al., “Data structures for traveling salesmen”, Journal of Algorithms, vol. 18, no. 3, pp. 432–479, 1995.
  47. [FRE 96] FREISLEBEN B., MERZ P., “A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems”, Evolutionary Computation, Proceedings of IEEE International Conference on, pp. 616–621, 1996.
  48. [GAM 05] GAMBOA D., REGO C., GLOVER F., “Data structures and ejection chains for solving large-scale traveling salesman problems”, European Journal of Operational Research, vol. 160, no. 1, pp. 154–171, 2005.
  49. [GAN 95] GANESHAN R., HARRISON T.P., An introduction to supply chain management, Department of Management Science and Information Systems, Penn State University, 1995.
  50. [GLO 92] GLOVER F., “New ejection chain and alternating path methods for traveling salesman problems”, Computer Science and Operations Research, pp. 449–509, 1992.
  51. [GOL 89] GOLBERG D.E., Genetic Algorithms in Search, Optimization, and Machine Learning, Addison Wesley, 1989.
  52. [HAJ 88] HAJEK B., “Cooling schedules for optimal annealing”, Mathematics of Operations Research, vol. 13, pp. 311–329, 1988.
  53. [HEL 00] HELSGAUN K., “An effective implementation of the Lin-Kernighan traveling salesman heuristic”, European Journal of Operational Research, vol. 126, no. 1, pp. 106–130, 2000.
  54. [HOL 75] HOLLAND J.H., Adaptation in Natural and Artificial Systems: an Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence, University Michigan Press, 1975.
  55. [JOH 54] JOHNSON S.M., “Optimal two- and three-stage production schedules with setup times included”, Naval Res. Log. Quart. I, pp. 61–68, 1954.
  56. [JOU 09] JOURDAN L., BASSEURET M., TALBI E.G., “Hybridizing exact methods and metaheuristics: a taxonomy”, European Journal of Operational Research, vol. 199, no. 3, pp. 620–629, 2009.
  57. [KAR 84] KARMARKAR N., A new polynomial-time algorithm for linear programming, Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing, ACM, pp. 302–311, 1984.
  58. [KIR 83] KIRKPATRICK S., VECCHI M.P., “Optimization by simulated annealing”, Science, vol. 220, pp. 671–680, 1983.
  59. [KOO 57] KOOPMANS T.C., BECKMAN M., “Assignment problems and the location of economic activities”, Econometric, vol. 25, pp. 53–76, 1957.
  60. [KOU 06] KOUVELIS P., CHAMBERS C., WANG, “Supply chain management research and production and operations management: review, trends, and opportunities”, Production and Operations Management, vol. 15, no. 3, pp. 449–469, 2006.
  61. [KRU 56] KRUSKAL J.B., “On the shortest spanning subtree of a graph and the traveling salesman problem”, Proceedings of the American Mathematical Society, vol. 7, pp. 48–50, 1956.
  62. [KUH 55] KUHN H.W., “The Hungarian method for the assignment problem”, Naval Research Logistics Quarterly, vol. 2, pp. 83–97, 1955.
  63. [LAC 13] LACOMME P., LARABI M., TCHERNEV N., “Job-shop based framework for simultaneous scheduling of machines and automated guided vehicles”, International Journal of Production Economics, vol. 143, no. 1, pp. 24–34, 2013.
  64. [LEA 06] LE-ANH T., DE KOSTER M.B.M., “A review of design and control of automated guided vehicle systems”, European Journal of Operational Research, vol. 171, no. 1, pp. 1–23,2006.
  65. [LEM 08] LEMOINE D., Modèles génériques et méthodes de résolution pour la planification tactique mono-site et multi-site, PhD Thesis, University Blaise Pascal, France, 2008.
  66. [LEN 77] LENSTRA J.K., KANET A.R., BRUCKER P., “Complexity of machine scheduling problems”, Annals of Discrete Mathematics, vol. 1, pp. 343–362, 1977.
  67. [LIN 73] LIN S., KERNIGHAN B.W., “An effective heuristic algorithm for the travelingsalesman problem”, Operations Research, vol. 21, no. 2, pp. 498–516, 1973.
  68. [LOU 01] LOURENÇO H., Supply chain management: an opportunity for metaheuristics, UPF Economics and Business Working Paper 538, 2001.
  69. [LOU 03] LOURENÇO H., MARTIN O.C., STÜTZLE T., Iterated Local Search, Springer, 2003.
  70. [MAN 60] MANNE A.S., “On the job-shop scheduling problem”, Operations Research, vol. 8, no. 2, pp. 219–223, 1960.
  71. [MAR 92] MARTIN O., OTTO S.W., FELTEN E.W., “Large-step Markov chains for the TSP incorporating local search heuristics”, Operations Research Letters, vol. 11, no. 4, pp. 219–224, 1992.
  72. [MAR 96] MARTIN O., OTTO S.W., “Combining simulated annealing with local search heuristic”, Annals of Operations Letters, vol. 63, pp. 57–75, 1996.
  73. [MIR 06] MIRAGLIOTTA G., “Layers and mechanisms: a new taxonomy for the bullwhip effect”, International Journal of Production Economics, vol. 104, no. 2, pp. 365–381, 2006.
  74. [MJI 14] MJIRDA A., JARBOUI B., MACEDO R. et al., “A two phase variable neighborhood search for the multi-product inventory routing problem”, Computers & Operations Research, vol. 52, pp. 291–299, 2014.
  75. [MLA 97] MLADENOVIC N., HANSEN P., “Variable neighborhood search”, Computers & Operations Research, vol. 24, no. 11, pp. 1097–1100, 1997.
  76. [MOI 11] MOIN N.H., SALHI S., AZIZ N.A.B., “An efficient hybrid genetic algorithm for the multi-product multi-period inventory routing problem”, International Journal of Production Economics, vol. 133, no. 1, pp. 334–343, 2011.
  77. [MOS 89] MOSCATO P., On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms, Caltech concurrent computation program, C3P Report826, 1989.
  78. [MUN 57] MUNKRES J., “Algorithms for the assignment and transportation problems”, Journal of the Society for Industrial & Applied Mathematics, vol. 5, pp. 32–38, 1957.
  79. [NAG 07] NAGY G., SALHI S., “Location-routing: issues, models and methods”, European Journal of Operational Research, vol. 177, no. 2, pp. 649–672, 2007.
  80. [NAW 83] NAWAZ M., ENSCORE E.E., HAM I., “A heuristic algorithm for the mmachine, n-job flow-shop sequencing problem”, Omega, vol. 11, no. 1, pp. 91–95, 1983.
  81. [NOR 05] NORRE S., Heuristiques et métaheuristiques pour la résolution de problèmes d’optimisation combinatoire dans les systèmes de production, Habilitation thesis, 2005.
  82. [OLI 82] OLIVER R.K., WEBBER M.D., “Supply-chain management: logistics catches up with strategy”, Outlook, vol. 5, no. 1, pp. 42–47, 1982.
  83. [ORL 75] ORLICKY J., “MRP: material requirements planning”, The New Way of Life in Production and Inventory Management, McGraw Hill, 1975.
  84. [OSM 96] OSMAN I.H., LAPORTE G., “Metaheuristics: a bibliography”, Annals of Operations Research, vol. 63, pp. 513–623, 1996.
  85. [PRI 57] PRIM R.C., “Shortest connection networks and some generalizations”, Bell System Technical Journal, vol. 36, pp. 1389–1401, 1957.
  86. [PRI 07] PRINS C., PRODHON C., RUIZ A. et al., “Solving the capacitated locationrouting problem by a cooperative Lagrangean relaxation granular Tabu search heuristic”, Transportation Science, vol. 41, no. 4, pp. 470–483, 2007.
  87. [PRO 14] PRODHON C., PRINS C., “A survey of recent research on location-routing problems”, European Journal of Operational Research, vol. 238, pp. 1–17, 2014.
  88. [PUC 05] PUCHINGER J., RAIDL G.R., Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: a Survey and Classification, Springer Berlin Heidelberg, 2005.
  89. [RED 06] REDDY B.S.P., RAO C.S.P., “A hybrid multi-objective GA for simultaneous scheduling of machines and AGVs in FMS”, The International Journal of Advanced Manufacturing Technology, vol. 31, pp. 602–613, 2006.
  90. [REG 98] REGO C., “Relaxed tours and path ejections for the traveling salesman problem” European Journal of Operational Research, vol. 106, no. 2, pp. 522–538, 1998.
  91. [REI 91] REINELT G., “TSPLIB–a traveling salesman problem library”, Orsa Journal on Computing, vol. 3, no. 4, pp. 376–384, 1991.
  92. [REI 94] REINELT G., The Traveling-Salesman: Computational Solutions for TSP Applications, Springer, 1994.
  93. [ROS 77] ROSENKRANTZ D.J., STEARNS R.E., LEWIS P.M. II, “An analysis of several heuristics for the traveling salesman problem”, SIAM Journal on Computing, vol. 6, no. 3, pp. 563–581, 1977.
  94. [SIM 03] SIMCHI-LEVI D., KAMINSKYET P., SIMCHI-LEVI E., Designing and Managing the Supply Chain: Concepts, Strategies, and Case Studies, McGraw-Hill, 2003.
  95. [STO 97] STORN R., PRICE K., “Differential evolution–a simple and efficient heuristic for global optimization over continuous spaces”, Journal of Global Optimization, vol. 11, no. 4, pp. 341–359, 1997.
  96. [STÜ 97] STÜTZLE T., HOOS H., “MAX-MIN ant system and local search for the traveling salesman problem”, Evolutionary Computation, IEEE International Conference on, pp. 309–314, 1997.
  97. [STÜ 98] STÜTZLE T., Applying iterated local search to the permutation flow shop problem, FG Intellektik, TU Darmstadt, Darmstadt, Germany, 1998.
  98. [TAI 90] TAILLARD E., “Some efficient heuristic methods for the flow shop sequencing problem”, European Journal of Operational Research, vol. 47, pp. 67–74, 1990.
  99. [TAI 15] TAILLARD E., Taillard’s instances, available at http://mistic.heigvd.ch/taillard/problemes.dir/ordonnancement.dir/ordonnancement.html, 2015.
  100. [TAL 02] TALBI E.G., “A taxonomy of hybrid metaheuristics”, Journal of Heuristics, vol. 8, no. 5, pp. 541–564, 2002.
  101. [TIN 13] TING C.J., CHEN C.H., “A multiple ant colony optimization algorithm for the capacitated location routing problem”, International Journal of Production Economics, vol. 141, pp. 34–44, 2013.
  102. [ÜLU 93] ÜLUSOY G., BILGE U., “Simultaneous scheduling of machines and automated guided vehicles”, International Journal of Production Research, vol. 31, pp. 2857–2873, 1993.
  103. [ÜLU 97] ÜLUSOY G., SIVRIKAYA-SERIFOGLU F., BILGE U., “A genetic algorithm approach to the simultaneous scheduling of stations and automated guided vehicles”, Computers Operations Research, vol. 24, pp. 335–351, 1997.
  104. [VIS 06] VIS I.F., “Survey of research in the design and control of automated guided vehicle systems”, European Journal of Operational Research, vol. 170, no. 3, pp. 677–709, 2006.
  105. [WAG 58] WAGNER H.M., WHITIN T.M., “A dynamic version of the economic lot size model”, Management Science, vol. 5, pp. 89–96, 1958.
  106. [WIG 84] WIGHT O., Manufacturing Resource Planning: MRP II: Unlocking America’s Productivity Potential, Oliver Wight, 1984.
  107. [WIK 91] WIKNER J., TOWILL D.R., NAIM M., “Smoothing supply chain dynamics”, International Journal of Production Economics, vol. 22, no. 3, pp. 231–248, 1991.
  108. [WOL 97] WOLPERT D.H., MACREADY W.G., “No free lunch theorems for optimization”, IEEE Transactions on Evolutionary Computation, vol. 1, pp. 67–82, 1997.