J. Adams, E. Balas, and D. Zawack, The Shifting Bottleneck Procedure for Job Shop Scheduling, Management Science, vol.34, issue.3, pp.391-401, 1988.
DOI : 10.1287/mnsc.34.3.391

A. Allahverdi, J. N. Gupta, and T. Aldowaisan, A review of scheduling research involving setup considerations, Omega, vol.27, issue.2, pp.219-239, 1999.
DOI : 10.1016/S0305-0483(98)00042-5

C. Artigues, S. Belmokhtar, and D. Feillet, A New Exact Solution Algorithm for the Job Shop Problem with Sequence-Dependent Setup Times
DOI : 10.1007/978-3-540-24664-0_3
URL : https://hal.archives-ouvertes.fr/emse-00712628

C. Artigues, F. Buscaylet, and D. Feillet, Lower and upper bound for the job shop scheduling problem with sequence-dependent setup times, proceedings of the second Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA'2005), 2005.

C. Artigues, P. Lopez, and P. D. Ayache, Schedule Generation Schemes for the Job-Shop Problem with Sequence-Dependent Setup Times: Dominance Properties and Computational Analysis, Annals of Operations Research, vol.30, issue.2, pp.21-52, 2005.
DOI : 10.1007/s10479-005-2443-4
URL : https://hal.archives-ouvertes.fr/hal-00022742

E. Balas, New classes of efficiently solvable generalized traveling salesman problems, 1996.

E. Balas and N. Simonetti, Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study, INFORMS Journal on Computing, vol.13, issue.1, pp.56-75, 2001.
DOI : 10.1287/ijoc.13.1.56.9748

E. Balas, N. Simonetti, and A. Vazacopoulos, Job shop scheduling with setup times, deadlines and precedence constraints, proceedings of the second Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA'2005), 2005.
DOI : 10.1007/s10951-008-0067-7

P. Baptiste, C. L. Pape, and W. Nuijten, Constraint-based scheduling, of International Series in Operations Research & Management Science, 2001.
DOI : 10.1007/978-1-4615-1479-4
URL : https://hal.archives-ouvertes.fr/inria-00123562

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, P. Jurisch, and B. Sievers, A branch and bound algorithm for the job-shop scheduling problem, Discrete Applied Mathematics, vol.49, issue.1-3, pp.107-127, 1994.
DOI : 10.1016/0166-218X(94)90204-6

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 jobshop problem with sequence-dependent setup times, Metaheuristic International Conference MIC'2003, 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

R. W. Conway, W. L. Maxwell, and L. W. Miller, Theory of Scheduling, 1967.

S. Demassey, C. Artigues, and P. Michelon, Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem, INFORMS Journal on Computing, vol.17, issue.1, pp.52-65, 2005.
DOI : 10.1287/ijoc.1030.0043

D. Feillet, P. Dejax, M. Gendreau, and C. Gueguen, An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems, Networks, vol.35, issue.3, pp.216-229, 2004.
DOI : 10.1002/net.20033

F. Focacci, P. Laborie, and W. Nuijten, Solving scheduling problems with setup times and alternative resources, Fifth International Conference on Artificial Intelligence Planning and Scheduling, pp.92-101, 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

A. S. Jain and S. Meeran, Deterministic job-shop scheduling: Past, present and future, European Journal of Operational Research, vol.113, issue.2, pp.390-434, 1999.
DOI : 10.1016/S0377-2217(98)00113-1

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

S. Lawrence, Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (supplement), 1984.

P. Martin and D. B. Shmoys, A new approach to computing optimal schedules for the job-shop scheduling problem, Proceedings of the 5th International Conference on Integer Programming and Combinatorial Optimization IPCO'96, pp.389-403, 1996.
DOI : 10.1007/3-540-61310-2_29

S. J. Mason, J. W. Fowler, and W. Carlyle, A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops, Journal of Scheduling, vol.100, issue.3, pp.247-262, 2002.
DOI : 10.1002/jos.102

J. A. Noivo and H. Ramalhinho-lourenço, Solving Two Production Scheduling Problems with Sequence-Dependent Set-Up Times, SSRN Electronic Journal, 1998.
DOI : 10.2139/ssrn.145530

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.
DOI : 10.1287/mnsc.42.6.797

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

I. M. Ovacik and R. Uzsoy, Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times, International Journal of Production Research, vol.32, issue.6, pp.1243-1263, 1994.
DOI : 10.1109/66.97809

L. Peridy, Leprobì eme de job-shop : arbitrages et ajustements, 1996.

B. Roy and B. Sussman, Lesprobì emes d'ordonnancement avec contraintes disjonctives, 1964.

M. W. Savelsberg, Local search in routing problems with time windows, Annals of Operations Research, vol.1, issue.1, pp.285-305, 1985.
DOI : 10.1007/BF02022044

J. M. Schutten, Practical job shop scheduling The Netherlands, 1995.

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, Proceedings of the Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR'00, pp.181-186, 2000.

R. J. Vaessens, E. H. Aarts, and J. K. Lenstra, Job Shop Scheduling by Local Search, INFORMS Journal on Computing, vol.8, issue.3, pp.302-317, 1996.
DOI : 10.1287/ijoc.8.3.302

P. Vilím and R. Barták, Filtering algorithms for batch processing with sequence dependent setup times, Proceedings of The Sixth International Conference on Artificial Intelligence Planning and Scheduling, pp.312-320, 2002.

J. K. Wilbrecht and W. B. Prescott, The Influence of Setup Time on Job Shop Performance, Management Science, vol.16, issue.4, pp.274-280, 1969.
DOI : 10.1287/mnsc.16.4.B274

C. Zhou and P. G. Egbelu, Value in bold: best known result on the instance is reached. Value underlined: previously best known result on the instance is improved. * tight bound Table 5: Upper bound comparison, Robotics and Computer Integrated Manufacturing (52.2) 1006 (239221) 1009 * 1009 * 986 996 996 t2-ps07 416 970 * (20.0 970 * (927515) 970, pp.73-81, 1018.