Articles

• M. Mallem, C. Hanen, A. Munier‑Kordon : “Coupled-task scheduling with time windows, bounded pathwidth and bounded slack is para-NP-complete”, Theoretical Computer Science, vol. 1069, pp. 115813, (Elsevier) [Mallem 2026a]
• M. Dvořák, A. Novák, P. Sucha, D. Knop, C. Hanen : “Parameterized complexity of scheduling problems in robotic process automation”, European Journal of Operational Research, (Elsevier) [Dvořák 2026]
• M. Mallem, C. Hanen, A. Munier‑Kordon : “Single machine scheduling with precedence constraints and bounded maximum delay value”, Journal of Combinatorial Optimization, vol. 51 (3), pp. 33, (Springer Verlag) [Mallem 2026b]
• I. Tarhan, C. Hanen, A. Munier‑Kordon, J. Carlier, A. Jouglet : “FPT implicit enumeration of active schedules”, Discrete Applied Mathematics, vol. 376, pp. 235-250, (Elsevier) [Tarhan 2025]
• J. Grus, C. Hanen, Z. Hanzalek : “Periodic chains scheduling on dedicated resources - A crucial problem in time-sensitive networks”, Computers and Operations Research, vol. 180, pp. 107072, (Elsevier) [Grus 2025]
• J. Carlier, C. Hanen : “Measuring the slack between lower bounds for scheduling on parallel machines”, Annals of Operations Research, vol. 338, pp. 347–377, (Springer Verlag) [Carlier 2024]
• C. Hanen, A. Munier Kordon : “Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines”, Journal of Scheduling, (Springer Verlag) [Hanen 2023]
• 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) [Hanen 2020b]
• 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) [Carlier 2017]
• 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) [Hanzalek 2015]
• 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) [Ayala 2013]
• 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) [Benabid 2012]
• 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) [Benabid 2011]
• 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) [Benabid 2010b]
• 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) [Benabid 2010c]
• C. Hanen, A. Munier‑Kordon : “Periodic Schedules for Linear Precedence Constraints”, Discrete Applied Mathematics, vol. 157 (2), pp. 280-291, (Elsevier) [Hanen 2009b]
• C. Hanen, Y. Zinder : “The worst-case analysis of the Garey-Johnson Algorithm”, Journal of Scheduling, vol. 12 (4), pp. 389-400, (Springer Verlag) [Hanen 2009c]
• 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) [Hanen 2002a]
• 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) [Hanen 2001b]
• 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) [Hanen 1998]

Conference papers

