scientific article; zbMATH DE number 3619596

MaRDI QIDQ4182229zbMATH OpenFDO

Authors N. Billstein, F. J. Radermacher

Publication date 1977

zbMATH Keywords

Project NetworkTime-Cost Optimization

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35)

Cited in

(6)

• Simulated annealing and tabu search for multi-mode project payment scheduling
• Resource-constrained project scheduling: Notation, classification, models, and methods
• The discrete time/cost trade-off problem: Extensions and heuristic procedures
• Network decomposition-based benchmark results for the discrete time-cost tradeoff problem
• New computational results for the discrete time/cost trade-off problem with time-switch constraints
• A heuristic procedure for solving the dynamic probabilistic project expediting problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4182229)