J. E. Beasley, OR-Library: distributing test problems by electronic mail, Journal of the Operational Research Society, vol.41, pp.1069-1072, 1990.

N. Bianchessi and G. Righini, Planning and scheduling algorithms for the COSMO-SkyMed constellation, Aerospace Science and Technology, vol.12, pp.535-544, 2008.

Z. Bilgintürk, C. O?guzo?guz, and S. Salman, Order acceptance and scheduling decisions in maketo-order systems, Proceedings of the 5th Multidisciplinary International Scheduling Conference: Theory and Applications, 2007.

B. Chen, C. N. Potts, and G. J. Woeginger, A Review of Machine Scheduling: Complexity, Algorithms and Approximability, Handbook of Combinatorial Optimization, 1998.

R. Cordone, P. Hosteins, and G. Righini, A branch-and-bound algorithm for the prizecollecting single-machine scheduling problem with deadlines and total tardiness minimization, INFORMS Journal on Computing, vol.30, pp.168-180, 2018.

J. Du and J. Y. Leung, Minimizing total tardiness on one machine is NP-hard, Mathematics of Operations Research, vol.15, pp.483-495, 1990.

M. Ehrgott and X. Gandibleux, Bound sets for biobjective combinatorial optimization problems, Computers and Operations Research, vol.34, issue.9, pp.2674-2694, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00462004

H. Emmons, One-machine sequencing to minimize certain functions of job tardiness, Operations Research, vol.17, pp.701-715, 1969.

R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. Rinnooy-kan, Optimization and approximation in deterministic sequencing and scheduling: a survey, Annals of Operations Research, vol.5, pp.287-326, 1979.

C. L. Hwang and A. S. Masud, Multiple objective decision making methods and applications: a state-of-the-art survey, vol.164, 2012.

F. Jolai, M. S. Sangari, and M. Babaie, Pareto simulated annealing and colonial competitive algorithm to solve an offline scheduling problem with rejection, Proceedings of the Institution of Mechanical Engineers, vol.224, issue.7, pp.1119-1131, 2010.

C. Koulamas, The single-machine total tardiness scheduling problem: Review and extensions, European Journal of Operational Research, vol.202, pp.1-7, 2010.

C. Koulamas and G. J. Kyparisis, Single machine scheduling with release times, deadlines and tardiness objectives, European Journal of Operational Research, vol.133, pp.447-453, 2001.

E. L. Lawler, A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness, Annals of Discrete Mathematics, vol.1, pp.331-342, 1977.

J. Lasserre and M. Queyranne, Generic scheduling polyhedral and a new mixed-integer formulation for single-machine scheduling, Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992.

K. Miettinen, F. Ruiz, and A. P. Wierzbicki, Introduction to multi-objective optimization: interactive approaches, Multiobjective Optimization, pp.27-57, 2008.

A. Moghaddam, F. Yalaoui, and L. Amodeo, Efficient meta-heuristics based on various dominance criteria for a single-machine bi-critera scheduling problem with rejection, Journal of Manufacturing Systems, vol.34, pp.12-22, 2015.

A. Moghaddam, L. Amodeo, F. Yalaoui, and B. Karimi, Single machine scheduling with rejection: minimizing total weighted completion time and rejection cost, Applied Evolutionary Computation, vol.3, issue.2, pp.42-61, 2012.

F. T. Nobibon and R. Leus, Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment, Computers and Operations Research, vol.38, issue.10, pp.367-378, 2011.

C. O?guzo?guz, F. S. Salman, and Z. B. Yalç?n, Order acceptance and scheduling decisions in maketo-order systems, International Journal of Production Economics, vol.125, pp.200-211, 2010.

A. Przybylski and X. Gandibleux, Multi-objective branch-and-bound, European Journal of Operational Research, vol.260, pp.856-872, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01717951

D. Shabtay, N. Gaspar, and M. Kaspi, A survey on offline scheduling with rejection, Journal of Scheduling, vol.16, pp.3-28, 2013.

D. Shabtay, N. Gaspar, and L. Yedidsion, A bicriteria approach to scheduling a single machine with rejection and positional penalties, Journal of Combinatorial Optimization, vol.23, pp.395-424, 2012.

D. Shabtay and N. Gaspar, Two-machine flow-shop scheduling with rejection, Computers and Operations Research, vol.39, issue.5, pp.1087-1096, 2012.

G. Steiner and R. Zhang, Revised Delivery-Time Quotation in Scheduling with Tardiness Penalties, Operations Research, vol.59, issue.6, pp.1504-1511, 2011.

R. Tadei, A. Grosso, and F. Della-croce, Finding the Pareto-optima for the total and maximum tardiness single machine problem, Discrete Applied Mathematics, vol.124, pp.117-126, 2002.

V. and F. Della-croce, Enumeration of Pareto optima for a flowshop scheduling problem with two criteria, INFORMS Journal of Computing, vol.19, pp.64-72, 2007.
URL : https://hal.archives-ouvertes.fr/hal-01022124

D. J. Wang, Y. Yin, and M. Liu, Bicriteria scheduling problems involving job rejection, controllable processing times and rate-modifying activity, International Journal of Production Research, vol.54, pp.3691-3705, 2016.

L. Zhang, L. Lu, and J. Yuan, Single-machine scheduling under the job rejection constraint, Theoretical Computer Science, vol.411, pp.1877-1882, 2010.

E. Zitzler and L. Thiele, Multiobjective optimization using evolutionary algorithms: A comparative case study, Proceedings of the 5th International Conference on Parallel Problem Solving from Nature-PPSN V, vol.1498, pp.292-301, 1998.