E. Akçali and K. Nemoto, Cycle-time improvements for photolithography process in semiconductor manufacturing, IEEE Transactions on Semiconductor Manufacturing, vol.14, issue.1, pp.48-56, 2001.
DOI : 10.1109/66.909654

M. Van-den-akker and C. , Hurkens et M. Savelsbergh ? « Time-Indexed Formulations for Machine Scheduling Problems : Column Generation, FORMS Journal on Computing, vol.12, issue.2, pp.111-124, 2000.

A. Allahverdi, C. T. Ng, C. T. Cheng, and M. Y. , A survey of scheduling problems with setup times or costs, European Journal of Operational Research, vol.187, issue.3, pp.985-1032, 2008.
DOI : 10.1016/j.ejor.2006.06.060

L. Atherton and R. , Atherton ? Wafer fabrication : Factory performance and analysis, 1995.

G. Beliakov and A. , Pradera et T. Calvo ? Aggregation functions : A guide for practitioners, Studies in Fuzziness and Soft Computing, 2007.

J. Blazewicz, J. Lenstra, and A. R. , Scheduling subject to resource constraints: classification and complexity, Discrete Applied Mathematics, vol.5, issue.1, pp.11-24, 1983.
DOI : 10.1016/0166-218X(83)90012-4

S. Bouveret, Computing leximin-optimal solutions in constraint networks, Artificial Intelligence, vol.173, issue.2, pp.343-364, 2009.
DOI : 10.1016/j.artint.2008.10.010

P. Brucker and B. , Jurisch et A Kramer ? « Complexity of scheduling problems with multi-purpose machines, Annals of Operations Research, vol.70, issue.0, pp.57-73, 1997.
DOI : 10.1023/A:1018950911030

J. Bruno, E. Coffman, and M. , Scheduling independent tasks to reduce mean finishing time, Communications of the ACM, vol.17, issue.7, pp.382-387, 1974.
DOI : 10.1145/361011.361064

P. Camerini and G. Galbiati, Complexity of spanning tree problems: Part I, European Journal of Operational Research, vol.5, issue.5, pp.346-352, 1980.
DOI : 10.1016/0377-2217(80)90164-2

S. Chand, Schneeberger ? « Single machine scheduling to minimize weighted completion time with maximum allowable tardiness, 1984.

S. Dauzère-pérès and M. , An Exact Method to Minimize the Number of Tardy Jobs in Single Machine Scheduling, Journal of Scheduling, vol.7, issue.6, pp.405-420, 2004.
DOI : 10.1023/B:JOSH.0000046073.05827.15

F. , D. Croce, V. T. Kindt, and ?. , Improving the preemptive bound for the single machine min-max lateness problem subject to release times, Operations Research Letters, vol.38, issue.10, pp.589-591, 2010.
URL : https://hal.archives-ouvertes.fr/hal-01023258

M. Dyer and L. , 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.
DOI : 10.1016/0166-218X(90)90104-K

M. Ehrgott, A survey and annotated bibliography of multiobjective combinatorial optimization, OR Spectrum, vol.22, issue.4, pp.425-460, 2000.
DOI : 10.1007/s002910000046

URL : https://hal.archives-ouvertes.fr/hal-00462047

V. Emelichev, Perepelitsa ? « On the cardinality of the set of alternatives in discrete many-criterion problems, Discrete Mathematics and Applications, vol.2, issue.5, pp.461-471, 1992.

B. Estève, C. Aubijoux, A. Chartier, and V. , A recovering beam search algorithm for the single machine Just-in-Time scheduling problem, European Journal of Operational Research, vol.172, issue.3, pp.798-813, 2006.
DOI : 10.1016/j.ejor.2004.11.014

M. Garey, Johnson ? « Strong np-completeness results : motivation, examples, and implications, J. Assoc. Comput. Mach, vol.3, issue.25, pp.499-508, 1978.
DOI : 10.1145/322077.322090

F. Gembicki and ?. , Vector optimization for control with performance and parameter sensitivity indices, 1973.

M. Gendreau, G. Laporte, and E. M. , A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times, European Journal of Operational Research, vol.133, issue.1, pp.183-189, 2001.
DOI : 10.1016/S0377-2217(00)00197-1

R. Graham and ?. , Bounds for certain multiprocessing anomalies », Bell System Tech, J, vol.45, pp.1563-1581, 1966.

A. Grigoriev and M. Sviridenko, Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times, Lecture Notes in Computer Science, vol.3509, pp.182-195, 2005.
DOI : 10.1007/11496915_14

J. Gupta, R. Ruiz, and J. Fowler, Mason ? « Operational planning and control of semiconductor wafer production », Production Planning and Control : The Management of Operations, pp.639-647, 2006.

