| Branch-and-Bound Algorithms for the Test Cover Problem | 17 | 1.97 | 2002 |
| Algorithms for Radio Link Frequency Assignment: The Calma Project | 11 | 1.19 | 2002 |
| Towards a model and algorithm management system for vehicle routing and scheduling problems | 19 | 1.40 | 1999 |
| Short Shop Schedules | 99 | 7.98 | 1997 |
| Three, four, five, six, or the complexity of scheduling with communication delays | 45 | 3.80 | 1994 |
| Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows | 33 | 6.01 | 1993 |
| A local search template | 22 | 2.35 | 1992 |
| Approximation algorithms for scheduling unrelated parallel machines | 438 | 59.50 | 1990 |
| OR Forum--Perspectives on Parallel Computing | 4 | 1.09 | 1989 |
| The parallel complexity of TSP heuristics | 9 | 1.44 | 1989 |
| Resource-constrained project scheduling: an international exercise in DSS development | 4 | 1.14 | 1988 |
| Introduction--Special Focus and Decision Support Systems (DSS) | 0 | 0.34 | 1988 |
| An introduction to parallelism in combinatorial optimization | 21 | 2.04 | 1986 |
| A framework for the probabilistic analysis of hierarchical planning systems | 5 | 2.41 | 1984 |
| Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence Constraints | 43 | 5.56 | 1983 |
| Analysis of Heuristics for Stochastic Programming: Results for Hierarchical Scheduling Problems | 15 | 12.09 | 1983 |
| Computer-Aided complexity classification of combinational problems | 15 | 1.80 | 1982 |
| Complexity Of Vehicle-Routing And Scheduling Problems | 250 | 34.17 | 1981 |
| Analytical Evaluation of Hierarchical Planning Systems | 21 | 13.82 | 1981 |
| Minimizing Maximum Lateness in a Two-Machine Open Shop | 24 | 8.29 | 1981 |
| Technical Note-On the Expected Performance of Branch-and-Bound Algorithms | 0 | 0.34 | 1978 |
| Complexity Of Network Design Problem | 148 | 31.84 | 1978 |
| A General Bounding Scheme for the Permutation Flow-Shop Problem | 70 | 11.01 | 1978 |
| Complexity of Scheduling under Precedence Constraints | 213 | 35.98 | 1978 |
| On general routing problems | 95 | 14.80 | 1976 |
| Minimizing Total Costs in One-Machine Scheduling | 61 | 65.52 | 1975 |
| Technical Note-Clustering a Data Array and the Traveling-Salesman Problem | 7 | 1.52 | 1974 |
