| Publication | Date of Publication | Type |
|---|
A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty
Discrete Applied Mathematics | 2024-04-02 | Paper |
On A Conjecture About Robotic Cells: New Simplified Proof For The Three-Machine Case
INFOR: Information Systems and Operational Research | 2023-04-21 | Paper |
Teaching OR: automatic evaluation for linear programming modelling
4OR | 2022-06-01 | Paper |
Fleet and charging infrastructure decisions for fast-charging city electric bus service
Computers & Operations Research | 2022-03-09 | Paper |
No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines
Computers & Operations Research | 2022-03-07 | Paper |
Do balanced words have a short period?
Theoretical Computer Science | 2019-10-07 | Paper |
A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times
Discrete Optimization | 2018-10-18 | Paper |
Lawler's minmax cost problem under uncertainty
Journal of Combinatorial Optimization | 2017-10-17 | Paper |
Improved lower bounds for the online bin stretching problem
4OR | 2017-08-24 | Paper |
High-multiplicity scheduling on one machine with forbidden start and completion times
Journal of Scheduling | 2016-11-16 | Paper |
Lawler's minmax cost algorithm: optimality conditions and uncertainty
Journal of Scheduling | 2016-09-07 | Paper |
Identical coupled task scheduling: polynomial complexity of the cyclic case
Journal of Scheduling | 2016-01-22 | Paper |
Online bin stretching with bunch techniques
Theoretical Computer Science | 2015-09-25 | Paper |
Single machine scheduling with small operator-non-availability periods
Journal of Scheduling | 2014-02-05 | Paper |
LAD models, trees, and an analog of the fundamental theorem of arithmetic
Discrete Applied Mathematics | 2013-04-25 | Paper |
Dense and sparse graph partition
Discrete Applied Mathematics | 2012-10-19 | Paper |
Production planning
| 2011-01-03 | Paper |
Operator non-availability periods
4OR | 2009-12-02 | Paper |
Identical part production in cyclic robotic cells: Concepts, overview and open questions
Discrete Applied Mathematics | 2008-11-19 | Paper |
Scheduling of coupled tasks and one-machine no-wait robotic cells
Computers & Operations Research | 2008-11-07 | Paper |
Small deviations, JIT sequencing and symmetric case of Fraenkel's conjecture
Discrete Mathematics | 2008-04-28 | Paper |
Multiplicity and complexity issues in contemporary production scheduling
Statistica Neerlandica | 2007-10-26 | Paper |
Simultaneous optimization of classical objectives in JIT scheduling
European Journal of Operational Research | 2007-05-11 | Paper |
Models and complexity of multibin packing problems
JMMA. Journal of Mathematical Modelling and Algorithms | 2007-02-13 | Paper |
Robotic cells: configurations, conjectures and cycle functions
| 2007-01-22 | Paper |
Approximation algorithms for the design of SDH/SONET networks
RAIRO - Operations Research | 2006-07-11 | Paper |
scientific article; zbMATH DE number 2221466 (Why is no real title available?)
| 2005-11-01 | Paper |
A framework for the complexity of high-multiplicity scheduling problems
Journal of Combinatorial Optimization | 2005-10-18 | Paper |
The maximum deviation just-in-time scheduling problem.
Discrete Applied Mathematics | 2004-01-26 | Paper |
Complexity of one-cycle robotic flow-shops
Journal of Scheduling | 2003-08-21 | Paper |
scientific article; zbMATH DE number 1594557 (Why is no real title available?)
| 2003-07-29 | Paper |
Cycles and permutations in robotic cells
Mathematical and Computer Modelling | 2002-06-13 | Paper |