Y. Haimes and L. Ladson, Wismer ? « On a bicriterion formulation of the problems of integrated system identification and system optimization, IEEE Trans. Systems, Man and Cybernetics, vol.1, pp.296-297, 1971.

L. Hall, S. Schulz, and D. , Shmoys ? « Scheduling to minimize average completion times : Off-line and on-line algorithms, Proceedings of 17th ACM- SIAM Symposium on Discrete Algorithms, pp.142-151, 1996.

S. Hartmann and ?. , A competitive genetic algorithm for resource-constrained project scheduling, Naval Research Logistics, vol.45, issue.7, pp.733-750, 1998.
DOI : 10.1002/(SICI)1520-6750(199810)45:7<733::AID-NAV5>3.0.CO;2-C

J. Holland, Adaptation in natural and artificial systems, 1975.

O. Ibarra and C. , Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors, Journal of the ACM, vol.24, issue.2, pp.280-289, 1977.
DOI : 10.1145/322003.322011

T. John and ?. , Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty, Computers & Operations Research, vol.16, issue.5, pp.471-479, 1984.
DOI : 10.1016/0305-0548(89)90034-8

D. Johnson and ?. , Approximation algorithms for combinatorial problems, Proceedings of the fifth annual ACM symposium on Theory of computing , STOC '73, pp.256-278, 1974.
DOI : 10.1145/800125.804034

D. Kalyanmoy, Miettinen ? « Nadir point estimation procedures using evolutionary approaches : Better accuracy and computational speed 140 BIBLIOGRAPHIE through focused search », Multiple Criteria Decision Making for Sustainable Energy and Transportation, pp.339-354, 2008.

T. Kawaguchi and S. , Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem, SIAM Journal on Computing, vol.15, issue.4, pp.1119-1129, 1986.
DOI : 10.1137/0215081

C. Koulamas and G. J. , Single-machine scheduling problems with past-sequence-dependent setup times, European Journal of Operational Research, vol.187, issue.3, pp.1045-1049, 2008.
DOI : 10.1016/j.ejor.2006.03.066

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

E. Lawler and ?. , Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints, Annals of Discrete Mathematics, vol.2, pp.75-90, 1978.
DOI : 10.1016/S0167-5060(08)70323-6

E. Lawler and J. , A Functional Equation and its Application to Resource Allocation and Sequencing Problems, Management Science, vol.16, issue.1, pp.77-84, 1969.
DOI : 10.1287/mnsc.16.1.77

C. Lee, A new dynamic programming algorithm for the parallel machines total weighted completion time problem, Operations Research Letters, vol.11, issue.2, pp.73-75, 1992.
DOI : 10.1016/0167-6377(92)90035-2

J. Lenstra, Complexity of Scheduling under Precedence Constraints, Operations Research, vol.26, issue.1, pp.22-35, 1978.
DOI : 10.1287/opre.26.1.22

J. Lenstra, A. Kan, and P. , Complexity of Machine Scheduling Problems, Annals of Discrete Mathematics, vol.1, pp.343-362, 1977.
DOI : 10.1016/S0167-5060(08)70743-X

J. Lenstra and D. Shmoys, Approximation algorithms for scheduling unrelated parallel machines, Mathematical Programming, vol.23, issue.1-3, pp.259-271, 1990.
DOI : 10.1007/BF01585745

J. Leung and G. , Minimizing Schedule Length Subject to Minimum Flow Time, SIAM Journal on Computing, vol.18, issue.2, pp.314-326, 1989.
DOI : 10.1137/0218022

L. Lovász and ?. , On the ratio of optimal integral and fractional covers, Discrete Mathematics, vol.13, issue.4, pp.383-390, 1975.
DOI : 10.1016/0012-365X(75)90058-8

M. Luque, K. Miettinen, and P. , Eskelinen et F. Ruiz ? « Incorporating preference information in interactive reference point methods for multiobjective optimization, pp.450-462, 2009.

M. Luque, F. Ruiz, and K. , Global formulation for interactive multiobjective optimization, OR Spectrum, vol.32, issue.3, pp.27-48, 2011.
DOI : 10.1007/s00291-008-0154-3

S. Mccormick and M. , Pinedo ? « Scheduling n independent jobs on m uniform machines with both flowtime and makespan objectives : A parametric analysis, J. Comput, vol.7, pp.63-77, 1995.

A. S. Mendes, F. M. Muller, and P. M. , Comparing meta-heuristic approaches for parallel machine scheduling problems, Production Planning & Control, vol.132, issue.2, pp.143-154, 2002.
DOI : 10.1080/00207548708919875

P. Merz, Freisleben ? « Fitness landscapes, memetic algorithms and greedy operators for graph bi-partitioning, Evolutionary Computation, vol.1, issue.8, pp.61-91, 2000.

