Trois docteurs (2011 - 2024) à Sorbonne Université

Publications 1998-2024

• 2024
  • M. Mallem, C. Hanen, A. Munier‑Kordon : “A New Structural Parameter on Single Machine Scheduling with Release Dates and Deadlines”, International Symposium on combinatorial optimization 2024, vol. 14594, Lecture Notes in Computer Science, Tenerife (Canaries), Spain, pp. 205-219, (Springer Nature Switzerland) (2024)
  • J. Grus, C. Hanen, Z. Hanzalek : “Packing-Inspired Algorithms for Periodic Scheduling Problems with Harmonic Periods”, Proceedings of the 13^th International Conference on Operations Research and Enterprise Systems - ICORES, vol. 1, Rome, Italy, pp. 101-112, (SciTePress - Science and Technology Publications), (ISBN: 978-989-758-681-1) (2024)
• 2023
  • J. Carlier, C. Hanen : “Measuring the slack between lower bounds for scheduling on parallel machines”, Annals of Operations Research, (Springer Verlag) (2023)
  • H. Vaillaud, C. Hanen, E. Hyon, C. Enderli : “Target search with an allocation of search effort to overlapping cones of observation”, Proceedings of the 18^th Conference on Computer Science and Intelligence Systems, Annals of Computer Science and Information Systems, vol. 35, Warsaw, Poland, pp. 801-811 (2023)
  • I. Tarhan, J. Carlier, C. Hanen, A. Jouglet, A. Munier‑Kordon : “Parametrized analysis of an enumerative algorithm for a parallel machine scheduling problem”, 29^th International European Conference on Parallel and Distributed Computing (EURO-PAR 2023), Limassol (Chypre), Cyprus (2023)
  • C. Hanen, A. Munier Kordon : “Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines”, Journal of Scheduling, (Springer Verlag) (2023)
  • H. Vaillaud, C. Hanen, E. Hyon, C. Enderli : “Target search with a radar on an airborne platform”, 2023 26^th International Conference on Information Fusion (FUSION), Charleston, SC, United States, pp. 1-8, (IEEE), (ISBN: 979-8-89034-485-4) (2023)
  • H. Vaillaud, C. Hanen, E. Hyon, C. Enderli : “Recherche d’une cible mobile dans un plan avec angles d’observation non disjoints”, 24^e Congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Rennes, France (2023)
• 2022
  • M. Mallem, C. Hanen, A. Munier‑Kordon : “Scheduling coupled tasks with time windows: a parameterized complexity analysis”, (2022)
  • M. Mallem, C. Hanen, A. Munier Kordon : “Parameterized complexity of a parallel machine scheduling problem”, International Symposium on Parameterized and Exact Computation (IPEC), Postdam, Germany (2022)
  • C. Hanen, M. Mallem, A. Munier‑Kordon : “Parameterized Complexity of Single-machine Scheduling with Precedence, Release Dates and Deadlines”, Models and Algorithms for Planning and Scheduling, Biella, Italy (2022)
  • H. Vaillaud, C. Enderli, C. Hanen, E. Hyon : “Planification de la recherche d’une cible par une plateforme aéroportée”, 23^e congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Villeurbanne - Lyon, France (2022)
  • C. Hanen, Z. Hanzalek : “Periodic Scheduling and Packing Problems”, (2022)
• 2021
  • C. Hanen, A. Munier Kordon, Th. Pedersen : “Two Deadline Reduction Algorithms for Scheduling Dependent Tasks on Parallel Processors”, Integration of Constraint Programming, Artificial Intelligence, and Operations Research, vol. 12735, Lecture Notes in Computer Science, Vienne, Austria, pp. 214-230, (Springer International Publishing) (2021)
  • C. Hanen : “Scheduling tasks with precedence constraint, release times and due dates on parallel processors: Bounds and approximations”, ROADEF 2021, Mulhouse (FR), France (2021)
  • C. Hanen, A. Munier Kordon, Th. Pedersen : “Two Deadline Reduction Algorithms for Scheduling Dependent Tasks on Parallel Processors (extended version)”, (2021)
