14 Docteurs 1998 - 2023

Publications 1998-2024

• 2024
  • V. Fu, L. Zaourar, A. Munier‑Kordon, M. Duranton : “Design space exploration of HPC systems with Random Forest-based Bayesian Optimization”, RAPIDO '24 - Proceedings of the 16^th Workshop on Rapid Simulation and Performance Evaluation for Design Optimization: Methods and Tools, Munich, Germany, pp. 9-15, (Association for Computing Machinery), (ISBN: 9798400717918) (2024)
• 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)
  • A. Oudrhiri, E. Taly, N. Bain, A. Munier‑Kordon, R. Guizzetti, P. Urard : “Performance Modeling and Estimation of a Configurable Output Stationary Neural Network Accelerator”, (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)
• 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)
  • A. Munier‑Kordon, N. Tang : “A fixed-parameter algorithm for a unit-execution-time unit-communication-time tasks scheduling problem with a limited number of identical processors”, RAIRO - Operations Research, vol. 56 (5), pp. 3777-3788, (EDP Sciences) (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)
• 2021
  • N. Tang, A. Kordon : “A Fixed-Parameter Algorithm for Scheduling Unit dependent Tasks with Unit Communication Delays”, Euro-Par 2021 - 27^th International European Conference on Parallel and Distributed Computing, vol. 12820, Lecture Notes in Computer Science, Lisbon, Portugal, pp. 105-119, (Springer, Cham) (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, A. Munier Kordon, Th. Pedersen : “Two Deadline Reduction Algorithms for Scheduling Dependent Tasks on Parallel Processors (extended version)”, (2021)
• 2020
  • A. Kordon : “A Fixed-Parameter Algorithm for Scheduling Unit Dependent Tasks on Parallel Machines with Time Windows”, Discrete Applied Mathematics, (Elsevier) (2020)
  • M. Ait Aba, L. Zaourar, A. Munier : “Efficient algorithm for scheduling parallel applications on hybrid multicore machines with communications delays and energy constraint”, Concurrency and Computation: Practice and Experience, vol. 32 (15), Special Issue on New Trends in Adaptive Smart Systems, Services, and Architectures (WETICE/AROSA2017). The Twenty Seventh International Heterogeneity in Computing Workshop (HCW2018) and the Sixteenth International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Platforms (HeteroPar2018), pp. e5573, (Wiley) (2020)
  • M. Ait Aba, L. Zaourar, A. Munier : “Polynomial Scheduling Algorithm for Parallel Applications on Hybrid Platforms”, 6^th International Symposium, ISCO 2020, vol. 12176, Lecture Notes in Computer Science, Montreal, Canada, pp. 143-155, (Springer International Publishing) (2020)
  • C. Hanen, A. Munier‑Kordon : “Two Deadline Reduction Algorithms for Scheduling Dependent Typed-tasks Systems”, ROADEF 2020, Montpellier, France (2020)
  • A. Kordon, N. Tang : “Evaluation of the Age Latency of a Real-Time Communicating System using the LET paradigm”, ECRTS 2020, vol. 165, Leibniz International Proceedings in Informatics (LIPIcs), Modena, Italy, (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik) (2020)
• 2019
  • M. Aba, A. Munier‑Kordon, G. Pallez : “Scheduling on Two Unbounded Resources with Communication Costs”, Euro-Par - European Conference on Parallel Processing, Gottingen, Germany (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)
• 2018
  • M. Aba, L. Zaourar, A. Munier‑Kordon : “Approximation algorithm for scheduling applications on hybrid multi-core machines with communications delays”, 2018 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), Vancouver, Canada, pp. 36-45, (IEEE) (2018)
  • M. Ait Aba, L. Zaourar, A. Munier : “Approximation algorithm for scheduling a chain of tasks on heterogeneous systems”, Euro-Par 2017: Parallel Processing Workshops, vol. 10659, Lecture Notes in Computer Science, Santiago de Compostela, Spain, pp. 353-365, (Springer, Cham) (2018)
