English, Article, Journal or magazine article edition: THE DISCRETE TIME/COST TRADE-OFF PROBLEM UNDER VARIOUS ASSUMPTIONS EXACT AND HEURISTIC PROCEDURES M. VANHOUCKE; D. DEBELS

User activity

Share to:
 
Bookmark: http://trove.nla.gov.au/version/14659
Physical Description
  • preprint
Language
  • English

Edition details

Title
  • THE DISCRETE TIME/​COST TRADE-OFF PROBLEM UNDER VARIOUS ASSUMPTIONS EXACT AND HEURISTIC PROCEDURES
Author
  • M. VANHOUCKE
  • D. DEBELS
Physical Description
  • preprint
Notes
  • Time/​cost trade-offs in project networks have been the subject of extensive research since the development of the critical path method (CPM) in the late 50s. Time/​cost behaviour in a project activity basically describes the trade-off between the duration of the activity and its amount of non-renewable resources (e.g. money) committed to it. In the discrete version of the problem (the discrete time/​cost trade-off problem), it is generally accepted that the trade-off follows a discrete non-increasing pattern, i.e. expediting an activity is possible by allocating more resources (i.e. at a larger cost) to it. However, due to its complexity (the problem is known to be NP hard (see De et al. (1997)), the problem has been solved for relatively small instances. In this paper, we elaborate on three extensions of the well-known discrete time/​cost trade-off problem in order to cope with more realistic settings: time/​switch constraints, work continuity constraints and net present value maximization. We give an extensive literature overview of existing procedures for these problem types, and present an exact solution approach for the work continuity version, which is not being investigated yet. Moreover, we discuss a new meta-heuristic approach in order to provide near-optimal heuristic solutions for the different problems. We present computational results for the problems under study by comparing the results for both exact and heuristic procedures. We demonstrate that the heuristic algorithms produce consistently good results for two versions of the discrete time/​cost trade-off problem.
  • RePEc:rug:rugwps:05/​314
Language
  • English
Contributed by
OAIster

Get this edition

Other links

  • Set up My libraries

    How do I set up "My libraries"?

    In order to set up a list of libraries that you have access to, you must first login or sign up. Then set up a personal list of libraries from your profile page by clicking on your user name at the top right of any screen.

  • All (1)
  • Unknown (1)
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.

User activity


e.g. test cricket, Perth (WA), "Parkes, Henry"

Separate different tags with a comma. To include a comma in your tag, surround the tag with double quotes.

Be the first to add a tag for this edition

Be the first to add this to a list

Comments and reviews

What are comments? Add a comment

No user comments or reviews for this version

Add a comment