| Publication | Date of Publication | Type |
|---|
| Nested benders decomposition for a deterministic biomass feedstock logistics problem | 2025-01-20 | Paper |
| Single-lot, lot-streaming problem for a \(1 + m\) hybrid flow shop | 2024-05-17 | Paper |
| Lot streaming for a two-stage assembly system in the presence of handling costs | 2023-08-28 | Paper |
| A two-index formulation for the fixed-destination multi-depot asymmetric travelling salesman problem and some extensions | 2023-01-24 | Paper |
| Multiproduct Newsvendor Problem with Customer-Driven Demand Substitution: A Stochastic Integer Program Perspective | 2022-06-27 | Paper |
| Robust multi-product newsvendor model with uncertain demand and substitution | 2021-06-07 | Paper |
| A branch‐and‐price approach for the stochastic generalized assignment problem | 2019-05-02 | Paper |
| Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations | 2016-11-10 | Paper |
| Two-stage, single-lot, lot streaming problem for a \(1+2\) hybrid flow shop | 2016-10-25 | Paper |
| Minimizing conditional-value-at-risk for stochastic scheduling problems | 2014-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5410881 | 2014-04-17 | Paper |
| A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times | 2012-11-15 | Paper |
| New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem | 2011-05-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3559200 | 2010-05-12 | Paper |
| A university-timetabling problem and its solution using Benders' partitioning---a case study | 2010-04-21 | Paper |
| Analytic evaluation of the expectation and variance of different performance measures of a schedule on a single machine under processing time variability | 2009-07-10 | Paper |
| Releasing and Scheduling of Lots in a Wafer Fab | 2008-01-04 | Paper |
| Flow Shop Lot Streaming | 2007-10-24 | Paper |
| Work allocation to stations with varying learning slopes and without buffers | 2007-10-10 | Paper |
| Discrete and dynamic versus continuous and static loading policy for a multi-compartment vehicle | 2006-09-13 | Paper |
| A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints | 2006-06-30 | Paper |
| Algorithmic Applications in Management | 2005-11-30 | Paper |
| Optimal allocation of work in assembly lines for lots with homogeneous learning | 2005-10-17 | Paper |
| Sequencing and loading of products on a flowline | 2005-10-17 | Paper |
| Equal processing time bicriteria scheduling on parallel machines | 2004-11-22 | Paper |
| New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints | 2004-11-19 | Paper |
| Constructing near optimal schedules for the flow-shop lot streaming problem with sublot-attached setups | 2003-10-27 | Paper |
| Modeling and algorithmic development of a staff scheduling problem | 2001-02-20 | Paper |
| Determination of part-delivery dates in a small lot stochastic assembly system | 1994-05-05 | Paper |
| A multiattribute decision-theoretic approach for the layout design problem | 1993-01-16 | Paper |
| Sequencing jobs on a single machine with a common due data and stochastic processing times | 1992-06-26 | Paper |
| Models and algorithms for job selection, routing, and scheduling in a flexible manufacturing system | 1990-01-01 | Paper |
| Scheduling independent jobs with stochastic processing times and a common due date on parallel and identical machines | 1989-01-01 | Paper |
| An improved branching scheme for the branch and bound procedure of schedulingnjobs onmparallel machines to minimize total weighted flowtime | 1988-01-01 | Paper |
| Mathematical Analysis Of A Robotized Production Cell | 1987-01-01 | Paper |
| Determination of optimal part delivery dates in a stochastic assembly line | 1987-01-01 | Paper |
| Bounds on the performance of a heuristic to schedule precedence-related jobs on parallel machines | 1984-01-01 | Paper |
