Loading...

An algorithm for the weighted earliness-tardiness unconstrained project scheduling problem

Afshar Nadjafi, B ; Sharif University of Technology | 2008

304 Viewed
  1. Type of Document: Article
  2. DOI: 10.3923/jas.2008.1651.1659
  3. Publisher: 2008
  4. Abstract:
  5. This research considers a project scheduling problem with the object of minimizing weighted earliness-tardiness penalty costs, taking into account a deadline for the project and precedence relations among the activities. An exact recursive method has been proposed for solving the basic form of this problem. We present a new depth-first branch and bound algorithm for extended form of the problem, which time value of money is taken into account by discounting the cash flows. The algorithm is extended with two bounding rules in order to reduce the size of the branch and bound tree. Finally, some test problems are solved and computational results are reported. © 2008 Asian Network for Scientific Information
  6. Keywords:
  7. Branch-and-bound algorithms ; Computational results ; Earliness-tardiness ; Net present value ; Precedence relations ; Project scheduling ; Project scheduling problem ; Time value of money ; Branch and bound method ; Linear programming ; Scheduling ; Algorithms
  8. Source: Journal of Applied Sciences ; Volume 8, Issue 9 , 2008 , Pages 1651-1659 ; 18125654 (ISSN)
  9. URL: https://scialert.net/abstract/?doi=jas.2008.1651.1659