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, vol.49, issue.12, pp.898-903, 2016.
URL : https://hal.archives-ouvertes.fr/hal-02081934

R. Alvarez-valdés and J. Tamarit, The project scheduling prolyhedron: Dimension, facets and lifting theorems, European Journal of Operational Research, vol.67, pp.204-220, 1993.

C. Artigues, P. Michelon, and S. Reusser, Insertion for static and dynamic RCPSP, European Journal of Operational Research, vol.149, pp.249-67, 2003.

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

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.

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, Transportation Research Part B Methodology, vol.37, pp.579-594, 2003.

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

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

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

B. L. Golden and R. T. Wong, Capacitated arc routing problems, Networks, vol.11, pp.305-315, 1981.

Q. Honglin, W. Sujing, and Q. 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, Shop-Scheduling Problems with Transportation, 1999.

M. Kwan, Graphic programming using odd or even points, Chinese Mathematics, vol.1, pp.237-277, 1962.

P. Lacomme, C. Prins, and W. Ramdane-chérif, Evolutionary algorithms for periodic arc routing problems, European Journal of Operational Research, vol.165, pp.535-553, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00104119

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, 2013.
URL : https://hal.archives-ouvertes.fr/hal-02081909

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.

S. Moons, K. Ramazkezrs, A. Caris, and Y. Arda, Integrated production scheduling and vehicle routing decisions at the operational decision level: A review and discussion, Computers and Industrial Engineering, vol.104, pp.224-245, 2017.

C. S. Orloff, A fundamental problem in vehicle routing, Networks, vol.4, pp.35-64, 1974.

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

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

A. Pritsker, L. Watters, and P. Wolfe, Multi-project scheduling with limited resources: a zero-one programming approach, Management Science, 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, vol.9, 1964.

Ü. Saglam and A. Banerjee, Integrated multiproduct batch production and truck shipment scheduling under different shipping policies, Omega, 2017.

V. Valls, F. Ballest??, and S. Quintanilla, Justification and RCPSP: A technique that pays, European Journal of Operational Research, vol.165, issue.2, pp.375-386, 2005.

G. Zhang, T. Nishi, S. D. Turner, K. Oga, and X. Li, An integrated strategy for a production planning and warehouse layout problem: Modeling and solution approaches, Omega, vol.68, pp.85-94, 2016.

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.