R. Kenneth, G. D. Baker, and . Scudder, Sequencing with earliness and tardiness penalties: A review, Operations Research, vol.38, issue.1, pp.22-36, 1990.

E. Balas, On the facial structure of scheduling polyhedra, Mathematical Programming, vol.24, pp.179-218, 1985.

F. Barahona and A. Mahjoub, On the cut polytope, Math. Program, vol.36, issue.2, pp.157-173, 1986.

D. Biskup and M. Feldmann, Common due date scheduling

D. Biskup and M. Feldmann, Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates, Computers & OR, vol.28, issue.8, pp.787-801, 2001.

R. José, A. S. Correa, and . Schulz, Single-machine scheduling with precedence constraints, Math. Oper. Res, vol.30, issue.4, pp.1005-1021, 2005.

M. E. Dyer and L. A. Wolsey, Formulating the single machine sequencing problem with release dates as a mixed integer program, Discrete Applied Mathematics, vol.26, issue.2-3, pp.255-270, 1990.

, LEMON -Library for Efficient Modeling and Optimization in Networks

R. E. Gomory and T. C. Hu, Multi-terminal network flows, ournal of the Society for Industrial and Applied Mathematics, vol.9, issue.4, pp.551-570, 1961.

M. Grötschel, L. Lovász, and A. Schrijver, The ellipsoid method and its consequences in combinatorial optimization, Combinatorica, vol.1, issue.2, pp.169-197, 1981.

N. G. Hall, W. Kubiak, and S. P. Sethi, Earliness-tardiness scheduling problems, II: deviation of completion times about a restrictive common due date, Operations Research, vol.39, issue.5, pp.847-856, 1991.

G. Nicholas, M. E. Hall, and . Posner, Earliness-tardiness scheduling problems, I: weighted deviation of completion times about a common due date, Operations Research, vol.39, issue.5, pp.836-846, 1991.

J. A. Hoogeveen and S. L. Van-de-velde, Scheduling around a small common due date, European Journal of Operational Research, vol.55, issue.2, pp.237-242, 1991.

J. J. Kanet, Minimizing the average deviation of job completion times about a common due date, Naval research logistics quarterly, vol.28, pp.643-651, 1981.

J. John, V. Kanet, and . Sridharan, Scheduling with inserted idle time: Problem taxonomy and literature review, Operations Research, vol.48, issue.1, pp.99-110, 2000.

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

M. Padberg, The boolean quadric polytope: Some characteristics, facets and relatives, Math. Program, vol.45, issue.1-3, pp.139-172, 1989.

J. Picard and H. Ratliff, Minimum cuts and related problems, Networks, vol.5, issue.4, pp.357-370, 1975.

M. Queyranne, Structure of a simple scheduling polyhedron, Mathematical Programming, vol.58, pp.263-285, 1993.

M. Queyranne and A. S. Schulz, Polyhedral approaches to machine scheduling, 1994.

M. Queyranne and Y. Wang, Single-machine scheduling polyhedra with precedence constraints, Math. Oper. Res, vol.16, issue.1, pp.1-20, 1991.

W. E. Smith, Various optimizers for single-stage production, Naval Research Logistics Quarterly, vol.3, issue.1-2, pp.59-66, 1956.

F. Sourd, New exact algorithms for one-machine earliness-tardiness scheduling, INFORMS Journal on Computing, vol.21, issue.1, pp.167-175, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01185191

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