• 2017
  • H. Deroui, K. Desnos, J.‑F. Nezan, A. Munier‑Kordon : “Relaxed Subgraph Execution Model for the Throughput Evaluation of IBSDF Graphs”, International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation (SAMOS), SAMOS, Greece (2017)
  • H. Deroui, K. Desnos, J.‑F. Nezan, A. Munier‑Kordon : “Throughput Evaluation of DSP Applications based on Hierarchical Dataflow Models”, International Symposium on Circuits and Systems (ISCAS), Baltimore, United States (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)
• 2016
  • Th. Hujsa, J.‑M. Delosme, A. Munier‑Kordon : “On liveness and reversibility of equal-conflict Petri nets”, Fundamenta Informaticae, vol. 146 (1), pp. 83-119, (Polskie Towarzystwo Matematyczne) (2016)
  • B. Bodin, A. Munier‑Kordon, B. Dupont De Dinechin : “Optimal and fast throughput evaluation of CSDF”, Design Automation Conference DAC, Austin, United States, pp. 160, (ACM) (2016)
  • J. Khatib, A. Munier‑Kordon, E. Klikpo, T.‑C. Kods : “Computing latency of a real-time system modeled by Synchronous Dataflow Graph”, Real-Time Networks and Systems RTNS, Brest, France, pp. 87-96 (2016)
  • E. Klikpo, A. Munier‑Kordon : “Preemptive scheduling of dependent periodic tasks modeled by synchronous dataflow graphs”, Real-Time Networks and Systems RTNS, Brest, France, pp. 77-86 (2016)
  • Y. LESPARRE, A. Munier‑Kordon, J.‑M. Delosme : “Evaluation of Synchronous Dataflow Graph Mappings onto Distributed Memory Architectures”, 2016 Euromicro Conference on Digital System Design, DSD 2016, Limassol, Cyprus, pp. 146-153, (IEEE Computer Society) (2016)
  • E. Klikpo, J. Khatib, A. Munier‑Kordon : “Modeling Multi-Periodic Simulink Systems by Synchronous Dataflow Graphs”, Real-Time and Embedded Technology and Application Symposium RTAS, Vienna, Austria, pp. 1-10, (IEEE) (2016)
• 2015
  • Th. Hujsa, J.‑M. Delosme, A. Munier Kordon : “On the Reversibility of Live Equal-Conflict Petri Nets”, Proceedings of the 36^th International Conference on Application and Theory of Petri Nets and Concurrency, PETRI NETS 2015, vol. 9115, Lecture Notes in Computer Science, Bruxelles, Belgium, pp. 234-253, (Springer) (2015)
  • A. Carlier, A. Munier‑Kordon, W. Klaudel : “Optimisation d’un système d’autopartage avec contraintes de relocalisation de véhicules”, 16^e conférence ROADEF (ROADEF 2015), Marseille, France (2015)
  • A. Carlier, F. TSCHIRHART, F. Da Silva, F. STEPHAN, O. Thoni, A. Munier‑Kordon, M. Abid, L. SCREMIN, L. Couturier : “An Overview of Multimodal Transport Design and Challenges Underlined by a Carsharing Case Study”, Complex Systems Design & Management, Paris, France, pp. 257-268, (Springer International Publishing) (2015)
  • A. Carlier, A. Munier‑Kordon, W. Klaudel : “Mathematical Model for the Study of Relocation Strategies in One-way Carsharing Systems”, Transportation Research Procedia, vol. 10, pp. 374-383, (Elsevier) (2015)
