Single-machine scheduling with learning considerations, European Journal of Operational Research, vol.115, issue.1, pp.173-178, 1999. ,
DOI : 10.1016/S0377-2217(98)00246-X
Rank aggregation with ties, Proceedings of the VLDB Endowment (PVLDB), 2015. ,
DOI : 10.14778/2809974.2809982
URL : https://hal.archives-ouvertes.fr/hal-01152098
Introduction to algorithms, 2009. ,
Treating Progress Functions as a Managerial Opportunity, The Academy of Management Review, vol.9, issue.2, pp.235-247, 1984. ,
Comparing and aggregating rankings with ties, Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '04, pp.47-58, 2004. ,
DOI : 10.1145/1055558.1055568
Single machine scheduling models with deterioration and??learning: handling precedence constraints via??priority??generation, Journal of Scheduling, vol.35, issue.5, pp.357-370, 2008. ,
DOI : 10.1007/s10951-008-0064-x
Single facility scheduling with nonlinear processing times, Computers & Industrial Engineering, vol.14, issue.4, pp.387-393, 1988. ,
DOI : 10.1016/0360-8352(88)90041-1
The complexity of Kemeny elections, Theoretical Computer Science, vol.349, issue.3, pp.382-391577, 1959. ,
DOI : 10.1016/j.tcs.2005.08.031
Lexicographic flow, 2009. ,
Fair and reasonable election systems Faster algorithms for bound-consistency of the sortedness and the alldifferent constraint, Principles and Practice of Constraint Programming?CP 2000, pp.34-46, 1975. ,
Getting to the real problem: experience with BNR Prolog in OR, Proceedings of the Third Conference on Practical Applications of Prolog, pp.465-478, 1995. ,
CHARME: Un langage industriel de programmation par contraintes, illustré par une application chez Renault, Ninth International Workshop on Expert Systems and their Applications: General Conference, pp.55-70, 1989. ,
A fast and simple algorithm for bounds consistency of the alldifferent constraint, Proceedings of the 18th International Joint Conference on Artificial Intelligence, pp.245-250, 2003. ,
Scheduling with batching: A review, European Journal of Operational Research, vol.120, issue.2, pp.228-249, 2000. ,
DOI : 10.1016/S0377-2217(99)00153-8
Alessandro Zanarini and Gilles Pesant. Generalizations of the global cardinality constraint for hierarchical resources, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), pp.361-375, 2007. ,