• A. Munier‑Kordon, C. Hanen : “A New Parameter for Scheduling Dependent Tasks”, 27e congrès annuel de la société française de recherche opérationnelle et d'aide à la décision, Tours, France [Munier-Kordon 2026]
• C. Hanen, A. Munier Kordon, I. Tarhan : “A New Parameterized Complexity Analysis for Scheduling Precedence-Constrained Tasks on Parallel Machines”, Project Management and Scheduling 2026, Toulouse, France [Hanen 2026]
• A. Guigal, E. Hyon, C. Hanen : “Improving the Planning of Stochastic Tasks with Availability Windows Using Prediction”, Integration of Constraint Programming, Artificial Intelligence, and Operations Research, vol. 16595, Lecture Notes in Computer Science, Rabat, Morocco, pp. 191-206, (Springer Nature Switzerland), (ISBN: 978-3-032-27242-3) [Guigal 2026]
• J. Pikman, P. Sucha, C. Hanen, Z. Hanzalek : “Multiple-Interval Coverage for Resource Management of Passive Surveillance Systems”, The 40^th Annual AAAI Conference on Artificial Intelligence, vol. 40 (43), Singapore, Singapore, pp. 37134-37142 [Pikman 2026]
• J. Grus, Z. Hanzalek, C. Hanen : “Periodic Scheduling of Grouped Time-Triggered Signals on a Single Resource”, Project Management and Scheduling, Toulouse, France [Grus 2026]
• A. Guigal, C. Hanen, E. Hyon : “Planification de tâches aléatoires avec fenêtres de disponibilit”, ROADEF 2025, Champs sur Marme, France [Guigal 2025]
• 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, Spain, pp. 205-219, (Springer Nature Switzerland) [Mallem 2024a]
• 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) [Grus 2024]
• M. Mallem, C. Hanen, A. Munier‑Kordon : “Parameterized complexity: a two-dimensional approach to study scheduling problems”, 25ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2024), Amiens, France [Mallem 2024b]
• I. Tarhan, J. Carlier, C. Hanen, A. Jouglet, A. Munier Kordon : “Parameterized Analysis of a Dynamic Programming Algorithm for a Parallel Machine Scheduling Problem”, Euro-Par 2023: Parallel Processing, vol. 14100, Lecture Notes in Computer Science, Limassol, Cyprus, pp. 139-153, (Springer Nature Switzerland), (ISBN: 978-3-031-39698-4) [Tarhan 2023]
• H. Vaillaud, C. Hanen, E. Hyon, C. Enderli : “Recherche d'une cible mobile dans un plan avec angles d'observation non disjoints”, 24ème Congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Rennes, France [Vaillaud 2023a]
• 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) [Vaillaud 2023b]
• 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 [Vaillaud 2023c]
• 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 [Mallem 2022b]
• C. Hanen, M. Mallem, A. Munier‑Kordon : “Parameterized Complexity of Single-machine Scheduling with Precedence, Release Dates and Deadlines”, Workshop on Models and Algorithms for Planning and Scheduling (MAPSP 2021), Bielle, Italy [Hanen 2022a]
• H. Vaillaud, C. Enderli, C. Hanen, E. Hyon : “Planification de la recherche d'une cible par une plateforme aéroportée”, 23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Villeurbanne - Lyon, France [Vaillaud 2022]
• C. Hanen : “Scheduling tasks with precedence constraint, release times and due dates on parallel processors: Bounds and approximations”, ROADEF 2021, Mulhouse (FR), France [Hanen 2021a]
• 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) [Hanen 2021c]
• C. Hanen, A. Munier‑Kordon : “Two Deadline Reduction Algorithms for Scheduling Dependent Typed-tasks Systems”, ROADEF 2020, Montpellier, France [Hanen 2020a]
• 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) [Ahmad 2014]
• 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 [Artigues 2012a]
• A. Manaa, C. Hanen : “Cyclic scheduling with negative delays and resource constraints”, ROADEF 2012, Angers, France [Manaa 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 [Hanen 2012a]
• C. Hanen, Z. Hanzalek : “Grouping tasks to save energy in a cyclic scheduling problem: a complexity study”, ROADEF 2012, Angers, France [Hanen 2012b]
• 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 [Artigues 2012b]
• 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 [Hanzalek 2011b]
• 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 [Hanzalek 2011a]
• A. Manaa, C. Hanen : “complexity results for the scheduling problem with negative time lags”, European Chapter on Combinatorial Optimization, Malaga, Spain [Manaa 2010a]
• A. Benabid, C. Hanen : “Decomposed software pipelining for VLIW with precedence delays and resource constraints”, EURO conference, Lisbon, Portugal [Benabid 2010a]
• A. Manaa, C. Hanen : “On the complexity of scheduling with negative time lags”, EURO conference, Lisbon, Portugal [Manaa 2010b]
• A. Benabid, C. Hanen : “Performance of Zinder-Roper algorithm for unitary RCPSP with constant precedence latencies”, 11ème Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2010), Toulouse, France [Benabid 2010d]
• A. Benabid, C. Hanen : “Decomposed software pipelining for cyclic unitary RCPSP with precedence delays”, Multidisciplinary International Conference on Scheduling: Theory and Applications, Dublin, Ireland [Benabid 2009a]
• 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 [Sanlaville 2009]
• E. Medernach, C. Hanen, Ph. Lacomme, E. Sanlaville : “Two linear programming formulations for scheduling multi-user periodic arrival tasks”, EURO 2009 - 23rd European Conference on Operational Research, Bonn, Germany, pp. 1-3 [Medernach 2009]
• A. Benabid, C. Hanen : “Worst case analysis on modulo scheduling for specialized processors systems”, 10ème 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 [Benabid 2009b]
• A. Benabid, C. Hanen : “Performance of the Garey-Johnson algorithm for pipelined task systems”, ALIO/EURO conference on combinatorial optimization, Buenos Aires, Argentina [Benabid 2008a]
• A. Benabid, C. Hanen, O. Marchetti, A. Munier‑Kordon : “Periodic schedules for Unitary Timed Weighted Event Graphs”, 9ème 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 [Benabid 2008b]
• C. Hanen, A. Munier‑Kordon : “Periodic schedules for generalized event graphs”, European Chapter on Combinatorial Optimization, Limassol, Cyprus, pp. 46-47 [Hanen 2007]
• 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 [Hanen 2005a]
• 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 [Hanen 2005b]
• C. Hanen, A. Munier‑Kordon : “Periodic schedules for linear precedence graphs”, PMS 2004 - 9^th International Workshop on Project Management and Scheduling, Nancy, France [Hanen 2004b]
• 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 [Do 2003]
• 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 [Hanen 2002b]
• 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 [Hanen 2000]

