An efficient new heuristic for the hoist scheduling problem, Computers & Operations Research, vol.67, pp.184-192, 2016. ,
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
, Network Flows: Theory/Applications, 1993.
The project scheduling prolyhedron: Dimension, facets and lifting theorems, EJOR, vol.67, pp.204-220, 1993. ,
A polynomial insertion algorithm in RCPSP with cumulative constraints and multiple nodes, EJOR, vol.127, issue.2, pp.297-316, 2000. ,
Insertion for static/dyn, RCPSP. EJOR, vol.149, pp.249-67, 2003. ,
Route-first cluster-second methods for vehicle routing, Omega, vol.11, pp.403-408, 1983. ,
Scheduling subject to resource constraints: Classification and complexity, Discrete Applied Mathematics, vol.5, pp.11-24, 1983. ,
An effective memetic algorithm with population management for the split delivery vehicle routing problem, Hybrid Metaheuristics, pp.16-30, 2007. ,
Scheduling UET task system with concurrency on two parallel identical processors, Mathematical Methods of Operation Research, vol.53, pp.369-387, 2000. ,
Resource-constrained project scheduling: Notation, classification, models, and methods, vol.112, pp.3-41, 1999. ,
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
Problèmes de transport à la demande avec prise en compte de la qualité de service. Doctoral dissertation, 2015. ,
A tutorial survey of job-shop scheduling problems using genetic algorithms -I representation, Computers and industrial engineering, vol.30, pp.983-997, 1996. ,
Integrated Production and Outbound Distribution Scheduling: Review and Extensions, Operations Research, vol.58, issue.1, pp.130-148, 2010. ,
A hybrid algorithm for the cyclic hoist scheduling problem with two transportation resources, Computers & Industrial Engineering, vol.65, issue.3, pp.426-437, 2013. ,
A tabu search heuristic for the static multi-vehicle dial-a ride problem, Transp. Res. Part B Methodol, vol.37, pp.579-594, 2003. ,
A new mixed-integer formulation of the flow-shop sequencing problem, 2nd Workshop on models and algorithms for planning and scheduling problems, 1995. ,
Applying tabu-search to the job-shop scheduling problem, Annals of Operations Research, vol.41, pp.231-252, 1993. ,
Project scheduling -A research and book International Series, Operations Research and Management Science, 2002. ,
Performance of various computers using standard linear equations software, 2014. ,
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
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
Greedy Randomized Adaptive Search Procedures, J. Glob. Optim, vol.6, issue.2, pp.109-133, 1995. ,
Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh, Operations Research Letters, vol.39, pp.32-35, 2011. ,
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. ,
Resource-constrained project scheduling: A survey of recent developments, Computers and Operations Research, vol.25, issue.4, pp.279-302, 1998. ,
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. ,
An integrated survey of deterministic project scheduling, OMEGA, vol.29, pp.249-272, 1999. ,
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. ,
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. ,
Job shop scheduling by Simulated Annealing, Operation Research, vol.40, issue.1, pp.113-125, 1992. ,
A disjunctive graph for the job-shop with several robots, MISTA conference, 2007. ,
URL : https://hal.archives-ouvertes.fr/hal-02081984
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
Competitive genetic algorithms for the Capacitated Arc Routing Problem and its extensions, Lecture Notes in Computer Science, pp.473-483, 2001. ,
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
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. ,
A controlled search simulated annealing method for the general job-shop scheduling problem, pp.3-04, 1988. ,
A fast taboo search algorithm for the job-shop problem, Management Science, vol.42, issue.6, pp.797-813, 1996. ,
A flow-based tabu search algorithm for the RCPSP with transfer times, OR spectrum, vol.38, issue.2, pp.305-334, 2016. ,
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. ,
A simple and effective evolutionary algorithm for the vehicle routing problem, Computers & Operations Research, vol.31, issue.12, pp.1985-2002, 2004. ,
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 zero-one programming approach to scheduling with limited resources. The RAND Corporation, 1968. ,
Multi-project scheduling with limited resources: a zero-one programming approach, Manage. Sci, vol.16, pp.93-108, 1969. ,
Resource Constrained Project Scheduling with Transportation Delays, IFAC Proceedings Volumes, vol.45, pp.1481-1486, 2012. ,
Les problèmes d'ordonnancement avec contraintes disjonctives, Note DS, issue.9, 1964. ,
The resource transfer Problem: Modeling and solving integrated scheduling and routing problems, IEEE International Conference, pp.755-759, 2016. ,
Project Scheduling. Recent Models, Algorithms and Applications, 1999. ,
URL : https://hal.archives-ouvertes.fr/hal-01620610
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. ,
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. ,
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. ,
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 ,