E. A. Adnen and E. Mohsen, An efficient new heuristic for the hoist scheduling problem, Computers & Operations Research, vol.67, pp.184-192, 2016.

H. M. Afsar, P. Lacomme, L. Ren, C. Prodhon, and D. Vigo, Resolution of a Job-Shop problem with transportation constraints: a master/slave approach, IFAC-PapersOnLine, vol.49, issue.12, pp.898-903, 2016.
URL : https://hal.archives-ouvertes.fr/hal-02081934

R. V. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory/Applications, 1993.

R. Alvarez-valdés and J. M. Tamarit, The project scheduling prolyhedron: Dimension, facets and lifting theorems, EJOR, vol.67, pp.204-220, 1993.

C. Artigues and F. Roubellat, A polynomial insertion algorithm in RCPSP with cumulative constraints and multiple nodes, EJOR, vol.127, issue.2, pp.297-316, 2000.

C. Artigues, P. Michelon, and S. Reusser, Insertion for static/dyn, RCPSP. EJOR, vol.149, pp.249-67, 2003.

J. E. Beasley, Route-first cluster-second methods for vehicle routing, Omega, vol.11, pp.403-408, 1983.

J. Blazewicz, J. K. Lenstra, and A. H. Rinooy-kan, Scheduling subject to resource constraints: Classification and complexity, Discrete Applied Mathematics, vol.5, pp.11-24, 1983.

M. Boudia, C. Prins, and M. Reghioui, An effective memetic algorithm with population management for the split delivery vehicle routing problem, Hybrid Metaheuristics, pp.16-30, 2007.

P. Brucker, S. Knust, D. Roper, and Y. Zinde, Scheduling UET task system with concurrency on two parallel identical processors, Mathematical Methods of Operation Research, vol.53, pp.369-387, 2000.

P. Brucker, A. Drexl, R. Mohring, K. Neumann, and E. Pesch, Resource-constrained project scheduling: Notation, classification, models, and methods, vol.112, pp.3-41, 1999.

A. Caumond, P. Lacomme, A. Moukrim, and N. Tchernev, An MILP for scheduling problems in a FMS with one vehicle, EJOR, vol.199, issue.3, pp.706-722, 2009.
URL : https://hal.archives-ouvertes.fr/hal-02081914

M. Chassaing, Problèmes de transport à la demande avec prise en compte de la qualité de service. Doctoral dissertation, 2015.

R. Cheng, M. Gen, and Y. Tsujimura, A tutorial survey of job-shop scheduling problems using genetic algorithms -I representation, Computers and industrial engineering, vol.30, pp.983-997, 1996.

Z. L. Chen, Integrated Production and Outbound Distribution Scheduling: Review and Extensions, Operations Research, vol.58, issue.1, pp.130-148, 2010.

S. Chtourou, M. Manier, and T. Loukil, A hybrid algorithm for the cyclic hoist scheduling problem with two transportation resources, Computers & Industrial Engineering, vol.65, issue.3, pp.426-437, 2013.

J. Cordeau and G. Laporte, A tabu search heuristic for the static multi-vehicle dial-a ride problem, Transp. Res. Part B Methodol, vol.37, pp.579-594, 2003.

S. Dauzère-pérès and J. B. Lasserre, A new mixed-integer formulation of the flow-shop sequencing problem, 2nd Workshop on models and algorithms for planning and scheduling problems, 1995.

M. Dell'amico and M. Trubian, Applying tabu-search to the job-shop scheduling problem, Annals of Operations Research, vol.41, pp.231-252, 1993.

E. Demeulemeester and W. Herroelen, Project scheduling -A research and book International Series, Operations Research and Management Science, 2002.

J. Dongarra, Performance of various computers using standard linear equations software, 2014.

C. Duhamel, P. Lacomme, and C. Prodhon, A hybrid evolutionary local search with depth first search split procedure for the heterogeneous vehicle routing problems, Eng. Appl. Artif. Intell, vol.25, issue.2, pp.345-358, 2012.
URL : https://hal.archives-ouvertes.fr/hal-02196566

C. Duhamel, P. Lacomme, and C. Prodhon, Efficient frameworks for greedy split and new depth first search split procedures for routing problems, Computers & Operations Research, vol.38, issue.4, pp.723-739, 2011.
URL : https://hal.archives-ouvertes.fr/hal-02196570

T. A. Feo and M. G. Resende, Greedy Randomized Adaptive Search Procedures, J. Glob. Optim, vol.6, issue.2, pp.109-133, 1995.

M. Firat and G. J. Woeginger, Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh, Operations Research Letters, vol.39, pp.32-35, 2011.

S. Hartmann and D. Briskorn, A survey of variants and extensions of the resource-constrained project scheduling problem, European Journal of Operational Research, vol.207, issue.1, pp.1-14, 2010.

W. Herroelen, B. De-reyck, and E. Demeulemeester, Resource-constrained project scheduling: A survey of recent developments, Computers and Operations Research, vol.25, issue.4, pp.279-302, 1998.

Q. Honglin, W. Sujing, . Qiang, and . Xu, A new method of cyclic hoist scheduling for multi-recipe and multi-stage material handling processes, Computers & Chemical Engineering, vol.90, pp.171-187, 2016.

