L. Bartal, S. Marchetti-spaccamela, and S. , Preemption Can Make Parallel Machine Scheduling Problems Hard, SIAM Journal on Discrete Mathematics, vol.13, pp.64-78, 1999.

W. Cao and Z. Liu, On Several Scheduling Problems with Rejection or Discretely Compressible Processing Times". en. In: Theory and Applications of Models of Computation, Lecture Notes in Computer Science, pp.90-98, 2006.

C. Catusse, . Brauner, . Lemaire, L. Penz, and R. , A Branch-And-Price Algorithm for Scheduling Observations on a Telescope, Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI-16), pp.3060-3066, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01381636

L. Cordeau, Maximizing the value of an Earth observation satellite orbit". en, Journal of the Operational Research Society, vol.56, pp.962-968, 2005.

. Chapter-i and . Problems,

. Dantzig, Discrete-Variable Extremum Problems, Operations Research 5, vol.2, pp.266-288, 1957.

. Engels, . Karger, . Kolliopoulos, U. Sengupta, and W. , Techniques for scheduling with rejection, Journal of Algorithms. 1998 European Symposium on Algorithms 49.1, pp.78-84, 2003.

S. Eun and K. , Maximizing total job value on a single machine with job selection". en, Journal of the Operational Research Society, vol.68, pp.998-1005, 2017.

J. Garey, Strong " NP-Completeness Results: Motivation, Examples, and Implications, J. ACM, vol.25, pp.499-508, 1978.

J. Garey, Computers and Intractability; A Guide to the Theory of NP-Completeness, 1979.

V. Habet and . Vimont, Bounding the optimum for the problem of scheduling the photographs of an Agile Earth Observing Satellite". en, Computational Optimization and Applications, vol.47, pp.307-333, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00353797

K. Janiak, Single machine scheduling subject to deadlines and resource dependent processing times, European Journal of Operational Research, vol.94, pp.284-291, 1996.

P. Kellerer and P. , Advanced Algorithmic Concepts". en, Knapsack Problems, pp.43-72, 2004.

R. Lagrange, . Brauner, . Cambazard, L. Catusse, and B. , SPOT: an optimization software for dynamic observation programming, SPIE 9910, Observatory Operations: Strategies, Processes, and Systems VI, 991033, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01398862

. Lawler, Sequencing to Minimize the Weighted Number of Tardy Jobs, Revue Française d'Automatique, Informatique, Recherche Opérationnelle, 1976.

K. Leung and A. , Order acceptance and scheduling to maximize total net revenue in permutation flowshops with weighted tardiness, Applied Soft Computing, vol.30, pp.462-474, 2004.

. Chapter-i, . Pdps-problems, V. Potts, and . Wassenhove, Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs, Management Science, vol.34, pp.843-858, 1988.

. Schrijver, Combinatorial optimization: polyhedra and efficiency, vol.24, 2002.

G. Shabtay and K. , A survey on offline scheduling with rejection". en, Journal of Scheduling, vol.16, pp.3-28, 2013.

G. Shabtay and Y. , A bicriteria approach to scheduling a single machine with job rejection and positional penalties". en, Journal of Combinatorial Optimization, vol.23, pp.395-424, 2012.

S. Shabtay, A survey of scheduling with controllable processing times, Discrete Applied Mathematics, vol.155, pp.1643-1666, 2007.

S. Shioura and S. , Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches, European Journal of Operational Research, vol.266, pp.795-818, 2018.

. Slotnick, Order acceptance and scheduling: A taxonomy and review, European Journal of Operational Research, vol.212, pp.1-11, 2011.

. Sterna, A survey of scheduling problems with late work criteria, Omega 39, vol.2, pp.120-129, 2011.

J. Tangpattanakul and . Lopez, A multi-objective local search heuristic for scheduling Earth observations taken by an agile satellite, European Journal of Operational Research, vol.245, pp.542-554, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01162839