• 2020
  • C. Hanen, A. Munier‑Kordon : “Two Deadline Reduction Algorithms for Scheduling Dependent Typed-tasks Systems”, ROADEF 2020, Montpellier, France (2020)
  • C. Hanen, Z. Hanzalek : “Grouping tasks to save energy in a cyclic scheduling problem: A complexity study”, European Journal of Operational Research, vol. 284 (2), pp. 445-459, (Elsevier) (2020)
• 2019
  • C. Hanen, A. Munier‑Kordon : “Cyclic DataFlows in computers and embedded systems”, chapter in Modelling and Performance Analysis of Cyclic Systems, vol. 241, Studies in Systems, Decision and Control, pp. 3-29, (Springer) (2019)
• 2017
  • A. Carlier, C. Hanen, A. Munier‑Kordon : “The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays”, Journal of Scheduling, pp. 1-9, (Springer Verlag) (2017)
• 2015
  • Z. Hanzalek, C. Hanen : “The impact of core precedences in a cyclic RCPSP with precedence delays”, Journal of Scheduling, vol. 18 (3), pp. 275-284, (Springer Verlag) (2015)
• 2014
  • A. Ahmad, Z. Hanzalek, C. Hanen : “A polynomial scheduling algorithm for IEEE 802.15. 4/ZigBee cluster tree WSN with one collision domain and period crossing constraint”, Emerging Technology and Factory Automation (ETFA), 2014 IEEE, Barcelona, Spain, pp. 1-8, (IEEE) (2014)
  • E. Hyon, C. Hanen, L. Mesnager : “Algeco : Algorithmique et Économie, une approche pluridisciplinaire entre Informatique, Mathématique et Économie”, chapitre de Économie, mathématique et histoire, Hommage à Christian Bidard, pp. 189-204, (Presse Universitaire de Paris Ouest) (2014)
• 2013
  • M. Ayala, A. Benabid, Ch. Artigues, C. Hanen : “The resource-constrained modulo scheduling problem: an experimental study”, Computational Optimization and Applications, vol. 54 (3), pp. 645-673, (Springer Verlag) (2013)
• 2012
  • A. Benabid, C. Hanen, O. Marchetti, A. Munier‑Kordon : “Periodic schedules for bounded timed weighted event graphs”, IEEE Transactions on Automatic Control, vol. 57 (5), pp. 1222-1232, (Institute of Electrical and Electronics Engineers) (2012)
  • Ch. Artigues, M. Ayala, A. Benabid, C. Hanen : “Bornes inférieures et supérieures pour l’ordonnancement modulo sous contraintes de ressources”, ROADEF 2012, Angers, France (2012)
  • A. Manaa, C. Hanen : “Cyclic scheduling with negative delays and resource constraints”, ROADEF 2012, Angers, France (2012)
  • Ch. Artigues, M. Ayala, A. Benabid, C. Hanen : “Lower and upper bounds for the resource-constrained modulo scheduling problem”, Project management and Scheduling conference, Louvain, Belgium, pp. 82-85 (2012)
  • C. Hanen, A. Munier‑Kordon : “Equivalence of two classical list scheduling algorithms for dependent tasks with release dates and due dates on parallel processors”, Project Management and Scheduling conference, Leuwen, Belgium (2012)
  • C. Hanen, Z. Hanzalek : “Grouping tasks to save energy in a cyclic scheduling problem: a complexity study”, ROADEF 2012, Angers, France (2012)
