| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6123968 | 2024-04-08 | Paper |
| On the complexity of scheduling unrelated parallel machines with limited preemptions | 2023-06-28 | Paper |
| A historical note on the complexity of scheduling problems | 2023-06-27 | Paper |
| In memoriam: Gerhard Woeginger (1964--2022) | 2022-11-04 | Paper |
| In memoriam Gerhard Woeginger (1964--2022) | 2022-07-22 | Paper |
| Local improvement algorithms for a path packing problem: a performance analysis based on linear programming | 2021-04-07 | Paper |
| In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation | 2016-12-29 | Paper |
| Computer-Aided Complexity Classification of Dial-a-Ride Problems | 2012-06-08 | Paper |
| Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop | 2012-06-08 | Paper |
| Algorithms for Radio Link Frequency Assignment: The Calma Project | 2009-07-03 | Paper |
| Interval scheduling: A survey | 2008-09-12 | Paper |
| Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard | 2007-12-20 | Paper |
| Linear programming models with planned lead times for supply chain operations planning | 2005-02-09 | Paper |
| Approximation algorithms for the test cover problem | 2004-03-11 | Paper |
| A local search template. | 2003-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2760080 | 2003-07-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411361 | 2003-07-08 | Paper |
| On local search for the generalized graph coloring problem | 2003-05-04 | Paper |
| Local search algorithms for the radio link frequency assignment problem | 2000-01-01 | Paper |
| The mystical power of twoness: In memoriam Eugene L. Lawler | 1999-04-08 | Paper |
| Scheduling Periodic Tasks with Slack | 1998-11-26 | Paper |
| Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard | 1998-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4398369 | 1998-07-19 | Paper |
| Short Shop Schedules | 1998-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4343700 | 1998-02-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4365126 | 1997-12-21 | Paper |
| Scheduling Periodic Tasks | 1997-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3127425 | 1997-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4871783 | 1997-01-19 | Paper |
| Job Shop Scheduling by Local Search | 1997-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4865604 | 1996-03-07 | Paper |
| The Complexity of Scheduling Trees with Communication Delays | 1996-02-20 | Paper |
| The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling | 1995-07-04 | Paper |
| Three, four, five, six, or the complexity of scheduling with communication delays | 1995-02-13 | Paper |
| A Computational Study of Local Search Algorithms for Job Shop Scheduling | 1994-10-04 | Paper |
| Periodic assignment and graph colouring | 1994-07-31 | Paper |
| Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows | 1994-02-24 | Paper |
| Sequential and parallel local search for the time-constrained traveling salesman problem | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035638 | 1993-05-18 | Paper |
| Job Shop Scheduling by Simulated Annealing | 1992-06-28 | Paper |
| Approximation algorithms for scheduling unrelated parallel machines | 1990-01-01 | Paper |
| A classification scheme for vehicle routing and scheduling problems | 1990-01-01 | Paper |
| Multiprocessor scheduling with communication delays | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3035154 | 1990-01-01 | Paper |
| The parallel complexity of TSP heuristics | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3033585 | 1989-01-01 | Paper |
| OR Forum—Perspectives on Parallel Computing | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783827 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3818133 | 1988-01-01 | Paper |
| Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in Operation | 1987-01-01 | Paper |
| An introduction to parallelism in combinatorial optimization | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3221735 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3221759 | 1985-01-01 | Paper |
| STOCHASTIC INTEGER PROGRAMMING BY DYNAMIC PROGRAMMING | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3716814 | 1985-01-01 | Paper |
| New directions in scheduling theory | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3217918 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3217922 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3824110 | 1984-01-01 | Paper |
| Scheduling subject to resource constraints: Classification and complexity | 1983-01-01 | Paper |
| Surrogate duality relaxation for job shop scheduling | 1983-01-01 | Paper |
| An appraisal of computational complexity for operations researchers | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3940839 | 1982-01-01 | Paper |
| Complexity Results for Scheduling Tasks in Fixed Intervals on Two Types of Machines | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3951897 | 1982-01-01 | Paper |
| Computer-Aided complexity classification of combinational problems | 1982-01-01 | Paper |
| Two Lines Least Squares | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3962767 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3897872 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3899810 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3899811 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3916361 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3929047 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3929048 | 1981-01-01 | Paper |
| Minimizing Maximum Lateness in a Two-Machine Open Shop | 1981-01-01 | Paper |
| Complexity results for scheduling chains on a single machine | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3206954 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3858002 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3882478 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3883480 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3883481 | 1980-01-01 | Paper |
| Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms | 1980-01-01 | Paper |
| Deterministic Production Planning: Algorithms and Complexity | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3893295 | 1980-01-01 | Paper |
| A characterization of linear admissible transformations for the m- travelling salesmen problem: A result of Berenguer | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3206648 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3206662 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3208408 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3879251 | 1979-01-01 | Paper |
| Computational Complexity of Discrete Optimization Problems | 1979-01-01 | Paper |
| Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey | 1979-01-01 | Paper |
| Report of the Session on Algorithms for Special Classes of Combinatorial Optimization Problems | 1979-01-01 | Paper |
| Branching from the largest upper bound. Folklore and facts | 1978-01-01 | Paper |
| A General Bounding Scheme for the Permutation Flow-Shop Problem | 1978-01-01 | Paper |
| Complexity of Scheduling under Precedence Constraints | 1978-01-01 | Paper |
| Technical Note—On the Expected Performance of Branch-and-Bound Algorithms | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4168390 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4170510 | 1978-01-01 | Paper |
| The complexity of the network design problem | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4124328 | 1977-01-01 | Paper |
| Job-Shop Scheduling by Implicit Enumeration | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4194705 | 1977-01-01 | Paper |
| Minimizing maximum lateness on one machine: computational experience and some applications | 1976-01-01 | Paper |
| On general routing problems | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4055377 | 1975-01-01 | Paper |
| Some Simple Applications of the Travelling Salesman Problem | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4077716 | 1975-01-01 | Paper |
| Minimizing Total Costs in One-Machine Scheduling | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4099408 | 1975-01-01 | Paper |
| Technical Note—Clustering a Data Array and the Traveling-Salesman Problem | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4051851 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4062226 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4056020 | 1973-01-01 | Paper |
