Solving the Project Time/Cost Tradeoff Problem Using the Minimal Cut Concept
From MaRDI portal
Publication:4147802
DOI10.1287/mnsc.24.4.393zbMath0371.90039OpenAlexW2041242446MaRDI QIDQ4147802
Mohamed I. Dessouky, Steve Jun. Phillips
Publication date: 1977
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.24.4.393
Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Deterministic network models in operations research (90B10)
Related Items (18)
The contractor time–cost–credit trade‐off problem: integer programming model, heuristic solution, and business insights ⋮ Time-cost trade-off analysis of project networks in fuzzy environments ⋮ Modeling stochastic project time-cost trade-offs with time-dependent activity durations ⋮ Finding an optimal Nash equilibrium to the multi-agent project scheduling problem ⋮ Minimizing task completion time with the execution set method ⋮ A heuristic procedure for solving the dynamic probabilistic project expediting problem ⋮ Unnamed Item ⋮ New fuzzy models for time-cost trade-off problem ⋮ On project scheduling with irregular starting time costs ⋮ Nash equilibria for the multi-agent project scheduling problem with controllable processing times ⋮ A new approach based on the surrogating method in the project time compression problems ⋮ Nash equilibrium solutions in multi-agent project scheduling with milestones ⋮ Optimization models and a GA-based algorithm for stochastic time-cost trade-off problem ⋮ Price of anarchy and price of stability in multi-agent project scheduling ⋮ Resource-constrained project scheduling: Notation, classification, models, and methods ⋮ Minimization of the makespan in a two-machine problem under given resource constraints ⋮ A parametric algorithm for convex cost network flow and related problems ⋮ Improving project cost estimation by taking into account managerial flexibility
This page was built for publication: Solving the Project Time/Cost Tradeoff Problem Using the Minimal Cut Concept