Books

• 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) [Baynat 2007]
• 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) [Artigues 2004]
• B. Baynat, Ph. Chrétienne, C. Hanen, S. Kedad‑Sidhoum, A. Munier, Ch. Picouleau : “Exercices et Problèmes d'Algorithmique”, (Dunod), (ISBN: 2100056433) [Baynat 2003a]
• B. Baynat, Ph. Chrétienne, C. Hanen, S. Kedad‑Sidhoum, A. Munier, Ch. Picouleau : “Exercices et Problèmes d'Algorithmique”, (Dunod), (ISBN: 2100056433) [Baynat 2003b]
• B. Baynat, Ph. Chrétienne, C. Hanen, S. Kedad‑Sidhoum, A. Munier, Ch. Picouleau : “Exercices et Problèmes d'Algorithmique”, (Dunod), (ISBN: 2100056433) [Baynat 2003c]
• B. Baynat, Ph. Chrétienne, C. Hanen, S. Kedad‑Sidhoum, A. Munier, Ch. Picouleau : “Exercices et Problèmes d'Algorithmique”, (Dunod), (ISBN: 2100056433) [Baynat 2003d]

Book chapters

• 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) [Hanen 2019]
• 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) [Hyon 2014]
• C. Hanen : “Cyclic scheduling”, chapter in Introduction to Scheduling, pp. 103-128, (Chapman and Hall/CRC Computational Science), (ISBN: 978-1420072730) [Hanen 2009a]

Other publications

• C. Hanen, Z. Hanzalek : “Periodic Scheduling and Packing Problems”, [Hanen 2022b]
• M. Mallem, C. Hanen, A. Munier‑Kordon : “Scheduling coupled tasks with time windows: a parameterized complexity analysis”, [Mallem 2022c]
• C. Hanen, A. Munier Kordon, Th. Pedersen : “Two Deadline Reduction Algorithms for Scheduling Dependent Tasks on Parallel Processors (extended version)”, [Hanen 2021b]
• C. Hanen, Y. Zinder : “The worst case analysis of the Garey-Johnson algorithm”, [Hanen 2008]
• C. Hanen, D. Tayachi : “A dynamic programming algorithm for minimizing the total duplication cost in scheduling an outtree with communication delays”, [Hanen 2004c]
• C. Hanen, A. Munier‑Kordon : “Ordonnancements périodiques pour contraintes de précédence linéaires”, [Hanen 2004a]
• C. Hanen, A. Munier : “Minimizing the volume in scheduling an outtree with communication delays and duplication”, [Hanen 2001a]