Subscribe Now Subscribe Today
Science Alert
 
Blue
   
Curve Top
Journal of Applied Sciences
  Year: 2008 | Volume: 8 | Issue: 9 | Page No.: 1651-1659
DOI: 10.3923/jas.2008.1651.1659
 
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

An Algorithm for the Weighted Earliness-Tardiness Unconstrained Project Scheduling Problem

Behrouz Afshar Nadjafi and Shahram Shadrokh

Abstract:
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.
PDF Fulltext XML References Citation Report Citation
 RELATED ARTICLES:
  •    The Scheduling Problem of Active Critical Chain Method
How to cite this article:

Behrouz Afshar Nadjafi and Shahram Shadrokh, 2008. An Algorithm for the Weighted Earliness-Tardiness Unconstrained Project Scheduling Problem. Journal of Applied Sciences, 8: 1651-1659.

DOI: 10.3923/jas.2008.1651.1659

URL: https://scialert.net/abstract/?doi=jas.2008.1651.1659

COMMENT ON THIS PAPER
 
 
 

 

 
 
 
 
 
 
 
 
 

 
 
 
 
 
 
 

Curve Bottom