• 2011
  • A. Benabid, C. Hanen : “Worst case analysis of decomposed software pipelining for cyclic unitary RCPSP with precedence delays”, Journal of Scheduling, vol. 14 (5), pp. 511-522, (Springer Verlag) (2011)
  • Z. Hanzalek, C. Hanen : “Impact of Core Precedences in a Cyclic RCPSP with Temporal Constraints”, Multidisciplinary International Conference on Scheduling: Theory and Applications, Phoenix, Arizona, United States, pp. 245-260 (2011)
  • Z. Hanzalek, C. Hanen, P. Sucha : “Cyclic Scheduling - New Application and Concept of Core Precedences”, Workshop on Models and Algorithms for Planning and Scheduling Problems, Nymburk, Czechia (2011)
• 2010
  • A. Benabid, C. Hanen : “Performance of Garey Johnson algorithm for pipelined type tasks systems”, International Transactions in Operational Research, vol. 17 (6), pp. 797-808, (Wiley) (2010)
  • A. Benabid, C. Hanen : “Decomposed software pipelining for VLIW with precedence delays and resource constraints”, EURO conference, Lisbon, Portugal (2010)
  • A. Manaa, C. Hanen : “On the complexity of scheduling with negative time lags”, EURO conference, Lisbon, Portugal (2010)
  • A. Manaa, C. Hanen : “complexity results for the scheduling problem with negative time lags”, European Chapter on Combinatorial Optimization, Malaga, Spain (2010)
  • A. Benabid, C. Hanen : “Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors.”, Electronic Notes in Discrete Mathematics, vol. 36 (1), pp. 791-798, (Elsevier) (2010)
  • A. Benabid, C. Hanen : “Performance of Zinder-Roper algorithm for unitary RCPSP with constant precedence latencies”, 11^e Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2010), Toulouse, France (2010)
• 2009
  • A. Benabid, C. Hanen : “Decomposed software pipelining for cyclic unitary RCPSP with precedence delays”, Multidisciplinary International Conference on Scheduling: Theory and Applications, Dublin, Ireland (2009)
  • C. Hanen, Y. Zinder : “The worst-case analysis of the Garey-Johnson Algorithm”, Journal of Scheduling, vol. 12 (4), pp. 389-400, (Springer Verlag) (2009)
  • A. Benabid, C. Hanen : “Worst case analysis on modulo scheduling for specialized processors systems”, 10^e Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2009), Nancy, France, pp. 1-12 (2009)
  • C. Hanen, A. Munier‑Kordon : “Periodic Schedules for Linear Precedence Constraints”, Discrete Applied Mathematics, vol. 157 (2), pp. 280-291, (Elsevier) (2009)
  • E. Medernach, C. Hanen, Ph. Lacomme, E. Sanlaville : “Two linear programming formulations for scheduling multi-user periodic arrival tasks”, EURO 2009 - 23^rd European Conference on Operational Research, Bonn, Germany, pp. 1-3 (2009)
  • E. Sanlaville, E. Medernach, C. Hanen, Ph. Lacomme : “Two formulations for a grid cyclic scheduling problem”, Procceedings of MAPSP'2009, CTIT Workshop Proceedings, Abbey Rolduc, Netherlands, pp. 26-28 (2009)
  • C. Hanen : “Cyclic scheduling”, chapter in Introduction to Scheduling, pp. 103-128, (Chapman and Hall/CRC Computational Science), (ISBN: 978-1420072730) (2009)
• 2008
  • A. Benabid, C. Hanen : “Performance of the Garey-Johnson algorithm for pipelined task systems”, ALIO/EURO conference on combinatorial optimization, Buenos Aires, Argentina (2008)
  • C. Hanen, Y. Zinder : “The worst case analysis of the Garey-Johnson algorithm”, (2008)
  • A. Benabid, C. Hanen, O. Marchetti, A. Munier‑Kordon : “Periodic schedules for Unitary Timed Weighted Event Graphs”, 9^e Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2008), Clermont-Ferrand, France, pp. 17-31 (2008)
