Ordonnancement dans des cellules robotisées. (Scheduling in robotic cells). - Nadia Brauner-Vettier (1999)

Approximation algorithms for the design of SDH/SONET networks. - Nadia Brauner; Yves Crama; Gerd Finke; Pierre Lemaire 001; Christelle Wynants (RAIRO Oper. Res., 2003)

Complexity of One-Cycle Robotic Flow-Shops. - Nadia Brauner; Gerd Finke; Wieslaw Kubiak (J. Sched., 2003)

The maximum deviation just-in-time scheduling problem. - Nadia Brauner; Yves Crama (Discret. Appl. Math., 2004)

Scheduling with Discrete Resource Constraints. - Jacek Blazewicz; Nadia Brauner; Gerd Finke (Handbook of Scheduling, 2004)

Robotic Cells: Configurations, Conjectures and Cycle Functions. - Nadia Brauner; Gerd Finke (OR, 2005)

Specializing Narrowing for Timetable Generation: A Case Study. - Nadia Brauner; Rachid Echahed; Gerd Finke; Hanns Gregor; Frédéric Prost (PADL, 2005)

A Framework for the Complexity of High-Multiplicity Scheduling Problems. - Nadia Brauner; Yves Crama; Alexander Grigoriev; Joris van de Klundert (J. Comb. Optim., 2005)

Models and Complexity of Multibin Packing Problems. - Pierre Lemaire 001; Gerd Finke; Nadia Brauner (J. Math. Model. Algorithms, 2006)

Simultaneous optimization of classical objectives in JIT scheduling. - Vassilissa Lebacque; Vincent Jost; Nadia Brauner (Eur. J. Oper. Res., 2007)

Identical part production in cyclic robotic cells: Concepts, overview and open questions. - Nadia Brauner (Discret. Appl. Math., 2008)

Small deviations, JIT sequencing and symmetric case of Fraenkel's conjecture. - Nadia Brauner; Vincent Jost (Discret. Math., 2008)

Operator non-availability periods. - Nadia Brauner; Gerd Finke; Vassilissa Lehoux-Lebacque; Christophe Rapine; Hans Kellerer; Chris N. Potts; Vitaly A. Strusevich (4OR, 2009)

Scheduling of coupled tasks and one-machine no-wait robotic cells. - Nadia Brauner; Gerd Finke; Vassilissa Lehoux-Lebacque; Chris N. Potts; Jonathan Whitehead (Comput. Oper. Res., 2009)

Dense and sparse graph partition. - Julien Darlay; Nadia Brauner; Julien Moncel (Discret. Appl. Math., 2012)

Single machine scheduling with small operator-non-availability periods. - Christophe Rapine; Nadia Brauner; Gerd Finke; Vassilissa Lebacque (J. Sched., 2012)

LAD models, trees, and an analog of the fundamental theorem of arithmetic. - Nadia Brauner; Sylvain Gravier; Louis-Philippe Kronek; Frédéric Meunier (Discret. Appl. Math., 2013)

A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times. - Christophe Rapine; Nadia Brauner (Discret. Optim., 2013)

Pricing techniques for self regulation in Vehicle Sharing Systems. - Ariel Waserhole; Vincent Jost; Nadia Brauner (Electron. Notes Discret. Math., 2013)

Identical coupled task scheduling: polynomial complexity of the cyclic case. - Vassilissa Lehoux-Lebacque; Nadia Brauner; Gerd Finke (J. Sched., 2015)

Online bin stretching with bunch techniques. - Michaël Gabay; Vladimir Kotov; Nadia Brauner (Theor. Comput. Sci., 2015)

A Branch-and-Price Algorithm for Scheduling Observations on a Telescope. - Nicolas Catusse; Hadrien Cambazard; Nadia Brauner; Pierre Lemaire 001; Bernard Penz; Anne-Marie Lagrange; Pascal Rubini (IJCAI, 2016)

Lawler's minmax cost algorithm: optimality conditions and uncertainty. - Nadia Brauner; Gerd Finke; Yakov M. Shafransky; Dzmitry Sledneu (J. Sched., 2016)

High-multiplicity scheduling on one machine with forbidden start and completion times. - Michaël Gabay; Christophe Rapine; Nadia Brauner (J. Sched., 2016)

Improved lower bounds for the online bin stretching problem. - Michaël Gabay; Nadia Brauner; Vladimir Kotov (4OR, 2017)

Lawler's minmax cost problem under uncertainty. - Nadia Brauner; Gerd Finke; Yakov M. Shafransky (J. Comb. Optim., 2017)

No-idle Parallel Machine Scheduling of Unit-time Jobs. - Nadia Brauner; Mikhail Y. Kovalyov; Alain Quilliot; Hélène Toussaint (CoDIT, 2019)

Do balanced words have a short period? - Nadia Brauner; Yves Crama; Etienne Delaporte; Vincent Jost; Luc Libralesso (Theor. Comput. Sci., 2019)

Assembly line balancing for two cycle times: Anticipating demand fluctuations. - Thiago Cantos Lopes; Adalberto Sato Michels; Celso Gustavo Stall Sikora; Nadia Brauner; Leandro Magatão (Comput. Ind. Eng., 2021)

No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines. - Nadia Brauner; Mikhail Y. Kovalyov; Alain Quilliot; Hélène Toussaint (Comput. Oper. Res., 2021)

Fleet and charging infrastructure decisions for fast-charging city electric bus service. - Nikolai Guschinsky; Mikhail Y. Kovalyov; Boris Rozin; Nadia Brauner (Comput. Oper. Res., 2021)

Teaching OR: automatic evaluation for linear programming modelling. - Hadrien Cambazard; Nicolas Catusse; Nadia Brauner; Pierre Lemaire 001 (4OR, 2022)

Is there an Ethical Operational Research? - Odile Bellenguez; Nadia Brauner; Alexis Tsoukiàs (CoRR, 2022)

Online bin stretching lower bounds: Improved search of computational proofs. - Antoine Lhomme; Olivier Romane; Nicolas Catusse; Nadia Brauner (CoRR, 2022)

Innovative ideas for teaching supports: Application to Graph theory. - Nicolas Catusse; Hadrien Cambazard; Nadia Brauner; Bernard Penz; Florian Fontan (CoRR, 2022)

Assembly line balancing with fractional task allocations. - Thiago Cantos Lopes; Nadia Brauner; Leandro Magatão (Int. J. Prod. Res., 2022)

Balancing-sequencing paced assembly lines: a multi-objective mixed-integer linear case study. - Thiago Cantos Lopes; Adalberto Sato Michels; Nadia Brauner; Leandro Magatão (Int. J. Prod. Res., 2023)

Stability constraints in a 3D knapsack problem with non parallelepipedic items. - Alexandre Le Jean; Nadia Brauner; Olivier Briant; Mircea Cocan; Bérenger David (Comput. Ind. Eng., 2024)

Computational bounds on randomized algorithms for online bin stretching. - Antoine Lhomme; Nicolas Catusse; Nadia Brauner (CoRR, 2024)

A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty. - Nadia Brauner; Evgeny Gurevsky 001; Mikhail Y. Kovalyov (Discret. Appl. Math., 2024)

On the convergence of computational methods for the online bin stretching problem. - Antoine Lhomme; Nicolas Catusse; Nadia Brauner (CoRR, 2025)