| Publication | Date of Publication | Type |
|---|
| Redundant cumulative constraints to compute preemptive bounds | 2017-12-20 | Paper |
| Graphs with maximal induced matchings of the same size | 2016-11-24 | Paper |
| Polynomial-time algorithms for minimum energy scheduling | 2014-09-09 | Paper |
| Integer preemptive scheduling on parallel machines | 2013-03-05 | Paper |
| The \(K\) king problem, an abstract model for computing aircraft landing trajectories: on modeling a dynamic hybrid system with constraints | 2012-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115718 | 2012-02-10 | Paper |
| Properties of optimal schedules in preemptive shop scheduling | 2011-03-10 | Paper |
| Scheduling unit tasks to minimize the number of idle periods | 2010-08-16 | Paper |
| Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances | 2010-05-07 | Paper |
| A note on scheduling identical coupled tasks in logarithmic time | 2010-05-05 | Paper |
| On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups | 2010-04-28 | Paper |
| Fast paths in large-scale dynamic road networks | 2010-03-15 | Paper |
| On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation | 2010-03-09 | Paper |
| Time-indexed formulations for scheduling chains on a single machine: an application to airborne radars | 2009-12-21 | Paper |
| Integrality Property in Preemptive Parallel Machine Scheduling | 2009-08-18 | Paper |
| Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks | 2009-01-27 | Paper |
| Lower bounds for parallel machine scheduling problems | 2008-10-02 | Paper |
| Polynomial Time Algorithms for Minimum Energy Scheduling | 2008-09-25 | Paper |
| Inter-distance Constraint: An Extension of the All-Different Constraint for Scheduling Equal Length Jobs | 2008-09-09 | Paper |
| Runway sequencing with holding patterns | 2008-04-24 | Paper |
| Lagrangian bounds for just-in-time job-shop scheduling | 2007-10-19 | Paper |
| Dominance-based heuristics for one-machine total cost scheduling problems | 2007-10-10 | Paper |
| On scheduling a multifunction radar | 2007-06-08 | Paper |
| The complexity of mean flow time scheduling problems with release times | 2007-05-15 | Paper |
| Arc-B-consistency of the inter-distance constraint | 2007-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3426433 | 2007-03-09 | Paper |
| Airspace sectorization with constraints | 2006-07-11 | Paper |
| Scheduling with a constraint based cooperative solver | 2006-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5463608 | 2005-08-05 | Paper |
| Scheduling a single machine to minimize a regular objective function under setup constraints | 2005-06-01 | Paper |
| Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time | 2005-02-08 | Paper |
| Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time | 2004-10-28 | Paper |
| Tight LP bounds for resource constrained project scheduling | 2004-09-22 | Paper |
| A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates | 2004-08-10 | Paper |
| Preemptive scheduling of equal-length jobs to maximize weighted throughput. | 2004-03-15 | Paper |
| A note on scheduling multiprocessor tasks with identical processing times. | 2003-11-17 | Paper |
| A note on scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness | 2003-08-21 | Paper |
| Batching identical jobs | 2003-08-18 | Paper |
| On minimizing the weighted number of late jobs in unit execution time open-shops. | 2003-07-30 | Paper |
| Constraint-based scheduling: Applying constraint programming to scheduling problems. | 2003-07-28 | Paper |
| A branch and bound to minimize the number of late jobs on a single machine with release time constraints | 2003-04-28 | Paper |
| On preemption redundancy in scheduling unit processing time jobs on two parallel machines | 2002-09-22 | Paper |
| On minimizing total tardiness in a serial batching problem | 2002-08-25 | Paper |
| Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times | 2001-11-06 | Paper |
| An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs | 2001-03-04 | Paper |
| Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems | 2000-08-13 | Paper |
| Scheduling equal-length jobs on identical parallel machines | 2000-07-11 | Paper |
| Satisfiability tests and time-bound adjustments for cumulative scheduling problems | 2000-01-11 | Paper |
| Resource constraints for preemptive job-shop scheduling | 1999-02-02 | Paper |
| Heuristic control of a constraint-based algorithm for the preemptive job-shop scheduling problem | 1999-01-01 | Paper |
