| Publication | Date of Publication | Type |
|---|
| scientific article; zbMATH DE number 6971071 (Why is no real title available?) | 2018-11-02 | Paper |
Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines
Journal of Scheduling | 2018-02-28 | Paper |
A note on ``Event-based MILP models for resource-constrained project scheduling problems''
Computers & Operations Research | 2016-11-14 | Paper |
A branch and bound algorithm for the cyclic job-shop problem with transportation
Computers & Operations Research | 2016-11-11 | Paper |
Polynomially solvable personnel rostering problems
European Journal of Operational Research | 2016-10-07 | Paper |
Network flow models for intraday personnel scheduling problems
Annals of Operations Research | 2014-11-26 | Paper |
A note on reverse scheduling with maximum lateness objective
Journal of Scheduling | 2014-08-18 | Paper |
A mixed integer programming model for the cyclic job-shop problem with transportation
Discrete Applied Mathematics | 2012-08-10 | Paper |
A polynomial-time algorithm for a flow-shop batching problem with equal-length operations
Journal of Scheduling | 2012-01-16 | Paper |
Inverse scheduling: Two-machine flow-shop problem
Journal of Scheduling | 2011-10-18 | Paper |
Personnel scheduling: models and complexity
European Journal of Operational Research | 2011-06-07 | Paper |
A shift sequence based approach for nurse scheduling and a new benchmark dataset
Journal of Heuristics | 2010-10-06 | Paper |
Inverse scheduling with maximum lateness objective
Journal of Scheduling | 2009-12-02 | Paper |
Scheduling jobs with equal processing times and time windows on identical parallel machines
Journal of Scheduling | 2009-08-28 | Paper |
A general model for cyclic machine scheduling problems
Discrete Applied Mathematics | 2008-11-19 | Paper |
Cyclic job shop scheduling problems with blocking
Annals of Operations Research | 2008-09-03 | Paper |
Complex Scheduling
GOR ■ Publications | 2008-07-10 | Paper |
Complexity of shop-scheduling problems with fixed number of jobs: a survey
Mathematical Methods of Operations Research | 2007-11-14 | Paper |
Tabu search algorithms for cyclic machine scheduling problems
Journal of Scheduling | 2007-05-15 | Paper |
The complexity of mean flow time scheduling problems with release times
Journal of Scheduling | 2007-05-15 | Paper |
| Scheduling algorithms | 2007-03-05 | Paper |
| Cyclic scheduling problems with linear precedences and resource constraints | 2007-01-22 | Paper |
Scheduling equal processing time jobs to minimize the weighted number of late jobs
JMMA. Journal of Mathematical Modelling and Algorithms | 2006-11-17 | Paper |
Job-shop scheduling with limited capacity buffers
OR Spectrum | 2006-11-03 | Paper |
Scheduling chains with identical jobs and constant delays on a single machine
Mathematical Methods of Operations Research | 2006-08-18 | Paper |
Complexity results for flow-shop problems with a single server
European Journal of Operational Research | 2005-04-21 | Paper |
The algebraic Monge property and path problems
Discrete Applied Mathematics | 2005-02-23 | Paper |
| scientific article; zbMATH DE number 2114378 (Why is no real title available?) | 2004-11-10 | Paper |
Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
4OR | 2004-10-28 | Paper |
Complexity results for flow-shop and open-shop scheduling problems with transportation delays
Annals of Operations Research | 2004-08-10 | Paper |
How useful are preemptive schedules?
Operations Research Letters | 2003-11-17 | Paper |
Flow-shop problems with intermediate buffers
OR Spectrum | 2003-11-09 | Paper |
Routing of railway carriages
Journal of Global Optimization | 2003-09-15 | Paper |
Scheduling UET task systems with concurrency on two parallel identical processors
Mathematical Methods of Operations Research | 2003-08-18 | Paper |
Lower bounds for resource-constrained project scheduling problems.
European Journal of Operational Research | 2003-07-30 | Paper |
A polynomial algorithm for \(P | p_j = 1,r_j, outtree\,| \sum C_j\)
Mathematical Methods of Operations Research | 2003-06-23 | Paper |
| scientific article; zbMATH DE number 1929930 (Why is no real title available?) | 2003-06-18 | Paper |
Complexity results for parallel machine problems with a single server
Journal of Scheduling | 2003-02-23 | Paper |
Lower bounds for scheduling a single robot in a job-shop environment
Annals of Operations Research | 2003-01-27 | Paper |
Scheduling and constraint propagation
Discrete Applied Mathematics | 2002-09-17 | Paper |
A linear programming and constraint propagation-based lower bound for the RCPSP
European Journal of Operational Research | 2002-08-26 | Paper |
Scheduling railway traffic at a construction site
OR Spectrum | 2002-05-30 | Paper |
| scientific article; zbMATH DE number 1728543 (Why is no real title available?) | 2002-04-15 | Paper |
A branch and bound algorithm for the resource-constrained project scheduling problem
European Journal of Operational Research | 2001-10-21 | Paper |
| scientific article; zbMATH DE number 1634827 (Why is no real title available?) | 2001-08-20 | Paper |
Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments
Journal of Scheduling | 2001-05-07 | Paper |
Solving a chemical batch scheduling problem by local search
Annals of Operations Research | 2001-01-17 | Paper |
| scientific article; zbMATH DE number 1488068 (Why is no real title available?) | 2001-01-04 | Paper |
A new tabu search procedure for an audit-scheduling problem
Journal of Scheduling | 2000-08-07 | Paper |
Resource-constrained project scheduling: Notation, classification, models, and methods
European Journal of Operational Research | 2000-06-14 | Paper |
Scheduling identical jobs with chain precedence constraints on two uniform machines
Mathematical Methods of Operations Research | 2000-05-07 | Paper |
Complexity results for single-machine problems with positive finish-start time-lags
Computing | 2000-03-16 | Paper |
Preemptive job-shop scheduling problems with a fixed number of jobs
Mathematical Methods of Operations Research | 1999-09-07 | Paper |
A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags
Discrete Applied Mathematics | 1999-06-28 | Paper |
Batch scheduling with deadlines on parallel machines
Annals of Operations Research | 1999-03-07 | Paper |
Scheduling a batching machine
Journal of Scheduling | 1999-01-11 | Paper |
Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
European Journal of Operational Research | 1998-10-07 | Paper |
Tabu-search for the multi-mode job-shop problem
OR Spektrum | 1998-07-01 | Paper |
| scientific article; zbMATH DE number 1167865 (Why is no real title available?) | 1998-06-18 | Paper |
A branch \(\&\) bound algorithm for the open-shop problem
Discrete Applied Mathematics | 1998-02-24 | Paper |
Complexity of scheduling problems with multi-purpose machines
Annals of Operations Research | 1997-12-04 | Paper |
On the complexity of two machine job-shop scheduling with regular objective functions
OR Spektrum | 1997-12-04 | Paper |
| scientific article; zbMATH DE number 1054933 (Why is no real title available?) | 1997-08-28 | Paper |
Improving local search heuristics for some scheduling problems. II
Discrete Applied Mathematics | 1997-04-21 | Paper |
A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times
OR Spektrum | 1996-08-05 | Paper |
Improving local search heuristics for some scheduling problems. I
Discrete Applied Mathematics | 1996-07-07 | Paper |
| scientific article; zbMATH DE number 866105 (Why is no real title available?) | 1996-04-16 | Paper |
A Monge property for the \(d\)-dimensional transportation problem
Discrete Applied Mathematics | 1996-03-18 | Paper |
| scientific article; zbMATH DE number 830382 (Why is no real title available?) | 1996-01-07 | Paper |
Efficient algorithms for some path partitioning problems
Discrete Applied Mathematics | 1995-11-22 | Paper |
Shop scheduling problems with multiprocessor tasks on dedicated processors
Annals of Operations Research | 1995-08-27 | Paper |
The job-shop problem and immediate selection
Annals of Operations Research | 1994-12-01 | Paper |
The complexity of one-machine batching problems
Discrete Applied Mathematics | 1994-07-25 | Paper |
A branch and bound algorithm for the job-shop scheduling problem
Discrete Applied Mathematics | 1994-07-18 | Paper |
A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs
OR Spektrum | 1994-06-08 | Paper |
Series parallel composition of greedy linear programming problem
Mathematical Programming. Series A. Series B | 1994-04-28 | Paper |
The k-track assignment problem
Computing | 1994-04-12 | Paper |
Scheduling unit time open shops to minimize the weighted number of late jobs
Operations Research Letters | 1994-04-06 | Paper |
A new lower bound for the job-shop scheduling problem
European Journal of Operational Research | 1993-06-29 | Paper |
Open shop problems with unit time operations
ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research | 1993-05-03 | Paper |
Job-shop scheduling with multi-purpose machines
Computing | 1992-06-25 | Paper |
A characterization of network representable polymatroids
ZOR Zeitschrift f� Operations Research Methods and Models of Operations Research | 1991-01-01 | Paper |
Cyclic schedules for r irregularity occurring events
Journal of Computational and Applied Mathematics | 1990-01-01 | Paper |
Pattern scheduling
ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research | 1990-01-01 | Paper |
An O(n log n)-algorithm for solving a special class of linear programs
Computing | 1989-01-01 | Paper |
k-optimal solution sets for some polynomially solvable scheduling problems
European Journal of Operational Research | 1989-01-01 | Paper |
An efficient algorithm for the job-shop problem with two jobs
Computing | 1988-01-01 | Paper |
Scheduling two irregular polygons
Discrete Applied Mathematics | 1988-01-01 | Paper |
Approximation of a set of points by points of a grid
Computing | 1987-01-01 | Paper |
A railway scheduling problem
Zeitschrift für Operations Research | 1986-01-01 | Paper |
Greedy concepts for network flow problems
Discrete Applied Mathematics | 1986-01-01 | Paper |
Minimum cost flow algorithms for series-parallel networks
Discrete Applied Mathematics | 1985-01-01 | Paper |
An out-of-kilter method for the algebraic circulation problem
Discrete Applied Mathematics | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3904362 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3904297 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3864952 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3896657 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3860868 (Why is no real title available?) | 1984-01-01 | Paper |
An O(n) algorithm for quadratic knapsack problems
Operations Research Letters | 1984-01-01 | Paper |
AnO (n)-algorithm for LP-knapsacks with a fixed number of GUB constraints
Zeitschrift für Operations Research | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3848941 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3759900 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3724496 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3744539 (Why is no real title available?) | 1981-01-01 | Paper |
Minimizing maximum lateness in a two-machine unit-time job shop
Computing | 1981-01-01 | Paper |
NP-Complete operations research problems and approximation algorithms
Zeitschrift für Operations Research | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3617544 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3604679 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3550182 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3619309 (Why is no real title available?) | 1977-01-01 | Paper |
Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness
Mathematics of Operations Research | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3609459 (Why is no real title available?) | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3501230 (Why is no real title available?) | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3583590 (Why is no real title available?) | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3471786 (Why is no real title available?) | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3487212 (Why is no real title available?) | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3485474 (Why is no real title available?) | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3458413 (Why is no real title available?) | 1974-01-01 | Paper |
A decomposition algorithm for shortest paths in a network with many strongly connected components
Zeitschrift für Operations Research | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3397316 (Why is no real title available?) | 1972-01-01 | Paper |
| scientific article; zbMATH DE number 3378738 (Why is no real title available?) | 1972-01-01 | Paper |
\({\mathfrak R}\)-Netzwerke und Matrixalgorithmen
Computing | 1972-01-01 | Paper |
Dualität zwischen Kategorien topologischer Räume und Kategorien von K-Verbänden
Monatshefte für Mathematik | 1972-01-01 | Paper |
Verbände stetiger Funktionen und kettenwertige Homomorphismen
Mathematische Annalen | 1971-01-01 | Paper |
Eine Charakterisierung \(K\)-kompakter topologischer Räume
Monatshefte für Mathematik | 1971-01-01 | Paper |
