Nadia Brauner
According to our database^{1},
Nadia Brauner
authored at least 25 papers
between 2003 and 2017.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at orcid.org
On csauthors.net:
Bibliography
2017
Lawler's minmax cost problem under uncertainty.
J. Comb. Optim., 2017
Improved lower bounds for the online bin stretching problem.
4OR, 2017
2016
Highmultiplicity 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 BranchandPrice Algorithm for Scheduling Observations on a Telescope.
Proceedings of the TwentyFifth 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.
Electronic Notes in Discrete Mathematics, 2013
A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times.
Discrete Optimization, 2013
LAD models, trees, and an analog of the fundamental theorem of arithmetic.
Discrete Applied Mathematics, 2013
2012
Single machine scheduling with small operatornonavailability periods.
J. Scheduling, 2012
Dense and sparse graph partition.
Discrete Applied Mathematics, 2012
2009
Scheduling of coupled tasks and onemachine nowait robotic cells.
Computers & OR, 2009
Operator nonavailability periods.
4OR, 2009
2008
Small deviations, JIT sequencing and symmetric case of Fraenkel's conjecture.
Discrete Mathematics, 2008
Identical part production in cyclic robotic cells: Concepts, overview and open questions.
Discrete Applied Mathematics, 2008
2007
Simultaneous optimization of classical objectives in JIT scheduling.
European Journal of Operational Research, 2007
2006
Models and Complexity of Multibin Packing Problems.
J. Math. Model. Algorithms, 2006
2005
A Framework for the Complexity of HighMultiplicity 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 justintime scheduling problem.
Discrete Applied Mathematics, 2004
2003
Complexity of OneCycle Robotic FlowShops.
J. Scheduling, 2003
Approximation algorithms for the design of SDH/SONET networks.
RAIRO  Operations Research, 2003