R. M. Hallah and R. , Bulfin ? « Minimizing the weighted number of tardy jobs on a single machine with release dates, European Journal of Operational Research, vol.176, issue.2, pp.727-744, 2007.

L. Min, Cheng ? « Identical parallel machine scheduling problem for minimizing the makespan using genetic algorithm combined with simulated annealing, Chinese Journal of Electronics, vol.7, issue.4, pp.317-321, 1998.

S. Miyazaki and ?. , One machine scheduling problem with dual criteria, J. Oper. Res. Soc. Jpn, vol.24, pp.37-50, 1981.

L. Mönch and J. Fowler, Mason ? Production planning and control for semiconductor wafer fabrication facilities, Operations ResearchComputer Science Interfaces Series, vol.52, 2013.

L. Moalic, Gondran ? « The new memetic algorithm head for graph coloring : An easy way for managing diversity, pp.173-183, 2015.

C. Monma and C. , On the Complexity of Scheduling with Batch Setup Times, Operations Research, vol.37, issue.5, pp.798-804, 1989.
DOI : 10.1287/opre.37.5.798

P. Moscato and C. , Cotta ? « A modern introduction to memetic algorithms, pp.141-184, 2010.

T. Murofushi, M. Grabisch, T. Murofushi, and M. Sugeno, Sugeno ? « Fuzzy measures and fuzzy integrals, pp.3-41, 2000.

Y. Nikulin and K. , A new achievement scalarizing function based on parameterization in multiobjective optimization, OR Spectrum, vol.8, issue.3, pp.69-87, 2012.
DOI : 10.1007/s00291-010-0224-1

]. A. Obeid and S. , Scheduling job families on non-identical parallel machines with time constraints, Annals of Operations Research, vol.2, issue.6, pp.221-234, 2014.
DOI : 10.1007/s10479-012-1107-4

URL : https://hal.archives-ouvertes.fr/emse-00644092

G. Rabadi and R. Moraga, Heuristics for the Unrelated Parallel Machine Scheduling Problem with Setup Times, Journal of Intelligent Manufacturing, vol.70, issue.10, pp.85-97, 2006.
DOI : 10.1007/s10845-005-5514-0

S. Sahni and ?. , Algorithms for Scheduling Independent Tasks, Journal of the ACM, vol.23, issue.1, pp.116-127, 1976.
DOI : 10.1145/321921.321934

Y. Sawaragi and H. Nakayama, Tanino ? Theory of multiobjective optimization, 1985.

P. Serafini and ?. , Some Considerations about Computational Complexity for Multi Objective Combinatorial Problems, 1986.
DOI : 10.1007/978-3-642-46618-2_15

E. Shchepin, An optimal rounding gives a better approximation for scheduling unrelated machines, Operations Research Letters, vol.33, issue.2, pp.127-133, 2005.
DOI : 10.1016/j.orl.2004.05.004

J. Sousa and L. , A time indexed formulation of non-preemptive single machine scheduling problems, Mathematical Programming, vol.25, issue.1-3, pp.353-367, 1992.
DOI : 10.1007/BF01586059

V. T. Kindt and J. , Billaut ? Multicriteria scheduling : Theory, models and algorithms, 2006.

V. T. Kindt, F. Della-croce, and J. , Bouquard ? « Enumeration of pareto optima for a flowshop scheduling problem with two criteria, INFORMS Journal on Computing, vol.19, issue.1, pp.64-72, 2007.

R. Uszoy, C. Lee, and L. , Martin-Vega ? « A review of production planning and scheduling models in the semiconductor industry-part i : system characteristics , performance evaluation and production planning, IIE Transactions, vol.24, issue.4, pp.47-60, 1992.

G. Vilcot, J. Billaut, and C. , A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem, European Journal of Operational Research, vol.190, issue.2, pp.398-411, 2008.
DOI : 10.1016/j.ejor.2007.06.039

URL : https://hal.archives-ouvertes.fr/hal-00557270

S. Webster, Dynamic programming algorithms for scheduling parallel machines with family setup times, Computers & Operations Research, vol.28, issue.2, pp.127-137, 2001.
DOI : 10.1016/S0305-0548(99)00094-5

M. X. Weng and J. Lu, Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective, International Journal of Production Economics, vol.70, issue.3, pp.215-226, 2001.
DOI : 10.1016/S0925-5273(00)00066-9

D. White and ?. , A special multi-objective assignment problem, Journal of The Operational Research Society, vol.8, pp.759-767, 1984.

A. Wierzbicki and ?. , The use of reference objectives in multiobjective optimization », MCDM theory and Application, Proceedings, issue.177, pp.468-486, 1980.

G. Woeginger, Skutella ? « A ptas for minimizing the total weighted completion time on identical parallel machines, Mathematics of Operations Research, vol.25, issue.1, pp.63-75, 2000.