| Publication | Date of Publication | Type |
|---|
| An Approach to Linear Programming under Uncertainty | 2019-06-03 | Paper |
| Project bidding under deterministic and probabilistic activity durations | 2018-07-19 | Paper |
| The scheduling of activities to maximize the net present value of projects | 2018-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2932938 | 2014-12-09 | Paper |
| Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop | 2009-11-17 | Paper |
| Mathematical programming and financial objectives for scheduling projects | 2007-05-15 | Paper |
| On the fallacy of averages in project risk management | 2005-04-21 | Paper |
| Sequencing a hybrid two-stage flowshop with dedicated machines | 2003-10-13 | Paper |
| Allocation under Uncertainty when the Demand has Continuous D.F. | 2002-10-22 | Paper |
| Chance-constrained programming in activity networks: A critical evaluation | 2002-09-03 | Paper |
| On criticality and sensitivity in activity networks | 2002-08-19 | Paper |
| On computing the distribution function of the sum of independent random variables | 2001-12-10 | Paper |
| The economic lot scheduling problem under power-of-two policy | 2001-11-12 | Paper |
| Call admission control schemes and ATM network topological design | 2000-06-14 | Paper |
| A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan | 1999-08-02 | Paper |
| Optimal procedures for the discrete time/cost trade-off problem in project networks | 1998-11-29 | Paper |
| DAGEN: A generator of testsets for project activity nets | 1998-10-07 | Paper |
| Activity nets: A guided tour through some recent developments | 1998-06-11 | Paper |
| An Approach to the Modeling and Analysis of Software Production Processes | 1997-01-15 | Paper |
| Resource allocation via dynamic programming in activity networks | 1993-06-29 | Paper |
| The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs) | 1993-01-12 | Paper |
| Optimal control of the southern pine bettle (SPB) infestation | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3197607 | 1990-01-01 | Paper |
| Quality assurance and stage dynamics in multi-stage manufacturing. Part II | 1990-01-01 | Paper |
| On heuristics and their performance evaluation for dynamic lot sizing | 1989-01-01 | Paper |
| The knapsack problem with generalized upper bounds | 1989-01-01 | Paper |
| On the reduction method for integer linear programs. II | 1985-01-01 | Paper |
| Approximating the Criticality Indices of the Activities in PERT Networks | 1985-01-01 | Paper |
| Bounds on the performance of a heuristic to schedule precedence-related jobs on parallel machines | 1984-01-01 | Paper |
| On the measurement of complexity in activity networks | 1980-01-01 | Paper |
| Some operations research approaches to automobile gear train design | 1979-01-01 | Paper |
| Optimal project compression with due-dated events | 1979-01-01 | Paper |
| The Economic Lot Scheduling Problem (ELSP): Review and Extensions | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4166568 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4772959 | 1973-01-01 | Paper |
| Note—On the Sequencing of n Jobs on One Machine to Minimize the Number of Jobs Late | 1972-01-01 | Paper |
| Optimization of Batch Ordering under Deterministic Variable Demand | 1972-01-01 | Paper |
| Optimal Time-Cost Trade-Offs in GERT Networks | 1972-01-01 | Paper |
| On Hyperbolic Programming with a Single Constraint and Upper-Bounded Variables | 1972-01-01 | Paper |
| Rejoinder | 1971-01-01 | Paper |
| A graph theoretic interpretation of the sufficiency conditions for the contiguous-binary-switching (CBS)-rule | 1971-01-01 | Paper |
| The concept of state in discrete dynamic programming | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5591269 | 1970-01-01 | Paper |
| The Theory of Networks and Management Science. Part I | 1970-01-01 | Paper |
| The Theory of Networks and Management Science. Part I | 1970-01-01 | Paper |
| The sequencing of “related” jobs | 1968-01-01 | Paper |
| On the Expected Duration of PERT Type Networks | 1967-01-01 | Paper |
| On the dynamic programming approach to the 'caterer' problem | 1964-01-01 | Paper |
| On the relationship between the cut-tree and the fundamental cut-set of multi-terminal flow networks | 1964-01-01 | Paper |
| Sensitivity Analysis of Multiterminal Flow Networks | 1964-01-01 | Paper |
| A Note on the “Explosion” and “Netting” Problems in the Planning of Materials Requirements | 1963-01-01 | Paper |
| A Single-Sample Multiple-Decision Procedure for Selecting the Multinomial Event Which Has the Highest Probability | 1959-01-01 | Paper |
