The contractor time–cost–credit trade‐off problem: integer programming model, heuristic solution, and business insights
From MaRDI portal
Publication:6090500
DOI10.1111/itor.12764OpenAlexW2996882575WikidataQ126418948 ScholiaQ126418948MaRDI QIDQ6090500
Mohammad M. Aldurgam, Sameh Al-Shihabi
Publication date: 17 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12764
Cites Work
- Project scheduling with finite or infinite number of activity processing modes -- a survey
- Bi-objective resource-constrained project scheduling with robustness and makespan criteria
- A survey of variants and extensions of the resource-constrained project scheduling problem
- PSPLIB -- a project scheduling problem library
- A lexicographic approach to the robust resource-constrained project scheduling problem
- Critical-Path Planning and Scheduling: Mathematical Basis
- Critical path planning under uncertainty
- A Dynamic Programming Solution to Cost-Time Tradeoff for CPM
- Solving the Project Time/Cost Tradeoff Problem Using the Minimal Cut Concept
- Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
- A Stochastic Branch-and-Bound Approach to Activity Crashing in Project Management
- A multi‐agent system for the decentralized resource‐constrained multi‐project scheduling problem
- Cash Flows in Networks
- A Simple CPM Time-Cost Tradeoff Algorithm
- Project Scheduling with Discounted Cash Flows and Progress Payments
- Integrated time–cost tradeoff and resources leveling problems with allowed activity splitting
- Multi‐mode resource‐constrained project scheduling using modified variable neighborhood search heuristic
This page was built for publication: The contractor time–cost–credit trade‐off problem: integer programming model, heuristic solution, and business insights
