scientific article; zbMATH DE number 3619596
From MaRDI portal
Publication:4182229
zbMATH Open0398.90049MaRDI QIDQ4182229FDOQ4182229
Authors: N. Billstein, F. J. Radermacher 
Publication date: 1977
Title of this publication is not available (Why is that?)
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
- 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
- The discrete time/cost trade-off problem: Extensions and heuristic procedures
- 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)
