| Publication | Date of Publication | Type |
|---|
| An advanced tabu search algorithm for the job shop problem | 2007-12-20 | Paper |
| Computational Science - ICCS 2004 | 2005-12-23 | Paper |
| Some aspects of scatter search in the flow-shop problem | 2005-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5692629 | 2005-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4433458 | 2003-11-02 | Paper |
| The flow shop with parallel machines: A tabu search approach | 2002-08-18 | Paper |
| The permutation flow shop with buffers: A tabu search approach | 2002-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4495182 | 2001-10-21 | Paper |
| An approximation algorithm for a single-machine scheduling problem with release times and delivery times | 2000-08-14 | Paper |
| A fast tabu search algorithm for the permutation flow-shop problem | 1999-02-22 | Paper |
| A Fast Taboo Search Algorithm for the Job Shop Problem | 1997-11-12 | Paper |
| Single Machine Scheduling with Major and Minor Setup Times: A Tabu Search Approach | 1996-12-01 | Paper |
| New results in the worst-case analysis for flow-shop scheduling | 1996-10-08 | Paper |
| A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times | 1996-07-07 | Paper |
| A decision support system for the resource constrained project scheduling problem | 1995-02-09 | Paper |
| A note on worst-case analysis of approximation algorithms for a scheduling problem | 1995-01-19 | Paper |
| An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times | 1994-11-17 | Paper |
| An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times | 1993-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035090 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4013009 | 1992-09-27 | Paper |
| Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling | 1992-06-28 | Paper |
| A survey of results for sequencing problems with controllable processing times | 1990-01-01 | Paper |
| Worst-case analysis of an approximation algorithm for flow-shop scheduling | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3478252 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3478253 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3486356 | 1989-01-01 | Paper |
| A two-machine flow shop scheduling problem with controllable job processing times | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3475120 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3475121 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3815118 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3815119 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3824095 | 1988-01-01 | Paper |
| On lower bounds on the minimum maximum lateness on one machine subject to release date | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3821922 | 1987-01-01 | Paper |
| A note on minimizing maximum lateness in a one-machine sequencing problem with release dates | 1986-01-01 | Paper |
| A block approach for single-machine scheduling with release dates and due dates | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3806976 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3806977 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3809574 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3760285 | 1985-01-01 | Paper |
| Optimal control policies for resource allocation in an activity network | 1984-01-01 | Paper |
| Scheduling jobs with controllable processing times as an optimal control problem | 1984-01-01 | Paper |
| Optimal control of a complex of independent operations | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3862658 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4153249 | 1976-01-01 | Paper |
