DOI10.1137/0221065zbMath0768.68119OpenAlexW2044263435MaRDI QIDQ4027859
Jerzy Kamburowski, Matthias F. M. Stallmann, Wolfgang W. Bein
Publication date: 9 March 1993
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0221065
Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks,
An automatic algorithm selection approach for the multi-mode resource-constrained project scheduling problem,
Exact algorithms for single-machine scheduling with time windows and precedence constraints,
A reduction tree approach for the discrete time/cost trade-off problem,
Models and algorithms for network reduction,
A note on algebraic expressions of rhomboidal labeled graphs,
On lengths of edge-labeled graph expressions,
A factoring approach for the Steiner tree problem in undirected networks,
The discrete time-cost tradeoff problem revisited,
Estimation of expressions' complexities for two-terminal directed acyclic graphs,
Activity nets: A guided tour through some recent developments,
On algebraic expressions of directed grid graphs,
Evaluation of the quantiles and superquantiles of the makespan in interval valued activity networks,
Resource-constrained project scheduling: A survey of recent developments.,
Measuring the distance to series-parallelity by path expressions,
An evaluation of the adequacy of project network generators with systematically sampled networks,
A heuristic procedure for solving the dynamic probabilistic project expediting problem,
Bounding the distribution of project duration in PERT networks,
The exact overall time distribution of a project with uncertain task durations,
A random generator of resource-constrained multi-project network problems,
Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming,
Computational complexity of impact size estimation for spreading processes on networks,
Network decomposition-based benchmark results for the discrete time-cost tradeoff problem,
A review of the contribution of operational research to project management,
Robust scheduling and robustness measures for the discrete time/cost trade-off problem,
Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality,
Some tractable instances of interval data minmax regret problems,
Resource-constrained project scheduling: Notation, classification, models, and methods,
Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation,
DAGEN: A generator of testsets for project activity nets,
Optimal procedures for the discrete time/cost trade-off problem in project networks,
On the use of the complexity index as a measure of complexity in activity networks,
A Note on the Recognition of Nested Graphs,
Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version,
Nested Graphs,
Decomposition methods for generating algebraic expressions of full square rhomboids and other graphs
