Nadia Brauner

According to our database1, Nadia Brauner authored at least 27 papers between 2003 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Do balanced words have a short period?
Theor. Comput. Sci., 2019

No-idle Parallel Machine Scheduling of Unit-time Jobs.
Proceedings of the 6th International Conference on Control, 2019

2017
Lawler's minmax cost problem under uncertainty.
J. Comb. Optim., 2017

Improved lower bounds for the online bin stretching problem.
4OR, 2017

2016
High-multiplicity scheduling on one machine with forbidden start and completion times.
J. Scheduling, 2016

Lawler's minmax cost algorithm: optimality conditions and uncertainty.
J. Scheduling, 2016

A Branch-and-Price Algorithm for Scheduling Observations on a Telescope.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2015
Online bin stretching with bunch techniques.
Theor. Comput. Sci., 2015

Identical coupled task scheduling: polynomial complexity of the cyclic case.
J. Scheduling, 2015

2013
Pricing techniques for self regulation in Vehicle Sharing Systems.
Electron. Notes Discret. Math., 2013

A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times.
Discret. Optim., 2013

LAD models, trees, and an analog of the fundamental theorem of arithmetic.
Discret. Appl. Math., 2013

2012
Single machine scheduling with small operator-non-availability periods.
J. Scheduling, 2012

Dense and sparse graph partition.
Discret. Appl. Math., 2012

2009
Scheduling of coupled tasks and one-machine no-wait robotic cells.
Comput. Oper. Res., 2009

Operator non-availability periods.
4OR, 2009

2008
Small deviations, JIT sequencing and symmetric case of Fraenkel's conjecture.
Discret. Math., 2008

Identical part production in cyclic robotic cells: Concepts, overview and open questions.
Discret. Appl. Math., 2008

2007
Simultaneous optimization of classical objectives in JIT scheduling.
Eur. J. Oper. Res., 2007

2006
Models and Complexity of Multibin Packing Problems.
J. Math. Model. Algorithms, 2006

2005
A Framework for the Complexity of High-Multiplicity Scheduling Problems.
J. Comb. Optim., 2005

Specializing Narrowing for Timetable Generation: A Case Study.
Proceedings of the Practical Aspects of Declarative Languages, 7th International Symposium, 2005

Robotic Cells: Configurations, Conjectures and Cycle Functions.
Proceedings of the Operations Research Proceedings 2005, 2005

2004
Scheduling with Discrete Resource Constraints.
Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

The maximum deviation just-in-time scheduling problem.
Discret. Appl. Math., 2004

2003
Complexity of One-Cycle Robotic Flow-Shops.
J. Scheduling, 2003

Approximation algorithms for the design of SDH/SONET networks.
RAIRO - Operations Research, 2003


  Loading...