• 2007
  • C. Hanen, A. Munier‑Kordon : “Periodic schedules for generalized event graphs”, European Chapter on Combinatorial Optimization, Limassol, Cyprus, pp. 46-47 (2007)
  • B. Baynat, Ph. Chrétienne, C. Hanen, S. Kedad‑Sidhoum, A. Munier‑Kordon, Ch. Picouleau : “Exercices et problèmes d’algorithmique”, 460 pages, (Dunod), (ISBN: 2-10-051185-8) (2007)
• 2005
  • C. Hanen, Y. Zinder : “Scheduling UET-UCT Task Systems under the Out-forest precedence constraints”, Multidisciplinary International Conference on Scheduling: Theory and Applications, vol. 2, New York, United States, pp. 445-452 (2005)
  • C. Hanen, Y. Zinder : “The worst case analysis of Garey-Johnson algorithm for preemptive m processors”, Multidisciplinary International Conference on Scheduling: Theory and Applications, vol. 2, New York, United States, pp. 453-470 (2005)
• 2004
  • C. Hanen, D. Tayachi : “A dynamic programming algorithm for minimizing the total duplication cost in scheduling an outtree with communication delays”, (2004)
  • C. Hanen, A. Munier‑Kordon : “Ordonnancements périodiques pour contraintes de précédence linéaires”, (2004)
  • C. Hanen, A. Munier‑Kordon : “Periodic schedules for linear precedence graphs”, PMS 2004 - 9^th International Workshop on Project Management and Scheduling, Nancy, France (2004)
  • Ch. Artigues, Ph. Baptiste, J. Carlier, Ph. Chrétienne, Ch. Guéret, C. Hanen, S. Kedad‑Sidhoum, Ch. Lahlou, Ch. Lenté, A. Munier‑Kordon, E. Neron, Ch. Picouleau, E. Pinson, M.‑C. Portmann, Ch. Prins, C. Proust, D. Rivreau, F. Sourd : “Modèles et Algorithmes en Ordonnancement: Exercices et Problèmes Corrigés”, 227 p pages, (Ellipses), (ISBN: 978-2729821715) (2004)
• 2003
  • V. Do, C. Hanen, Y. Zinder : “Scheduling UET tasks and preemptive tasks on parallel processors under the restriction of precedence constraints”, MAPSP 2003 - 6^th workshop on Models and Algorithms for Planning and Scheduling Problems, Aussois, France (2003)
  • B. Baynat, Ph. Chrétienne, C. Hanen, S. Kedad‑Sidhoum, A. Munier, Ch. Picouleau : “Exercices et Problèmes d’Algorithmique”, (Dunod), (ISBN: 2100056433) (2003)
• 2002
  • C. Hanen, A. Munier‑Kordon : “Minimizing the volume in scheduling an outtree with communication delays and duplication”, Parallel Computing, vol. 28 (11), pp. 1573-1585, (Elsevier) (2002)
  • C. Hanen, Y. Zinder : “The Worst-Case Analysis of the Garey-Johnson Algorithm”, PMS 2002 - 8^th International Workshop on Project Management and Scheduling, Valencia, Spain (2002)
• 2001
  • C. Hanen, A. Munier : “Minimizing the volume in scheduling an outtree with communication delays and duplication”, (2001)
  • C. Hanen, A. Munier‑Kordon : “An approximation algorithm for scheduling dependent tasks on m processors with small communication delays”, Discrete Applied Mathematics, vol. 108 (3), pp. 239-257, (Elsevier) (2001)
• 2000
  • C. Hanen, A. Munier : “Minimizing the volume in scheduling an out-tree with communication delays and duplication”, Seventh International workshop on project management and scheduling (PMS2000), Osnabrück, Germany (2000)
• 1998
  • C. Hanen, A. Munier : “Performance of Coffmann-Graham schedules in presence of unit communication delays”, Discrete Applied Mathematics, vol. 81 (1-3), pp. 93-108, (Elsevier) (1998)