• 2014
  • A. Carlier, A. Munier‑Kordon, W. Klaudel : “Optimization of a one-way carsharing system with relocation operations”, 10^th International Conference on Modeling, Optimization and SIMulation MOSIM 2014, Nancy, France (2014)
  • B. Dupont De Dinechin, A. Munier‑Kordon : “Converging to periodic schedules for cyclic scheduling problems with resources and deadlines”, Computers and Operations Research, vol. 51, pp. 227-236, (Elsevier) (2014)
  • Th. Hujsa, J.‑M. Delosme, A. Munier‑Kordon : “Polynomial Sufficient Conditions of Well-Behavedness and Home Markings in Subclasses of Weighted Petri Nets”, ACM Transactions on Embedded Computing Systems (TECS), vol. 13 (4), pp. 141:1-141:25, (ACM) (2014)
  • B. Bodin, Y. LESPARRE, J.‑M. Delosme, A. Munier‑Kordon : “Fast and efficient dataflow graph generation”, Proc. of the 17^th International Workshop on Software and Compilers for Embedded Systems (SCOPES 2014), Schloss RheinfelsSt. Goar, Germany, pp. 40-49 (2014)
  • Th. Hujsa, J.‑M. Delosme, A. Munier‑Kordon : “On the Reversibility of Well-Behaved Weighted Choice-Free Systems”, 35^th International Conference on Application and Theory of Petri Nets and Concurrency, PETRI NETS 2014, vol. 8489, Lecture Notes in Computer Science, Tunis, Tunisia, pp. 334-353, (Springer International Publishing) (2014)
  • L. Zaourar, Y. LESPARRE, A. Munier : “Ratio de performance d’algorithmes de bin packing en deux dimensions pour des tests de mémoires”, ROADEF - 15^e congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision, Bordeaux, France (2014)
  • A. Munier‑Kordon, D. Rebaine : “The coupled unit-time operations problem on identical parallel machines with respect to the makespan”, Operations Research Letters, vol. 42 (1), pp. 21-26, (Elsevier) (2014)
• 2013
  • B. Bodin, A. Munier‑Kordon, B. Dupont De Dinechin : “Periodic Schedules for Cyclo-Static Dataflow”, 11^th IEEE Symposium on Embedded Systems For Real-time Multimedia (ESTIMedia 2013), Montreal, Canada, pp. 105-114 (2013)
  • D. Genius, A. Munier‑Kordon, Kh. Zine el Abidine : “Space Optimal Solution for Data Reordering in Streaming Applications on NoC based MPSoC”, Journal of Systems Architecture, vol. 59 (7), pp. 455-467, (Elsevier) (2013)
  • M. Benazouz, A. Munier‑Kordon : “Cyclo-static DataFlow Phases Scheduling Optimization for Buffer Sizes Minimization”, M-SCOPES '13, St. Goar, Germany, pp. 3-12, (ACM) (2013)
  • J.‑M. Delosme, Th. Hujsa, A. Munier‑Kordon : “Polynomial Sufficient Conditions of Well-Behavedness for Weighted Join-Free and Choice-Free Systems”, 13^th International Conference of Application of Concurrency to System Design (ACSD 2013), Barcelona, Spain, pp. 90-99, (IEEE) (2013)
  • M. Benazouz, A. Munier‑Kordon, Th. Hujsa, B. Bodin : “Liveness evaluation of a cyclo-static DataFlow graph”, The 50^th Annual Design Automation Conference, DAC 2013, Austin, United States, pp. 3:1-3:7, (ACM) (2013)
  • A. Munier‑Kordon, F. Kacem, B. Dupont De Dinechin, L. Finta : “Scheduling an interval ordered precedence graph with communication delays and a limited number of processors”, RAIRO - Operations Research, vol. 47 (1), pp. 73-87, (EDP Sciences) (2013)
• 2012
  • B. Bodin, A. Munier‑Kordon, B. Dupont De Dinechin : “K-Periodic schedules for evaluating the maximum throughput of a Synchronous Dataflow graph”, Proceedings 2012 International Conference on Embedded Computer Systems: Architectures, Modeling and Simulation (SAMOS), Samos, Greece, pp. 152-159 (2012)
  • L. Zaourar, A. Munier‑Kordon : “An approximation algorithm for testing memories of an integrated circuit”, Fourth International Workshop on Bin Packing and Placement Constraints BPPC'12, Nantes, France, pp. 1-6 (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)
  • L. Zaourar, A. Munier‑Kordon : “Algorithme d’approximation pour le test de mémoires.”, Congrès annuel de la société française de Recherche Opérationnelle et d'Aide à la Décision, Angers, France (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)
