| Publication | Date of Publication | Type |
|---|
| Seven problems: so different yet close | 2021-12-20 | Paper |
| A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes | 2021-04-19 | Paper |
| An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times | 2019-05-09 | Paper |
| Some positive news on the proportionate open shop problem | 2019-05-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5374014 | 2018-04-06 | Paper |
| On-line and off-line approximation algorithms for vector covering problems | 2017-12-05 | Paper |
| Efficient approximation algorithms for the routing open shop problem | 2016-11-14 | Paper |
| A note on the Coffman-Sethi bound for LPT scheduling | 2015-07-28 | Paper |
| On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion | 2014-09-26 | Paper |
| A complete 4-parametric complexity classification of short shop scheduling problems | 2014-02-05 | Paper |
| Integer preemptive scheduling on parallel machines | 2013-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2906542 | 2012-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115601 | 2012-02-10 | Paper |
| A scheme of approximation solution of problem 1 |r j|L max | 2012-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115636 | 2012-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115718 | 2012-02-10 | Paper |
| Tight complexity analysis of the relocation problem with arbitrary release dates | 2011-09-12 | Paper |
| Properties of optimal schedules in preemptive shop scheduling | 2011-03-10 | Paper |
| Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays | 2011-01-03 | Paper |
| The Routing Open Shop Problem: New Approximation Algorithms | 2010-05-11 | Paper |
| Integrality Property in Preemptive Parallel Machine Scheduling | 2009-08-18 | Paper |
| Complete Complexity Classification of Short Shop Scheduling | 2009-08-18 | Paper |
| Approximation and Online Algorithms | 2009-08-11 | Paper |
| The flow shop problem with no-idle constraints: a review and approximation | 2009-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3619083 | 2009-04-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5301739 | 2009-01-20 | Paper |
| Open block scheduling in optical communication networks | 2006-09-14 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5715106 | 2005-12-19 | Paper |
| An introduction to multi-parameter complexity analysis of discrete problems | 2005-04-21 | Paper |
| Linear time approximation scheme for the multiprocessor open shop problem | 2002-12-10 | Paper |
| Geometrical heuristics for multiprocessor flowshop scheduling with uniform machines at each stage | 2002-08-08 | Paper |
| A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates. | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2729351 | 2001-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2713932 | 2001-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527276 | 2001-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527315 | 2001-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4936534 | 2000-01-31 | Paper |
| When difference in machine loads leads to efficient scheduling in open shops | 2000-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252045 | 1999-06-17 | Paper |
| Makespan minimization in open shops: A polynomial time approximation scheme | 1999-06-03 | Paper |
| Nonstrict vector summation in multi-operation scheduling | 1999-03-07 | Paper |
| On-line and off-line approximation algorithms for vector covering problems | 1998-10-01 | Paper |
| Short Shop Schedules | 1998-07-06 | Paper |
| Makespan minimization in preemptive two machine job shops | 1998-06-02 | Paper |
| To the Steinitz lemma in coordinate form | 1997-08-26 | Paper |
| A polynomial-time open-shop problem with an arbitrary number of machines | 1997-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4866354 | 1996-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4888938 | 1996-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4852849 | 1996-03-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4852857 | 1996-03-17 | Paper |
| The Two-Stage Assembly Scheduling Problem: Complexity and Approximation | 1995-09-25 | Paper |
| Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops | 1995-06-14 | Paper |
| On some geometric methods in scheduling theory: A survey | 1995-04-03 | Paper |
| Vector summation within minimal angle | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4033261 | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3980665 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3832311 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5749882 | 1988-01-01 | Paper |
| Bounding algorithm for the routing problem with arbitrary paths and alternative servers | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3713848 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3675864 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3312008 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3932314 | 1981-01-01 | Paper |
| Value of the Steinitz constant | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3871401 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3924227 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3965901 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3902823 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3899809 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3870650 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3206965 | 1975-01-01 | Paper |
