E. Balas, N. Simonetti, and A. Vazacopoulos, Job shop scheduling with setup times, deadlines and precedence constraints, MISTA 2005
DOI : 10.1007/s10951-008-0067-7

P. Baptiste, C. L. Pape, and W. Nuijten, Constraint-based scheduling, 2001.
DOI : 10.1007/978-1-4615-1479-4

URL : https://hal.archives-ouvertes.fr/inria-00123562

C. Bessière and R. Debruyne, Algorithmes optimaux et sous-optimaux de singlenton consistance d'arc, JFPC 2005

J. Blazewicz, W. Domschke, and E. Pesch, The job shop scheduling problem: Conventional and new solution techniques, European Journal of Operational Research, vol.93, issue.1, pp.1-33, 1996.
DOI : 10.1016/0377-2217(95)00362-2

P. Brucker, P. Jurisch, and A. Krämer, The job-shop problem and immediate selection, Annals of Operations Research, vol.25, issue.1, pp.73-114, 1994.
DOI : 10.1007/BF02085636

P. Brucker and O. Thiele, A branch & bound method for the general-shop problem with sequence dependent setup-times, OR Spektrum, vol.37, issue.5, pp.145-161, 1996.
DOI : 10.1007/BF01539706

F. Buscaylet and C. Artigues, A fast tabu search method for the job-shop problem with sequence-dependent setup times, 2003.

M. A. Candido, S. K. Khator, and R. M. Barcias, A genetic algorithm based procedure for more realistic job shop scheduling problems, International Journal of Production Research, vol.36, issue.12, pp.3437-3457, 1998.
DOI : 10.1080/002075498192148

J. Carlier, The one-machine sequencing problem, European Journal of Operational Research, vol.11, issue.1, pp.42-47, 1982.
DOI : 10.1016/S0377-2217(82)80007-6

J. Carlier and E. Pinson, An Algorithm for Solving the Job-Shop Problem, Management Science, vol.35, issue.2, pp.164-176, 1989.
DOI : 10.1287/mnsc.35.2.164

I. Choi and O. Korkmaz, Job shop scheduling with separable sequence-dependent setups, Annals of Operations Research, vol.70, pp.155-170, 1997.
DOI : 10.1023/A:1018918003761

I. Choi and D. Choi, A local search algorithm for jobshop scheduling problems with alternative operations and sequence-dependent setups, Computers & Industrial Engineering, vol.42, issue.1, pp.43-58, 2002.
DOI : 10.1016/S0360-8352(02)00002-5

D. Feillet, P. Dejax, M. Gendreau, C. Gueguen, F. Focacci et al., An exact algorithm for the elementary shortest path problem with resource constraints : Application to some vehicle routing problems Solving scheduling problems with setup times and alternative resources, AIPS, pp.216-229, 2000.

F. Focacci, A. Lodi, and M. Milano, A Hybrid Exact Algorithm for the TSPTW, INFORMS Journal on Computing, vol.14, issue.4, pp.403-417, 2002.
DOI : 10.1287/ijoc.14.4.403.2827

S. C. Kim and P. M. Bobrowski, Impact of sequence-dependent setup time on job shop scheduling performance, International Journal of Production Research, vol.24, issue.7, pp.1503-1520, 1994.
DOI : 10.1287/mnsc.16.4.B274

]. R. Kolisch, Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation, European Journal of Operational Research, vol.90, issue.2, pp.320-333, 1996.
DOI : 10.1016/0377-2217(95)00357-6

URL : http://mediatum.ub.tum.de/doc/1162818/document.pdf

P. Martin and D. B. Shmoys, A new approach to computing optimal schedules for the jobshop scheduling problem, IPCO 1996, pp.389-403

W. P. Nuijten, Time and Resource Constrained Scheduling : A Constraint Satisfaction Approach, 1994.

I. M. Ovacik and R. Uzsoy, A shifting bottleneck algorithm for scheduling semiconductor testing operations, Journal of Electronics Manufacturing, vol.02, issue.03, pp.119-134, 1992.
DOI : 10.1142/S0960313192000157

I. M. Ovacik and R. Uzsoy, Exploiting shop floor status information to schedule complex job shops, Journal of Manufacturing Systems, vol.13, issue.2, pp.73-84, 1994.
DOI : 10.1016/0278-6125(94)90023-X

B. Roy and B. Sussman, Les problèmes d'ordonnancement avec contraintes disjonctives, 1964.

X. Sun and J. S. Noble, An approach to job shop scheduling with sequence-dependent setups, Journal of Manufacturing Systems, vol.18, issue.6, pp.416-430, 1999.
DOI : 10.1016/S0278-6125(00)87643-8

P. Torres and P. Lopez, Overview and possible extensions of shaving techniques for job-shop problems, CPAIOR 2000, pp.181-186

P. Vilím and R. Barták, Filtering algorithms for batch processing with sequence dependent setup times, AIPS 2002, pp.312-320

C. Zhou and P. G. Egbelu, Scheduling in a manufacturing shop with sequence-dependent setups, Robotics and Computer-Integrated Manufacturing, vol.5, issue.1, pp.73-81, 1989.
DOI : 10.1016/0736-5845(89)90031-8