L. Verfaillie, Selecting and Scheduling Observations for Agile Satellites: Some Lessons from the Constraint Reasoning Community Point of View". en. In: Principles and Practice of Constraint Programming -CP, Lecture Notes in Computer Science, 2001.

R. Wang, G. , and T. , A model, a heuristic and a decision support system to solve the scheduling problem of an earth observing satellite constellation, Computers & Industrial Engineering. Combinatorial Optimizatiion in Industrial Engineering, vol.61, pp.322-335, 2011.

G. Yang, A single resource scheduling problem with jobselection flexibility, tardiness costs and controllable processing times, 2007.

R. Bianchessi, . Cordeau, L. Desrosiers, and R. , A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites, European Journal of Operational Research, vol.177, pp.750-762, 2007.

H. Dilkina, Agile satellite scheduling via permutation search with constraint propagation, p.12, 2005.

M. Hall, Maximizing the value of a space mission, European Journal of Operational Research. Project Management and Scheduling, vol.78, pp.90385-90394, 1994.

. He, . Liu, C. Laporte, and C. , An improved adaptive large neighborhood search algorithm for multiple agile satellites scheduling, Computers & Operations Research, vol.100, pp.12-25, 2018.

K. Janiak, Single machine scheduling subject to deadlines and resource dependent processing times, European Journal of Operational Research, vol.94, pp.284-291, 1996.

. Johnston, Spike: AI scheduling for NASA's Hubble Space Telescope, Sixth Conference on Artificial Intelligence for Applications, vol.1, pp.184-190, 1990.

. Johnston, The Application of Artificial Intelligence to Astronomical Scheduling Problems, Astronomical Data Analysis Software and Systems II, vol.52, p.329, 1993.

P. Kellerer and P. , Knapsack Problems. en. Berlin, Heidelberg, 2004.

. Chapter-ii, . Star, and . Scheduling,

. Lemaître, . Verfaillie, L. Jouhaud, and B. , Selecting and scheduling observations of agile satellites, Aerospace Science and Technology 6.5, pp.367-381, 2002.

X. Li and W. , Scheduling Observations of Agile Satellites with Combined Genetic Algorithm, Third International Conference on Natural Computation, vol.3, pp.29-33, 2007.

D. Peng, . Verbeeck, X. Gunawan, and . Vansteenwegen, Agile Earth Observation Satellite Scheduling: an Orienteering Problem with Time-Dependent Profits and Travel Times, Computers & Operations Research, 2019.

R. Pisinger, Large neighborhood search, Handbook of metaheuristics, pp.399-419, 2010.

S. Wolfe, Three Scheduling Algorithms Applied to the Earth Observing Systems Domain, Management Science, vol.46, pp.148-166, 2000.

C. Xu, L. , and W. , Priority-based constructive algorithms for scheduling agile earth observation satellites with total priority maximization, Expert Systems with Applications 51, pp.195-206, 2016.

, Beam-ACO-hybridizing ant colony optimization with beam search: an application to open shop scheduling, Figure III.24 -Computational experiments -Dataset B References Blum, vol.32, pp.35-62, 1988.

R. Rubin and . Reddy, The LOCUS Model of Search and its Use in Image Interpretation, In: IJCAI, vol.2, pp.590-595, 1977.

. Russell, E cient memory-bounded search methods, ECAI-1992, 1992.

N. Russell, Artificial intelligence: a modern approach, 2016.

, Preemption Can Make Parallel Machine Scheduling Problems Hard, Pearson Education Limited, References Brucker and Kravchenko, 1999.

A. Cherri, P. Yanasse, and G. Vianna, The onedimensional cutting stock problem with usable leftovers -A survey, European Journal of Operational Research, vol.236, pp.395-402, 2014.

F. Nemhauser, A polyhedral study of the cardinality constrained knapsack problem". en, Mathematical Programming 96, vol.3, pp.439-467, 2003.