, With Rank-1 Cuts (n, m, set, vol.40, p.1

T. Achterberg, M. Boccia, D. 'auria, and B. , Near-optimal solutions of large-scale single-machine scheduling problems, INFORMS Journal on Computing, vol.17, issue.2, pp.183-191, 2005.

R. Baldacci, A. Mingozzi, and R. Roberti, New route relaxation and pricing strategies for the vehicle routing problem, Operations research, vol.59, issue.5, pp.1269-1283, 2011.

L. P. Bigras, M. Gamache, and G. Savard, The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times, Discrete Optimization, vol.5, issue.4, pp.685-699, 2008.

L. Cadernos-do, , 0324.

A. Bitar, S. Dauzère-pérès, C. Yugma, and R. Roussel, A memetic algorithm to solve an unrelated parallel machine scheduling problem with auxiliary resources in semiconductor manufacturing, Journal of Scheduling, vol.19, issue.4, pp.367-376, 2016.
URL : https://hal.archives-ouvertes.fr/emse-01555622

K. Bülbül, An exact extended formulation for the unrelated parallel machine total weighted completion time problem, Journal of Scheduling, vol.20, issue.4, pp.373-389, 2017.

Z. L. Chen and W. B. Powell, Solving parallel machine scheduling problems by column generation, INFORMS Journal on Computing, vol.11, issue.1, pp.78-94, 1999.

C. Contardo and R. Martinelli, A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints, Discrete Optimization, vol.12, pp.129-146, 2014.

C. Gauvin, G. Desaulniers, and M. Gendreau, A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands, Computers & Operations Research, vol.50, pp.141-153, 2014.

R. Graham, E. Lawler, J. Lenstra, and A. Kan, Discrete Optimization II Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium co-sponsored by IBM Canada and SIAM Banff, Annals of Discrete Mathematics, vol.5, pp.287-326, 1979.

I. Ioachim, S. Gélinas, F. Soumis, and J. Desrosiers, A dynamic programming algorithm for the shortest path problem with time windows and linear node costs, Networks, vol.31, issue.3, pp.193-204, 1998.

M. Jepsen, B. Petersen, S. Spoorendonk, and D. Pisinger, Subset-row inequalities applied to the vehicle-routing problem with time windows, Operations Research, vol.56, issue.2, pp.497-511, 2008.

M. Jepsen, S. Spoorendonk, and S. Ropke, A branch-and-cut algorithm for the symmetric twoechelon capacitated vehicle routing problem, Transportation Science, vol.47, issue.1, pp.23-37, 2013.

A. Jouglet and D. Savourey, Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates, Computers & Operations Research, vol.38, issue.9, pp.1259-1266, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00943855

D. Kowalczyk and R. Leus, A branch-and-price algorithm for parallel machine scheduling using zdds and generic branching, INFORMS Journal on Computing Forthcoming, 2018.

A. Kramer, Um método heurístico para a resolução de uma classe de problemas de sequenciamento da produção envolvendo penalidades por antecipação e atraso, 2015.

A. Kramer and A. Subramanian, A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems, Journal of Scheduling First Online Cadernos, 2017.

J. Lenstra, A. R. Kan, and P. Brucker, Complexity of machine scheduling problems, Studies in Integer Programming, vol.1, pp.343-362, 1977.

C. F. Liaw, Y. K. Lin, C. Y. Cheng, and M. Chen, Scheduling unrelated parallel machines to minimize total weighted tardiness, Computers & Operations Research, vol.30, issue.12, pp.1777-1789, 2003.

R. Nessah, F. Yalaoui, and C. Chu, A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates, Computers & Operations Research, vol.35, issue.4, pp.1176-1190, 2008.

D. Oliveira and A. Pessoa, An improved branch-cut-and-price algorithm for parallel machine scheduling problems, INFORMS Journal on Computing Forthcoming, 2018.

Y. Pan and L. Shi, New hybrid optimization algorithms for machine scheduling problems, IEEE Transactions on Automation Science and Engineering, vol.5, issue.2, pp.337-348, 2008.

D. Pecin, C. Contardo, G. Desaulniers, and E. Uchoa, New enhancements for the exact solution of the vehicle routing problem with time windows, INFORMS Journal on Computing, vol.29, issue.3, pp.489-502, 2017.

D. Pecin, A. Pessoa, M. Poggi, and E. Uchoa, Improved branch-cut-and-price for capacitated vehicle routing, Mathematical Programming Computation, vol.9, issue.1, pp.61-100, 2017.

P. Lopes, M. J. Valério-de-carvalho, and J. , A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times, European Journal of Operational Research, vol.176, issue.3, pp.1508-1527, 2007.

A. Pessoa, E. Uchoa, M. De-aragão, and R. Rodrigues, Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems, Mathematical Programming Computation, vol.2, issue.3-4, pp.259-290, 2010.

A. Pessoa, R. Sadykov, E. Uchoa, and F. Vanderbeck, Automation and combination of linearprogramming based stabilization techniques in column generation, INFORMS Journal on Computing, vol.30, issue.2, pp.339-360, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01077984

M. Poggi-de-aragão and E. Uchoa, Integer program reformulation for robust branch-and-cutand-price, Annals of Mathematical Programming in Rio, pp.56-61, 2003.

G. Righini and M. Salani, Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints, Discrete Optimization, vol.3, issue.3, pp.255-273, 2006.

L. Cadernos-do, , 0326.

S. Røpke, Branching decisions in branch-and-cut-and-price algorithms for vehicle routing problems, 2012.

J. E. Schaller, Minimizing total tardiness for scheduling identical parallel machines with family setups, Computers & Industrial Engineering, vol.72, issue.0, pp.274-281, 2014.

H. S-¸en and K. Bülbül, A strong preemptive relaxation for weighted tardiness and earliness/tardiness problems on unrelated parallel machines, INFORMS Journal on Computing, vol.27, issue.1, pp.135-150, 2015.

S. O. Shim and Y. D. Kim, Minimizing total tardiness in an unrelated parallel-machine scheduling problem, Journal of the Operational Research Society, vol.58, issue.3, pp.346-354, 2007.

S. O. Shim and Y. D. Kim, Scheduling on parallel identical machines to minimize total tardiness, European Journal of Operational Research, vol.177, issue.1, pp.135-146, 2007.

F. Sourd, Earliness-tardiness scheduling with setup considerations, Computers & Operations Research, vol.32, issue.7, pp.1849-1865, 2005.
URL : https://hal.archives-ouvertes.fr/hal-01185226

F. Sourd and S. Kedad-sidhoum, The one-machine problem with earliness and tardiness penalties, Journal of Scheduling, vol.6, issue.6, pp.533-549, 2003.

F. Sourd and S. Kedad-sidhoum, A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem, Journal of Scheduling, vol.11, issue.1, pp.49-58, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01185214

S. Tanaka and M. Araki, A branch-and-bound algorithm with lagrangian relaxation to minimize total tardiness on identical parallel machines, International Journal of Production Economics, vol.113, issue.1, pp.446-458, 2008.

S. Tanaka and M. Araki, An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times, Computers & Operations Research, vol.40, issue.1, pp.344-352, 2013.

S. Tanaka and S. Fujikuma, An efficient exact algorithm for general single-machine scheduling with machine idle time, Automation Science and Engineering, pp.371-376, 2008.

S. Tanaka and S. Fujikuma, A dynamic-programming-based exact algorithm for general singlemachine scheduling with machine idle time, Journal of Scheduling, vol.15, issue.3, pp.347-361, 2012.

S. Tanaka, S. Fujikuma, and M. Araki, An exact algorithm for single-machine scheduling without machine idle time, Journal of Scheduling, vol.12, issue.6, pp.575-593, 2009.

J. Van-den-akker, C. Hurkens, and M. Savelsbergh, Time-indexed formulations for machine scheduling problems: Column generation, INFORMS Journal on Computing, vol.12, issue.2, pp.111-124, 2000.

L. Cadernos-do, , 0327.

F. Yalaoui and C. Chu, New exact method to solve the P m |r j | C j schedule problem, International Journal of Production Economics, vol.100, issue.1, pp.168-179, 2006.