Discrete time/cost trade-offs in project scheduling with time-switch constraints
From MaRDI portal
Publication:4656679
DOI10.1057/palgrave.jors.2601351zbMath1066.90046OpenAlexW2049711324MaRDI QIDQ4656679
Mario Vanhoucke, Willy S. Herroelen, Erik L. Demeulemeester
Publication date: 14 March 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601351
Related Items (10)
When it is worthwhile to work with the stochastic RCPSP? ⋮ The discrete time/cost trade-off problem: Extensions and heuristic procedures ⋮ A reduction tree approach for the discrete time/cost trade-off problem ⋮ Integration of routing into a resource-constrained project scheduling problem ⋮ Project scheduling with finite or infinite number of activity processing modes -- a survey ⋮ An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs ⋮ New computational results for the discrete time/cost trade-off problem with time-switch constraints ⋮ A solution approach to find the critical path in a time-constrained activity network ⋮ A survey of variants and extensions of the resource-constrained project scheduling problem ⋮ Structured construction and simulation of nondeterministic stochastic activity networks
Uses Software
This page was built for publication: Discrete time/cost trade-offs in project scheduling with time-switch constraints