• 2011
  • M. Benazouz, A. Munier‑Kordon : “Cyclo-Static DataFlow Phases Scheduling Optimization for the Throughput Constrained Buffer Sizes Minimization Problem”, (2011)
  • L. Zaourar, A. Munier‑Kordon : “Etude du problème de partage de blocs BIST pour le test des mémoires.”, Congrès annuel de la société française de Recherche Opérationnelle et d'Aide à la Décision, Saint Etienne, France (2011)
  • A. Munier‑Kordon : “A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule”, Journal of Scheduling, vol. 14 (1), pp. 103-117, (Springer Verlag) (2011)
• 2010
  • M. Benazouz, O. Marchetti, A. Munier‑Kordon, Th. Michel : “A New Method for Minimizing Buffer Sizes for Cyclo-Static Dataflow Graphs.”, ESTIMedia 2010 - 8^th IEEE International Workshop on Embedded Systems for Real-Time Multimedia, Scottsdale, Arizona, United States, pp. 11-20, (IEEE) (2010)
  • O. Marchetti, A. Munier‑Kordon : “Complexity results for bi-criteria cyclic scheduling problems”, Discrete Optimization, vol. 7 (3), pp. 166-180, (Elsevier) (2010)
  • M. Benazouz, O. Marchetti, A. Munier‑Kordon, P. Urard : “A new Approach for Minimizing Buffer Capacities with Throughput Constraint for Embedded System Design.”, AICCSA IEEE/ACS International Conference on Computer Systems and Applications, Hammamet, Tunisia, pp. 1-8, (IEEE) (2010)
  • A. Munier‑Kordon, D. Rebaine : “The two-machine open shop problem with unit-time opera- tions and time delays to minimize the makespan”, European Journal of Operational Research, vol. 203 (1), pp. 42-49, (Elsevier) (2010)
• 2009
  • O. Marchetti, A. Munier‑Kordon : “A sufficient condition for the liveness of weighted event graphs”, European Journal of Operational Research, vol. 197 (2), pp. 532-540, (Elsevier) (2009)
  • D. Genius, A. Munier‑Kordon, Kh. Zine el Abidine : “A Buffer Space Optimal Solution for Re-establishing the Packet Order in a MPSoC Network Processor”, Euro-Par European Conference on Parallel computing, vol. 5704, Lecture Notes in Computer Science, Delft, Netherlands, pp. 216-227, (Springer) (2009)
  • M. Benazouz, O. Marchetti, A. Munier‑Kordon, P. Urard : “A Polynomial Algorithm for the Computation of Buffer Capacities with Throughput Constraint for Embedded System Design”, CIE IEEE International Conference on Computers & Industrial Engineering, Troyes, France, pp. 690-695, (IEEE) (2009)
  • S. Achouri, T. Bossart, A. Munier‑Kordon : “A Polynomial algorithm for minDSC on series-parallel graphs”, RAIRO - Operations Research, vol. 43 (2), pp. 145-156, (EDP Sciences) (2009)
  • C. Hanen, A. Munier‑Kordon : “Periodic Schedules for Linear Precedence Constraints”, Discrete Applied Mathematics, vol. 157 (2), pp. 280-291, (Elsevier) (2009)
  • O. Marchetti, A. Munier‑Kordon : “Cyclic Scheduling for the Synthesis of Embedded Systems”, chapter in Introduction to Scheduling, pp. 129-154, (Chapman and Hall/CRC Computational Science), (ISBN: 978-1420072730) (2009)
