New computational results on the discrete time/cost trade-off problem in project networks
We describe a new exact procedure for the discrete time/cost trade-off problem in deterministic activity-on-the-arc networks of the CPM type, where the duration of each activity is a discrete, nonincreasing function of the amount of a single resource (money) committed to it. The objective is to cons...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Institutional Knowledge at Singapore Management University
1998
|
| Subjects: | |
| Online Access: | https://ink.library.smu.edu.sg/lkcsb_research/6739 https://ink.library.smu.edu.sg/context/lkcsb_research/article/7766/viewcontent/New_computational_results_on_the_discrete_time_cost_trade_off_problem_in_project_networks.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Singapore Management University |
| Language: | English |