| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q4553432 | 2018-11-02 | Paper |
| Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines | 2018-02-28 | Paper |
| A note on ``Event-based MILP models for resource-constrained project scheduling problems | 2016-11-14 | Paper |
| A branch and bound algorithm for the cyclic job-shop problem with transportation | 2016-11-11 | Paper |
| Polynomially solvable personnel rostering problems | 2016-10-07 | Paper |
| Network flow models for intraday personnel scheduling problems | 2014-11-26 | Paper |
| A mixed integer programming model for the cyclic job-shop problem with transportation | 2012-08-10 | Paper |
| A polynomial-time algorithm for a flow-shop batching problem with equal-length operations | 2012-01-16 | Paper |
| Inverse scheduling: Two-machine flow-shop problem | 2011-10-18 | Paper |
| Personnel scheduling: models and complexity | 2011-06-07 | Paper |
| A shift sequence based approach for nurse scheduling and a new benchmark dataset | 2010-10-06 | Paper |
| Inverse scheduling with maximum lateness objective | 2009-12-02 | Paper |
| Scheduling jobs with equal processing times and time windows on identical parallel machines | 2009-08-28 | Paper |
| A general model for cyclic machine scheduling problems | 2008-11-19 | Paper |
| Cyclic job shop scheduling problems with blocking | 2008-09-03 | Paper |
| Complex Scheduling | 2008-07-10 | Paper |
| Complexity of shop-scheduling problems with fixed number of jobs: a survey | 2007-11-14 | Paper |
| Tabu search algorithms for cyclic machine scheduling problems | 2007-05-15 | Paper |
| The complexity of mean flow time scheduling problems with release times | 2007-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3425131 | 2007-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3416597 | 2007-01-22 | Paper |
| Scheduling equal processing time jobs to minimize the weighted number of late jobs | 2006-11-17 | Paper |
| Job-shop scheduling with limited capacity buffers | 2006-11-03 | Paper |
| Scheduling chains with identical jobs and constant delays on a single machine | 2006-08-18 | Paper |
| Complexity results for flow-shop problems with a single server | 2005-04-21 | Paper |
| The algebraic Monge property and path problems | 2005-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4826104 | 2004-11-10 | Paper |
| Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time | 2004-10-28 | Paper |
| Complexity results for flow-shop and open-shop scheduling problems with transportation delays | 2004-08-10 | Paper |
| How useful are preemptive schedules? | 2003-11-17 | Paper |
| Flow-shop problems with intermediate buffers | 2003-11-09 | Paper |
| Routing of railway carriages | 2003-09-15 | Paper |
| Scheduling UET task systems with concurrency on two parallel identical processors | 2003-08-18 | Paper |
| Lower bounds for resource-constrained project scheduling problems. | 2003-07-30 | Paper |
| A polynomial algorithm for \(P | p_j = 1,r_j, outtree\,| \sum C_j\) | 2003-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708562 | 2003-06-18 | Paper |
| Complexity results for parallel machine problems with a single server | 2003-02-23 | Paper |
| Lower bounds for scheduling a single robot in a job-shop environment | 2003-01-27 | Paper |
| Scheduling and constraint propagation | 2002-09-17 | Paper |
| A linear programming and constraint propagation-based lower bound for the RCPSP | 2002-08-26 | Paper |
| Scheduling railway traffic at a construction site | 2002-05-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2779816 | 2002-04-15 | Paper |
| A branch and bound algorithm for the resource-constrained project scheduling problem | 2001-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2734595 | 2001-08-20 | Paper |
| Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments | 2001-05-07 | Paper |
| Solving a chemical batch scheduling problem by local search | 2001-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4495168 | 2001-01-04 | Paper |
| A new tabu search procedure for an audit-scheduling problem | 2000-08-07 | Paper |
| Resource-constrained project scheduling: Notation, classification, models, and methods | 2000-06-14 | Paper |
| Scheduling identical jobs with chain precedence constraints on two uniform machines | 2000-05-07 | Paper |
| Complexity results for single-machine problems with positive finish-start time-lags | 2000-03-16 | Paper |
| Preemptive job-shop scheduling problems with a fixed number of jobs | 1999-09-07 | Paper |
| A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags | 1999-06-28 | Paper |
| Batch scheduling with deadlines on parallel machines | 1999-03-07 | Paper |
| Scheduling a batching machine | 1999-01-11 | Paper |
| Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems | 1998-10-07 | Paper |
| Tabu-search for the multi-mode job-shop problem | 1998-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4396949 | 1998-06-18 | Paper |
| A branch \(\&\) bound algorithm for the open-shop problem | 1998-02-24 | Paper |
| On the complexity of two machine job-shop scheduling with regular objective functions | 1997-12-04 | Paper |
| Complexity of scheduling problems with multi-purpose machines | 1997-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4350045 | 1997-08-28 | Paper |
| Improving local search heuristics for some scheduling problems. II | 1997-04-21 | Paper |
| A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times | 1996-08-05 | Paper |
| Improving local search heuristics for some scheduling problems. I | 1996-07-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4873242 | 1996-04-16 | Paper |
| A Monge property for the \(d\)-dimensional transportation problem | 1996-03-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4859840 | 1996-01-07 | Paper |
| Efficient algorithms for some path partitioning problems | 1995-11-22 | Paper |
| Shop scheduling problems with multiprocessor tasks on dedicated processors | 1995-08-27 | Paper |
| The job-shop problem and immediate selection | 1994-12-01 | Paper |
| The complexity of one-machine batching problems | 1994-07-25 | Paper |
| A branch and bound algorithm for the job-shop scheduling problem | 1994-07-18 | Paper |
| A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs | 1994-06-08 | Paper |
| Series parallel composition of greedy linear programming problem | 1994-04-28 | Paper |
| The \(k\)-track assignment problem | 1994-04-12 | Paper |
| Scheduling unit time open shops to minimize the weighted number of late jobs | 1994-04-06 | Paper |
| A new lower bound for the job-shop scheduling problem | 1993-06-29 | Paper |
| Open shop problems with unit time operations | 1993-05-03 | Paper |
| Job-shop scheduling with multi-purpose machines | 1992-06-25 | Paper |
| A characterization of network representable polymatroids | 1991-01-01 | Paper |
| Cyclic schedules for r irregularity occurring events | 1990-01-01 | Paper |
| Pattern scheduling | 1990-01-01 | Paper |
| An O(n log n)-algorithm for solving a special class of linear programs | 1989-01-01 | Paper |
| k-optimal solution sets for some polynomially solvable scheduling problems | 1989-01-01 | Paper |
| Scheduling two irregular polygons | 1988-01-01 | Paper |
| An efficient algorithm for the job-shop problem with two jobs | 1988-01-01 | Paper |
| Approximation of a set of points by points of a grid | 1987-01-01 | Paper |
| Greedy concepts for network flow problems | 1986-01-01 | Paper |
| A railway scheduling problem | 1986-01-01 | Paper |
| An out-of-kilter method for the algebraic circulation problem | 1985-01-01 | Paper |
| Minimum cost flow algorithms for series-parallel networks | 1985-01-01 | Paper |
| An O(n) algorithm for quadratic knapsack problems | 1984-01-01 | Paper |
| AnO (n)-algorithm for LP-knapsacks with a fixed number of GUB constraints | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3329200 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3332729 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3675893 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3682206 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3682270 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3318501 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3942735 | 1982-01-01 | Paper |
| Minimizing maximum lateness in a two-machine unit-time job shop | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3912618 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3929043 | 1981-01-01 | Paper |
| NP-Complete operations research problems and approximation algorithms | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4170532 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4181272 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4124328 | 1977-01-01 | Paper |
| Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4181954 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4082533 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4152035 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4174530 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4071007 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4055377 | 1975-01-01 | Paper |
| A decomposition algorithm for shortest paths in a network with many strongly connected components | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4044376 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4068425 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5650541 | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5665021 | 1972-01-01 | Paper |
| Dualität zwischen Kategorien topologischer Räume und Kategorien von K-Verbänden | 1972-01-01 | Paper |
| \({\mathfrak R}\)-Netzwerke und Matrixalgorithmen | 1972-01-01 | Paper |
| Verbände stetiger Funktionen und kettenwertige Homomorphismen | 1971-01-01 | Paper |
| Eine Charakterisierung \(K\)-kompakter topologischer Räume | 1971-01-01 | Paper |
