| Publication | Date of Publication | Type |
|---|
| Efficient algorithms for flexible job shop scheduling with parallel machines | 2023-10-09 | Paper |
| On the complexity of open shop scheduling with time lags | 2023-07-13 | Paper |
| A Computational Analysis Of Balanced Jit Optimization Algorithms | 2023-04-24 | Paper |
| A note on scheduling coupled tasks for minimum total completion time | 2023-01-23 | Paper |
| On a conjecture for the university timetabling problem | 2021-05-31 | Paper |
| On a Conjecture for a Hypergraph Edge Coloring Problem | 2020-06-11 | Paper |
| Shared processor scheduling of multiprocessor jobs | 2020-01-08 | Paper |
| Shared processor scheduling | 2019-08-08 | Paper |
| Asymptotic behavior of optimal quantities in symmetric transshipment coalitions | 2018-09-28 | Paper |
| Shared multi-processor scheduling | 2018-05-29 | Paper |
| Normal-form preemption sequences for an open problem in scheduling theory | 2018-02-28 | Paper |
| Optimal edge-coloring with edge rate constraints | 2016-06-10 | Paper |
| Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs | 2016-06-09 | Paper |
| Scheduling chains to minimize mean flow time | 2016-06-01 | Paper |
| Scheduling semi-malleable jobs to minimize mean flow time | 2015-11-12 | Paper |
| Decentralized subcontractor scheduling with divisible jobs | 2015-11-12 | Paper |
| The complexity of minimum-length path decompositions | 2015-08-31 | Paper |
| Transshipment games with identical newsvendors and cooperation costs | 2014-02-18 | Paper |
| Routing equal-size messages on a slotted ring | 2014-02-05 | Paper |
| A branch and bound algorithm for the response time variability problem | 2014-02-05 | Paper |
| An efficient algorithm for finding ideal schedules | 2012-03-23 | Paper |
| Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines | 2010-11-03 | Paper |
| A coordinating contract for transshipment in a two-company supply chain | 2010-09-09 | Paper |
| A projective algorithm for preemptive open shop scheduling with two multiprocessor groups | 2010-05-07 | Paper |
| Mathematical programming modeling of the response time variability problem | 2009-12-14 | Paper |
| Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications | 2009-08-28 | Paper |
| Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors | 2009-04-17 | Paper |
| Apportionment methods and the Liu-Layland problem | 2008-11-18 | Paper |
| Proportional optimization and fairness | 2008-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5297390 | 2007-07-18 | Paper |
| Solution of the Liu-Layland problem via bottleneck just-in-time sequencing | 2007-05-15 | Paper |
| Response time variability | 2007-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3436594 | 2007-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5717955 | 2006-01-13 | Paper |
| Positive half-products and scheduling with controllable processing times | 2005-04-21 | Paper |
| Minimization of ordered, symmetric half-products | 2005-02-22 | Paper |
| A half-product based approximation scheme for agreeably weighted completion time variance | 2005-02-09 | Paper |
| On small deviations conjecture | 2004-10-28 | Paper |
| Cyclic just-in-time sequences are optimal | 2003-09-15 | Paper |
| Complexity of one-cycle robotic flow-shops | 2003-08-21 | Paper |
| Scheduling chains on uniform processors with communication delays | 2003-02-23 | Paper |
| Tree precedence in scheduling: The strong-weak distinction | 2002-07-25 | Paper |
| Resource Constrained Chain Scheduling of UET Jobs on Two Machines | 2002-07-01 | Paper |
| Fast fully polynomial approximation schemes for minimizing completion time variance | 2002-06-16 | Paper |
| Complexity of list coloring problems with a fixed total number of colors | 2002-05-15 | Paper |
| Two-machine flow shops with limited machine availability | 2002-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2712370 | 2001-05-06 | Paper |
| A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem | 2001-02-27 | Paper |
| Parallel branch and bound algorithms for the two-machine flow shop problem with limited machine availability | 2000-11-22 | Paper |
| Scheduling preemptable tasks on parallel processors with limited availability | 2000-08-21 | Paper |
| Scheduling identical jobs with chain precedence constraints on two uniform machines | 2000-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934399 | 2000-01-17 | Paper |
| Scheduling parallel tasks with sequential heads and tails | 1999-12-02 | Paper |
| On the complexity of a restricted list-coloring problem | 1999-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4248925 | 1999-06-10 | Paper |
| Total completion time minimization in two-machine job shops with unit-time operations | 1999-02-22 | Paper |
| A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs | 1999-01-05 | Paper |
| Two-Machine Open Shops with Renewable Resources | 1997-11-12 | Paper |
| Optimal level schedules for mixed-model, multi-level just-in-time assembly systems | 1997-08-24 | Paper |
| Mean Flow Time Minimization in Reentrant Job Shops with a Hub | 1997-07-23 | Paper |
| Algorithms for minclique scheduling problems | 1997-02-25 | Paper |
| New results on the completion time variance minimization | 1996-03-20 | Paper |
| An efficient algorithm for a job shop problem | 1995-08-27 | Paper |
| Scheduling shops to minimize the weighted number of late jobs | 1995-05-28 | Paper |
| Complexity of a class of nonlinear combinatorial problems related to their linear counterparts | 1994-07-26 | Paper |
| Completion time variance minimization on a single machine is difficult | 1994-04-17 | Paper |
| A Note On The Complexity Of Openshop Scheduling Problems | 1993-11-15 | Paper |
| Minimizing variation of production rates in just-in-time systems: A survey | 1993-09-30 | Paper |
| Algorithms for minimizing maximum lateness with unit length tasks and resource constraints | 1993-06-29 | Paper |
| Proof of a conjecture of Schrage about the completion time variance problem | 1992-06-28 | Paper |
| Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date | 1992-06-28 | Paper |
| A preemptive open shop scheduling problem with one resource | 1991-01-01 | Paper |
| A Note on “Level Schedules for Mixed-Model Assembly Lines in Just-in-Time Production Systems” | 1991-01-01 | Paper |
| A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3470246 | 1988-01-01 | Paper |
| Minimizing mean flow time with parallel processors and resource constraints | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3723702 | 1984-01-01 | Paper |
