Alix Munier
List of publications from the DBLP Bibliography Server - FAQ
- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j23 |      | Alix Munier Kordon, Fadi Kacem, Benoît Dupont de Dinechin, Lucian Finta: Scheduling an interval ordered precedence graph with communication delays and a limited number of processors. RAIRO - Operations Research 47(1): 73-87 (2013) |
| 2012 | ||
| j22 | | Abir Benabid-Najjar, Claire Hanen, Olivier Marchetti, Alix Munier Kordon: Periodic Schedules for Bounded Timed Weighted Event Graphs. IEEE Trans. Automat. Contr. 57(5): 1222-1232 (2012) |
| c6 | | Bruno Bodin, Alix Munier Kordon, Benoît Dupont de Dinechin: K-Periodic schedules for evaluating the maximum throughput of a Synchronous Dataflow graph. ICSAMOS 2012: 152-159 |
| 2011 | ||
| j21 | | Alix Munier Kordon: A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule. J. Scheduling 14(1): 103-117 (2011) |
| 2010 | ||
| j20 | | Olivier Marchetti, Alix Munier Kordon: Complexity results for Weighted Timed Event Graphs. Discrete Optimization 7(3): 166-180 (2010) |
| j19 | | Alix Munier Kordon, Djamal Rebaine: The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan. European Journal of Operational Research 203(1): 42-49 (2010) |
| c5 | | Mohamed Benazouz, Olivier Marchetti, Alix Munier Kordon, Pascal Urard: A new approach for minimizing buffer capacities with throughput constraint for embedded system design. AICCSA 2010: 1-8 |
| c4 | | Mohamed Benazouz, Olivier Marchetti, Alix Munier Kordon, Thierry Michel: A new method for minimizing buffer sizes for Cyclo-Static Dataflow graphs. ESTImedia 2010: 11-20 |
| 2009 | ||
| j18 | | Claire Hanen, Alix Munier Kordon: Periodic schedules for linear precedence constraints. Discrete Applied Mathematics 157(2): 280-291 (2009) |
| j17 | | Olivier Marchetti, Alix Munier Kordon: A sufficient condition for the liveness of weighted event graphs. European Journal of Operational Research 197(2): 532-540 (2009) |
| j16 | | Salim Achouri, Timothée Bossart, Alix Munier Kordon: A polynomial algorithm for minDSC on a subclass of series Parallel graphs. RAIRO - Operations Research 43(2): 145-156 (2009) |
| j15 | | Philippe Baptiste, Graham Kendall, Alix Munier, Francis Sourd: Preface. J. Scheduling 12(6): 563-564 (2009) |
| c3 | | Daniela Genius, Alix Munier Kordon, Khouloud Zine el Abidine: A Buffer Space Optimal Solution for Re-establishing the Packet Order in a MPSoC Network Processor. Euro-Par 2009: 216-227 |
| 2008 | ||
| j14 | | Alix Munier Kordon, Djamal Rebaine: Polynomial time algorithms for the UET permutation flowshop problem with time delays. Computers & OR 35(2): 525-537 (2008) |
| j13 | | Olivier Marchetti, Alix Munier Kordon: Minimizing Place Capacities of Weighted Event Graphs for Enforcing Liveness. Discrete Event Dynamic Systems 18(1): 91-109 (2008) |
| 2007 | ||
| j12 | | Timothée Bossart, Alix Munier Kordon, Francis Sourd: Memory management optimization problems for integrated circuit simulators. Discrete Applied Mathematics 155(14): 1795-1811 (2007) |
| 2005 | ||
| j11 | | Alix Munier Kordon, Jean-Baptiste Note: A buffer minimization problem for the design of embedded systems. European Journal of Operational Research 164(3): 669-679 (2005) |
| 2004 | ||
| j10 | | Philippe Baptiste, Jacques Carlier, Alix Munier, Andreas S. Schulz: Introduction. Annals OR 129(1-4): 17-19 (2004) |
| j9 | | Alix Munier Kordon: Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay. Oper. Res. Lett. 32(6): 557-564 (2004) |
| 2003 | ||
| j8 | | Alix Munier, Francis Sourd: Scheduling chains on a single machine with non-negative time lags. Math. Meth. of OR 57(1): 111-123 (2003) |
| 2002 | ||
| j7 | | Claire Hanen, Alix Munier Kordon: Minimizing the volume in scheduling an out-tree with communication delays and duplication. Parallel Computing 28(11): 1573-1585 (2002) |
| 2001 | ||
| j6 | | Claire Hanen, Alix Munier: An approximation algorithm for scheduling dependent tasks on m processors with small communication delays. Discrete Applied Mathematics 108(3): 239-257 (2001) |
| 1999 | ||
| j5 | | Alix Munier: Approximation algorithms for scheduling trees with general communication delays. Parallel Computing 25(1): 41-48 (1999) |
| 1998 | ||
| j4 | | Claire Hanen, Alix Munier Kordon: Performance of Coffman-Graham Schedules in the Presence of Unit Communication Delays. Discrete Applied Mathematics 81(1-3): 93-108 (1998) |
| c2 | | Alix Munier, Maurice Queyranne, Andreas S. Schulz: Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems. IPCO 1998: 367-382 |
| 1997 | ||
| j3 | | Alix Munier, Claire Hanen: Using Duplication for Scheduling Unitary Tasks on m Processors with Unit Communication Delays. Theor. Comput. Sci. 178(1-2): 119-127 (1997) |
| 1996 | ||
| j2 | | Alix Munier: The Basic Cyclic Scheduling Problem with Linear Precedence Constraints. Discrete Applied Mathematics 64(3): 219-238 (1996) |
| c1 | | Aristotelis Giannakos, Jean-Claude König, Alix Munier: On the Cyclic Scheduling Problem with Small Communication Delays (Extended Abstract). Euro-Par, Vol. II 1996: 578-581 |
| 1995 | ||
| j1 | | Claire Hanen, Alix Munier: A Study of the Cyclic Scheduling Problem on Parallel Processors. Discrete Applied Mathematics 57(2-3): 167-192 (1995) |
Colors in the list of coauthors
Last update Sun May 19 01:39:17 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page