Publication:4695780

DOI<25::AID-NAV3220400103>3.0.CO;2-2 10.1002/1520-6750(199302)40:1<25::AID-NAV3220400103>3.0.CO;2-2zbMath0766.90055MaRDI QIDQ4695780

S. Selcuk Erenguc, Suleyman Tufekci, C. Zappe

Publication date: 29 June 1993

zbMATH Keywords

project scheduling; mixed-integer nonlinear program; generalized Benders decomposition technique

Mathematics Subject Classification ID

90C90: Applications of mathematical programming

90C11: Mixed integer programming

90C30: Nonlinear programming

90B35: Deterministic scheduling theory in operations research

90B90: Case-oriented studies in operations research

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

Project scheduling with finite or infinite number of activity processing modes -- a survey, The discrete time/cost trade-off problem: Extensions and heuristic procedures, Robust scheduling and robustness measures for the discrete time/cost trade-off problem, Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version, Simulated annealing and tabu search for multi-mode project payment scheduling, Optimal procedures for the discrete time/cost trade-off problem in project networks, Project network models with discounted cash flows a guided tour through recent developments, An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs, Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models