| Publication | Date of Publication | Type |
|---|
| A hybrid local search algorithm for the Continuous Energy-Constrained Scheduling Problem | 2023-11-24 | Paper |
| Formulating a scheduling problem with almost identical jobs by using positional completion times | 2022-08-30 | Paper |
| Synchronizing transportation of people with reduced mobility through airport terminals | 2021-04-20 | Paper |
| Minimizing total completion time in a two-machine flowshop: Analysis of special cases | 2019-01-11 | Paper |
| Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem | 2018-07-11 | Paper |
| Performing Multicut on Walkable Environments | 2017-02-01 | Paper |
| Decomposition approaches for recoverable robust optimization problems | 2016-10-07 | Paper |
| Robust Recoverable Path Using Backup Nodes | 2016-03-10 | Paper |
| Book review of: Vincent T'kindt and Jean-Charles Billaut, Multicriteria scheduling. Theory, models and algorithms. | 2015-01-22 | Paper |
| Rescheduling for new orders on a single machine with setup times | 2012-12-29 | Paper |
| Minimizing the number of late jobs when the start time of the machine is variable | 2012-11-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 |
| Non-Approximability Results for Scheduling Problems with Minsum Criteria | 2012-05-30 | Paper |
| Combining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date Problem | 2012-05-30 | Paper |
| Recoverable Robustness by Column Generation | 2011-09-16 | Paper |
| Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs | 2011-04-01 | Paper |
| Integrated Gate and Bus Assignment at Amsterdam Airport Schiphol | 2009-12-03 | Paper |
| Minimizing the number of late jobs in a stochastic setting using a chance constraint | 2009-08-28 | Paper |
| A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems | 2009-03-10 | Paper |
| Parallel Machine Scheduling Through Column Generation: Minimax Objective Functions | 2008-03-11 | Paper |
| Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard | 2007-12-20 | Paper |
| Lower bounds for minimizing total completion time in a two-machine flow shop | 2007-05-15 | Paper |
| Applying Column Generation to Machine Scheduling | 2006-10-16 | Paper |
| Scheduling with step-improving processing times | 2006-01-18 | Paper |
| Multicriteria scheduling | 2005-09-28 | Paper |
| Preemptive scheduling with rejection | 2003-10-29 | Paper |
| The two-machine open shop problem: To fit or not to fit, that is the question | 2003-06-17 | Paper |
| The three-machine proportionate flow shop problem with unequal machine speeds | 2003-06-17 | Paper |
| Some comments on sequencing with controllable processing times | 2003-01-20 | Paper |
| On-line scheduling on a single machine: Maximizing the number of early jobs | 2002-09-03 | Paper |
| A very difficult scheduling problem with communication delays | 2002-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4331306 | 2002-05-15 | Paper |
| Parallel Machine Scheduling by Column Generation | 2002-02-07 | Paper |
| A combinatorial property of Pallet-constrained two machine flow shop problem in minimizing makespan | 2002-01-01 | Paper |
| Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases | 2001-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753942 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753958 | 2001-11-11 | Paper |
| Restarts can help in the on-line minimization of the maximum delivery time on a single machine | 2001-08-20 | Paper |
| Scheduling with target start times | 2001-03-12 | Paper |
| Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing | 2000-11-05 | Paper |
| Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine | 1999-10-18 | Paper |
| Minimizing makespan in a pallet-constrained flowshop | 1999-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234143 | 1999-03-16 | Paper |
| Minimizing total weighted completion time in a proportionate flow shop | 1999-01-11 | Paper |
| Scheduling a batching machine | 1999-01-11 | Paper |
| Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard | 1998-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840371 | 1998-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4398369 | 1998-07-19 | Paper |
| Short Shop Schedules | 1998-07-06 | Paper |
| A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time | 1998-04-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4343706 | 1998-02-05 | Paper |
| Earliness-Tardiness Scheduling Around Almost Equal Due Dates | 1998-01-15 | Paper |
| Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time | 1997-03-23 | Paper |
| Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria | 1996-10-16 | Paper |
| Minimizing Maximum Promptness and Maximum Lateness on a Single Machine | 1996-06-23 | Paper |
| Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems | 1996-02-06 | Paper |
| Three, four, five, six, or the complexity of scheduling with communication delays | 1995-02-13 | Paper |
| Complexity of scheduling multiprocessor tasks with prespecified processors allocations | 1995-02-01 | Paper |
| New Lower and Upper Bounds for Scheduling Around a Small Common Due Date | 1994-11-06 | Paper |
| A new lower bound approach for single-machine multicriteria scheduling | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4002567 | 1992-09-18 | Paper |
| Scheduling around a small common due date | 1992-06-28 | Paper |
| Analysis of Christofides' heuristic: some paths are more difficult than cycles | 1992-06-27 | Paper |
| Seven criteria for integer sequences being graphic | 1992-06-25 | Paper |
