| Current teams : | ACASA ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL |
| Former team : | Phare |
| Publications RO | 2017 | 2018 | 2019 | 2020 | 2021 | 2022 | 2023 | Total |
|---|---|---|---|---|---|---|---|---|
| Books | 0 | 1 | 2 | 0 | 1 | 0 | 0 | 4 |
| Edited books | 0 | 0 | 0 | 3 | 1 | 0 | 0 | 4 |
| Journal articles | 14 | 15 | 16 | 15 | 19 | 17 | 12 | 108 |
| Book chapters | 0 | 1 | 3 | 0 | 0 | 0 | 0 | 4 |
| Conference papers | 18 | 33 | 48 | 31 | 31 | 38 | 27 | 226 |
| Habilitations | 0 | 1 | 1 | 2 | 0 | 0 | 0 | 4 |
| Theses | 1 | 1 | 0 | 3 | 3 | 2 | 1 | 11 |
- N. Absi, S. Kedad‑Sidhoum : “The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs”, Computers and Operations Research, vol. 36 (11), pp. 2926-2936, (Elsevier) [Absi 2009]
- E. Angel, E. Bampis, F. Pascual, A.‑A. Tchetgnia : “On truthfulness and approximation for scheduling selfish tasks”, Journal of Scheduling, vol. 12 (5), pp. 437-445, (Springer Verlag) [Angel 2009]
- S. Angelopoulos, B. Doerr, A. Huber, K. Panagiotou : “Tight Bounds for Quasirandom Rumor Spreading”, The Electronic Journal of Combinatorics, vol. 16 (1), pp. r102, (Open Journal Systems) [Angelopoulos 2009b]
- Ph. Baptiste, Ph. Chrétienne, J. Meng‑Gérard, F. Sourd : “On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups”, Discrete Applied Mathematics, vol. 157 (17), pp. 3656-3664, (Elsevier) [Baptiste 2009]
- J.‑Ch. Billaut, F. Sourd : “Single machine scheduling with forbidden start times”, 4OR: A Quarterly Journal of Operations Research, vol. 7 (1), pp. 37-50, (Springer Verlag) [Billaut 2009]
- P. Fouilhoux, M. Labbé, A. Ridha Mahjoub, H. Yaman : “Generating Facets for the Independence System Polytope”, SIAM Journal on Discrete Mathematics, vol. 23 (3), pp. 1484-1506, (Society for Industrial and Applied Mathematics) [Fouilhoux 2009]
- 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]
- Y. Hendel, N. Runge, F. Sourd : “The one-machine just-in-time scheduling problem with preemption”, Discrete Optimization, vol. 6 (1), pp. 10-22, (Elsevier) [Hendel 2009]
- F. Pascual, K. Rzadca, D. Trystram : “Cooperation in Multi-Organization Scheduling”, Concurrency and Computation: Practice and Experience, vol. 21 (7), pp. 905-921, (Wiley) [Pascual 2009]
- N. Runge, F. Sourd : “A new model for the preemptive earliness - tardiness scheduling problem”, Computers and Operations Research, vol. 36 (7), pp. 2242-2249, (Elsevier) [Runge 2009]
- C. Sakuraba, D. Ronconi, F. Sourd : “Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date”, Computers and Operations Research, vol. 36 (1), pp. 60-72, (Elsevier) [Sakuraba 2009]
- F. Sourd : “New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling”, INFORMS Journal on Computing, vol. 21 (1), pp. 167-175, (Institute for Operations Research and the Management Sciences (INFORMS)) [Sourd 2009]