The following pages link to Nadia Brauner (Q309056):
Displaying 33 items.
- Lawler's minmax cost algorithm: optimality conditions and uncertainty (Q309059) (← links)
- High-multiplicity scheduling on one machine with forbidden start and completion times (Q341471) (← links)
- Online bin stretching with bunch techniques (Q497684) (← links)
- Dense and sparse graph partition (Q714027) (← links)
- (Q864930) (redirect page) (← links)
- Models and complexity of multibin packing problems (Q864931) (← links)
- Simultaneous optimization of classical objectives in JIT scheduling (Q879282) (← links)
- Identical coupled task scheduling: polynomial complexity of the cyclic case (Q906560) (← links)
- Scheduling of coupled tasks and one-machine no-wait robotic cells (Q954024) (← links)
- Identical part production in cyclic robotic cells: Concepts, overview and open questions (Q955314) (← links)
- Operator non-availability periods (Q1041405) (← links)
- Complexity of one-cycle robotic flow-shops (Q1404271) (← links)
- The maximum deviation just-in-time scheduling problem. (Q1421459) (← links)
- Cycles and permutations in robotic cells (Q1600438) (← links)
- A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times (Q1799381) (← links)
- LAD models, trees, and an analog of the fundamental theorem of arithmetic (Q1949097) (← links)
- Teaching OR: automatic evaluation for linear programming modelling (Q2144219) (← links)
- Do balanced words have a short period? (Q2326410) (← links)
- Improved lower bounds for the online bin stretching problem (Q2399609) (← links)
- Lawler's minmax cost problem under uncertainty (Q2410026) (← links)
- Single machine scheduling with small operator-non-availability periods (Q2434272) (← links)
- Small deviations, JIT sequencing and symmetric case of Fraenkel's conjecture (Q2483422) (← links)
- A framework for the complexity of high-multiplicity scheduling problems (Q2569171) (← links)
- No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines (Q2668758) (← links)
- Fleet and charging infrastructure decisions for fast-charging city electric bus service (Q2669545) (← links)
- (Q2712364) (← links)
- (Q3061959) (← links)
- (Q3416605) (← links)
- Multiplicity and complexity issues in contemporary production scheduling (Q5422015) (← links)
- Approximation algorithms for the design of SDH/SONET networks (Q5479829) (← links)
- (Q5702321) (← links)
- On A Conjecture About Robotic Cells: New Simplified Proof For The Three-Machine Case (Q5888081) (← links)
- A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty (Q6130218) (← links)