S. Knust, R. Kolisch, and R. Padman, An integrated survey of deterministic project scheduling, OMEGA, vol.29, pp.249-272, 1999.

D. Krüger and A. Scholl, A heuristic solution framework for the resource constrained (multi-) project scheduling problem with sequencedependent transfer time, EJOR, vol.197, issue.2, pp.492-508, 2009.

S. Kreter, J. Rieck, and J. A. Zimmermann, Models and solution procedures for the resource-constrained project scheduling problem with general temporal constraints and calendars, European Journal of Operational Research, vol.251, pp.387-403, 2016.

V. P. Laarhoven, E. H. Aarts, and J. K. Lenstra, Job shop scheduling by Simulated Annealing, Operation Research, vol.40, issue.1, pp.113-125, 1992.

P. Lacomme, M. Larabi, and N. Tchernev, A disjunctive graph for the job-shop with several robots, MISTA conference, 2007.
URL : https://hal.archives-ouvertes.fr/hal-02081984

P. Lacomme, M. Larabi, and N. Tchernev, Job-shop based framework for simultaneous scheduling of machines and automated guided vehicles, International Journal of Production Economics, vol.143, issue.1, pp.24-34, 2010.
URL : https://hal.archives-ouvertes.fr/hal-02081909

P. Lacomme, C. Prins, and W. Ramdane-cherif, Competitive genetic algorithms for the Capacitated Arc Routing Problem and its extensions, Lecture Notes in Computer Science, pp.473-483, 2001.

P. Lacomme, C. Prins, and W. Ramdane-chérif, Competitive memetic algorithms for arc routing problems, Annals of Operations Research, vol.131, pp.159-185, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00100062

P. Lacomme, A. Moukrim, A. Quilliot, and M. Vinot, Formalisation linéaire d'un problème de RCPSP avec transport de ressources, 18ème congrès annuel de la Société française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF), 2017.

H. Matsuo, C. J. Suh, and R. S. Sullivan, A controlled search simulated annealing method for the general job-shop scheduling problem, pp.3-04, 1988.

E. Nowicki and C. Smutnicki, A fast taboo search algorithm for the job-shop problem, Management Science, vol.42, issue.6, pp.797-813, 1996.

J. Poppenborg and S. Knust, A flow-based tabu search algorithm for the RCPSP with transfer times, OR spectrum, vol.38, issue.2, pp.305-334, 2016.

C. Prins, A GRASP × Evolutionary Local Search Hybrid for the Vehicle Routing Problem. Bio-inspired Algorithms for the Vehicle Routing Problem, vol.161, pp.35-53, 2009.

C. Prins, A simple and effective evolutionary algorithm for the vehicle routing problem, Computers & Operations Research, vol.31, issue.12, pp.1985-2002, 2004.

C. Prins, P. Lacomme, and C. Prodhon, Order-first split-second methods for vehicle routing problems: A review, Transportation Research Part C: Emerging Technologies, vol.40, pp.179-200, 2014.
URL : https://hal.archives-ouvertes.fr/hal-02081906

A. Pritsker and L. Watters, A zero-one programming approach to scheduling with limited resources. The RAND Corporation, 1968.

A. Pritsker, L. Watters, and P. Wolfe, Multi-project scheduling with limited resources: a zero-one programming approach, Manage. Sci, vol.16, pp.93-108, 1969.

A. Quilliot and H. Toussaint, Resource Constrained Project Scheduling with Transportation Delays, IFAC Proceedings Volumes, vol.45, pp.1481-1486, 2012.

B. Roy and B. Sussmann, Les problèmes d'ordonnancement avec contraintes disjonctives, Note DS, issue.9, 1964.

I. Weiss and C. Schwindt, The resource transfer Problem: Modeling and solving integrated scheduling and routing problems, IEEE International Conference, pp.755-759, 2016.

J. Weglarz, Project Scheduling. Recent Models, Algorithms and Applications, 1999.
URL : https://hal.archives-ouvertes.fr/hal-01620610

S. Wolf and P. Merz, Evolutionary local search for the super-peer selection problem and the p-hub median problem, Lecture notes in computer science, vol.4771, pp.1-15, 2007.

Q. Zhang, H. Manier, and M. Manier, A Modified Disjunctive Graph for Job-Shop Scheduling Problems with Bounded Processing Times and Transportation Constraints, IFAC Proceedings, vol.45, issue.6, pp.1377-1382, 2012.

Q. Zhang, H. Manier, and M. Manier, A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times, Computers & Operations Research, vol.39, issue.7, pp.1713-1723, 2012.

A. , Additional numerical experiments Extra modeled should be investigated to get around MILP drawbacks, that come from the large number of variables used and from the big-M constraints required for disjunctions of both scheduling and routing. Cumulative constraint based models have been proved to be efficient in RCPSP resolution (Kreter et al. 2017), and in several RCPSP variants providing results that compete with MILP formulation. Because, the transport operations are fully defined by exchange of resources between activities, the RCPSPR that requires the proper coordination of both activities and routing constraints