The discrete time-cost tradeoff problem revisited
From MaRDI portal
Publication:1129886
DOI10.1016/0377-2217(94)00187-HzbMath0927.90046OpenAlexW2010079526MaRDI QIDQ1129886
Prabuddha De, Jay B. Ghosh, E. James Dunne, Charles E. Wells
Publication date: 16 August 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)00187-h
Related Items
A heuristic approach for minimizing weighted tardiness and overtime costs in single resource scheduling, Single-machine scheduling with trade-off between number of tardy jobs and compression cost, The discrete time/cost trade-off problem: Extensions and heuristic procedures, A float-path theory and its application to the time-cost tradeoff problem, A hybrid simulation-optimization approach for the robust discrete time/cost trade-off problem, A reduction tree approach for the discrete time/cost trade-off problem, Solving multi-mode time–cost–quality trade-off problems under generalized precedence relations, A solution procedure for the discrete time, cost and quality tradeoff problem using electromagnetic scatter search, On the discrete time, cost and quality trade-off problem, Multimode time-cost-robustness trade-off project scheduling problem under uncertainty, Variable neighbourhood search and tabu search for a discrete time/cost trade-off problem to minimize the maximal cash flow gap, Deadline division-based heuristic for cost optimization in workflow scheduling, Improving electromagnetism algorithm for solving resource allocation problem in stochastic networks, Project scheduling with finite or infinite number of activity processing modes -- a survey, Finding an optimal Nash equilibrium to the multi-agent project scheduling problem, An agency perspective for multi-mode project scheduling with time/cost trade-offs, Robust proactive project scheduling model for the stochastic discrete time/cost trade-off problem, A heuristic procedure for solving the dynamic probabilistic project expediting problem, APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS, An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs, Unnamed Item, Project scheduling with irregular costs: complexity, approximability, and algorithms, Experimental evaluation of simulated annealing algorithms for the time-cost trade-off problem, 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 effect of risk aversion on the optimal project resource rate, A decomposition-based stochastic programming approach for the project scheduling problem under time/cost trade-off settings and uncertain durations, Robust scheduling and robustness measures for the discrete time/cost trade-off problem, A new path-based cutting plane approach for the discrete time-cost tradeoff problem, Integrating risk into estimations of project activities' time and cost: a stratified approach, Resource-constrained project scheduling: Notation, classification, models, and methods, Simulated annealing for financing cost distribution based project payment scheduling from a joint perspective, Multimode resource-constrained project scheduling in flexible projects, 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, A decomposed branch-and-price procedure for integrating demand planning in personnel staffing problems, Hardness of approximation of the discrete time-cost tradeoff problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A multi-stage non-deterministic model for project scheduling under resources constraints
- An algorithm for hierarchical reduction and decomposition of a directed graph
- One-machine rescheduling heuristics with efficiency and stability as criteria
- Optimal procedures for the discrete time/cost trade-off problem in project networks
- Resource allocation via dynamic programming in activity networks
- A Network Flow Computation for Project Cost Curves
- Critical-Path Planning and Scheduling: Mathematical Basis
- A Fast Algorithm for the Decomposition of Graphs and Posets
- Optimal Sequencing by Modular Decomposition: Polynomial Algorithms
- Incremental modular decomposition
- The Recognition of Series Parallel Digraphs
- Optimal Reduction of Two-Terminal Directed Acyclic Graphs
- Decision CPM: Network Reduction and Solution
- A Dynamic Programming Solution to Cost-Time Tradeoff for CPM
- A CPM Time-Cost Computational Algorithm for Arbitrary Activity Cost Functions
- A Dynamic Programming Algorithm for Decision CPM Networks
- Decomposition of Project Networks
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs