| Publication | Date of Publication | Type |
|---|
| Work Package Sizing and Project Performance | 2020-10-12 | Paper |
| Dynamic lot sizing with all‐units discount and resales | 2019-03-05 | Paper |
| Polynomial-Time Solvability of Dynamic Lot Size Problems | 2016-08-12 | Paper |
| Multitasking via alternate and shared processing: algorithms and complexity | 2016-05-18 | Paper |
| Faster algorithms for single machine scheduling with release dates and rejection | 2016-05-10 | Paper |
| Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs | 2015-04-17 | Paper |
| Improved algorithms for single-machine common due window assignment and scheduling with batch deliveries | 2015-01-30 | Paper |
| Multiple subset sum with inclusive assignment set restrictions | 2013-06-27 | Paper |
| Berth allocation with time-dependent physical limitations on vessels | 2012-05-14 | Paper |
| Flexible and Risk-Sharing Supply Contracts Under Price Uncertainty | 2012-02-12 | Paper |
| Approximation results for min-max path cover problems in vehicle routing | 2011-01-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579452 | 2010-08-06 | Paper |
| Scheduling parallel machines with inclusive processing set restrictions and job release times | 2009-12-10 | Paper |
| Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks | 2009-08-14 | Paper |
| Dynamic Lot Sizing with Batch Ordering and Truckload Discounts | 2009-07-14 | Paper |
| A new solution method for the finite-horizon discrete-time EOQ problem | 2009-04-08 | Paper |
| A note on unrelated parallel machine scheduling with time-dependent processing times | 2009-03-03 | Paper |
| Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks | 2008-11-27 | Paper |
| Scheduling parallel machines with inclusive processing set restrictions | 2008-08-11 | Paper |
| An asymptotic approximation scheme for the concave cost bin packing problem | 2008-07-21 | Paper |
| Quantifying supply chain ineffectiveness under uncoordinated pricing decisions | 2008-05-29 | Paper |
| An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs | 2008-04-28 | Paper |
| The impact of manufacturer rebates on supply chain profits | 2008-01-23 | Paper |
| Bin‐packing problem with concave costs of bin utilization | 2008-01-23 | Paper |
| Machine scheduling with pickup and delivery | 2008-01-23 | Paper |
| Scheduling unit-length jobs with machine eligibility restrictions | 2006-09-13 | Paper |
| Improved algorithm for maximizing service of carousel storage | 2005-09-02 | Paper |
| Machine scheduling with deliveries to multiple customer locations | 2005-02-09 | Paper |
| Lot streaming with supplier-manufacturer coordination | 2005-01-11 | Paper |
| Interblock Crane Deployment in Container Terminals | 2003-07-07 | Paper |
| A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis | 2003-04-02 | Paper |
| Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard. | 2002-07-14 | Paper |
| Analysis of a new vehicle scheduling and location problem | 2002-03-14 | Paper |
| Minimizing total completion time in two-processor task systems with prespecified processor allocations | 1999-06-27 | Paper |
| Scheduling with agreeable release times and due dates on a batch processing machine | 1999-04-27 | Paper |
| Scheduling to minimize the total compression and late costs | 1998-03-25 | Paper |
| Single-machine scheduling with trade-off between number of tardy jobs and resource allocation | 1997-08-07 | Paper |
| On the fixed interval due-date scheduling problem | 1996-10-03 | Paper |
| Scheduling to minimize release-time resource consumption and tardiness penalties | 1996-09-15 | Paper |
| A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs | 1995-05-30 | Paper |
| The parallel machine min-max weighted absolute lateness scheduling problem | 1995-03-15 | Paper |
| Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs | 1995-01-11 | Paper |
| Scheduling to minimize the total weighted completion time with a constraint on the release time resource consumption | 1995-01-11 | Paper |
| Scheduling with resource-dependent release dates—a comparison of two different resource consumption functions | 1994-12-01 | Paper |
| Probabilistic Analysis of a Vehicle Routing Problem with Time Windows | 1994-10-12 | Paper |
| A note on one-processor scheduling with asymmetric earliness and tardiness penalties | 1993-08-16 | Paper |
| On the Distance Constrained Vehicle Routing Problem | 1993-01-17 | Paper |
| Finding disjoint paths with different path-costs: Complexity and algorithms | 1993-01-17 | Paper |
| Analysis of heuristics for the design of tree networks | 1993-01-16 | Paper |
| Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems | 1993-01-16 | Paper |
| Dynamic programming approach to the \(n/m/\)parallel\(/\sum_{i=1}^{m} \{\sum {w_ j} \sum {t_ j} \}\) scheduling problem | 1993-01-05 | Paper |
| On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems | 1992-12-17 | Paper |
| The point-to-point delivery and connection problems: Complexity and algorithms | 1992-09-27 | Paper |
| Equipartitions of graphs | 1992-06-28 | Paper |
| The complexity of finding two disjoint paths with min-max objective function | 1990-01-01 | Paper |
