Project Scheduling under Time Dependent Costs - A Branch and Bound Algorithm

Annals of Operations Research

Volumn 108, Issue 1-4, 2001, Pages 55-74

  Achuthan, N R ^a   Hardjawidjaja, A ^a  

^a CURTIN UNIVERSITY   (Australia)

Author keywords

Branch and bound; Project compression; Project scheduling

Indexed keywords

EID: 0035742360     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/A:1016046625583     Document Type: Article

References (10)

1. N.R. Achuthan and A. Hardjawidjaja, Project crashing under time dependent costs, in: Proceedings of the 12th National Conference of ASOR, Adelaide (1993) pp. 163-176.
2. E. Demeulemeester, B. Dodin and W.S. Herroelen, A random activity network generator, Operations Research 41 (1993) 972-980.
3. S.E. Elmaghraby and W.S. Herroelen, The scheduling of activities to maximize the net present value of projects, European Journal of Operational Research 49 (1990) 35-49.
4. S.E. Elmaghraby and P.S. Pulat, Optimal project compression with due-date events, Naval Research Logistics Quarterly 26 (1979) 331-348.
5. S.S. Erenguc, S. Tufekci and C.J. Zappe, Solving time/cost trade-off problems with discounted cash flows using generalised benders decomposition, Naval Research Logistics Quarterly 40 (1993) 25-50.
6. A. Hardjawidjaja, Project scheduling methods, Ph.D. thesis, Curtin University of Technology, Perth, Western Australia (1995).
7. J.K. Jolayemi and A.E. Oluleye, Scheduling of projects under the condition of inflation, OMEGA 21 (1993) 481-487.
8. J.E. Kelly and M.R. Walker, Critical Path Planning and Scheduling: An Introduction (Mauchly, 1959).
9. G. Polla, Project scheduling under tardiness and earliness penalties, M.Sc. Thesis, Curtin University of Technology, Western Australia (1990).
10. A.H. Russell, Cash flows in networks, Management Science 16 (1970) 357-373.