• 2008
  • O. Marchetti, A. Munier‑Kordon : “Minimizing Place Capacities of Weighted Event Graphs for Enforcing Liveness”, Discrete Event Dynamic Systems, vol. 18 (1), pp. 91-109, (Springer Verlag) (2008)
  • A. Munier‑Kordon, D. Rebaine : “A polynomial time algorithms for the UET permutation flowshop problem with time delays”, Computers and Operations Research, vol. 35 (2), pp. 525-537, (Elsevier) (2008)
  • S. Belloeil, R. Chotin‑Avot, H. Mehrez, A. Munier‑Kordon : “Automatic Allocation of Redundant Operators in Arithmetic Data path Optimization”, DASIP IEEE International Conference on Design and Architectures for Signal and Image Processing, Bruxelles, Belgium, pp. 176-183 (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
  • T. Bossart, A. Munier‑Kordon, F. Sourd : “Memory Management Optimization Problems for Integrated Circuit Simulators”, Discrete Applied Mathematics, vol. 155 (14), pp. 1795-1811, (Elsevier) (2007)
  • A. Munier‑Kordon, D. Rebaine : “An approximation algorithm for the UET two-machine open shop problem with time delays”, MISTA Multidisciplinary International Scheduling Conference: Theory and Applications, Paris, France, pp. 377-385 (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)
• 2006
  • O. Marchetti, A. Munier‑Kordon : “A polynomial algorithm for a bi-criteria cyclic scheduling problem.”, PlanSIG UK PLANNING AND SCHEDULING Special Interest Group, Nottingham, United Kingdom, pp. 88-96 (2006)
  • O. Marchetti, A. Munier‑Kordon : “Complexity results for bi-criteria cyclic scheduling problems”, RenPar Rencontres Francophones du Parallélisme, Perpignan, France, pp. 17-24 (2006)
• 2005
  • A. Munier‑Kordon, J.‑B. Note : “A Buffer Minimization Problem for the Design of Embedded Systems”, European Journal of Operational Research, vol. 164 (3), pp. 669-679, (Elsevier) (2005)
  • O. Marchetti, A. Munier‑Kordon : “A Sufficient Condition for the Liveness of Weighted Event Graphs”, (2005)
  • O. Marchetti, A. Munier‑Kordon : “Minimizing Places Storage Capacities of a Weighted Event Graph.”, (2005)
• 2004
  • A. Munier‑Kordon : “Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay”, Operations Research Letters, vol. 32 (6), pp. 557-564, (Elsevier) (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
  • A. Munier‑Kordon, F. Sourd : “Scheduling chains on a single machine with non-negative time lags”, Mathematical Methods of Operations Research, vol. 57 (1), pp. 111-123, (Springer Verlag) (2003)
  • A. Munier‑Kordon : “Variants of the two machine flow-shop with precedence constraints”, MAPSP 2003 - 6^th Workshop on Methods and Algorithms for Planning and Scheduling Problems, Aussois, France (2003)
  • T. Bossart, A. Munier‑Kordon, F. Sourd : “Optimisation de l’utilisation de la mémoire pour un simulateur de circuits”, 5^e Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2003), Avignon, France, pp. 393-394 (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)
  • A. Munier‑Kordon, J.‑B. Note : “A Buffer Minimization Problem for the Design of Embedded Systems”, (2002)
  • E. Encrenaz, A. Munier, F. Pétrot : “Minimisation de la taille des buffers entre tâches communicantes pour la conception de composants embarqués”, 4^e Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2002), Paris, France, pp. 230 (2002)
• 2001
  • A. Munier‑Kordon : “Minimizing the makespan for a UET bipartite graph on a single processor with an integer precedence delay”, (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)
• 1999
  • A. Munier : “Approximation algorithms for scheduling trees with general communication delays”, Parallel Computing, vol. 25 (1), pp. 41-48, (Elsevier) (1999)
• 1998
  • A. Munier, M. Queyranne, Andreas S. Schulz : “Approximation Bounds for a General class of precedence constrained parallel machine problems”, IPCO'98 - 6^th International Conference on Integer Programming and Combinatorial Optimization, vol. 1412, Lecture Notes in Computer Science, Houston, Texas, United States, pp. 367-382, (Springer) (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)