| Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems | 37 | 3.01 | 2001 |
| A polyhedral approach to single-machine scheduling problems | 31 | 2.09 | 1999 |
| Lifting valid inequalities for the precedence constrained knapsack problem | 14 | 1.27 | 1999 |
| On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs | 9 | 1.26 | 1997 |
| An O(n log n) Algorithm for the Two-Machine Flow Shop Problem with Controllable Machine Speeds | 2 | 0.43 | 1996 |
