Project scheduling Update

1. A new paper looking at the origins of CPM has been uploaded to our PM-History page – http://www.mosaicprojects.com.au/Mag_Articles/P037_The_Origins_of_CPM.pdf looks at where the concepts that evolved into CPM and PERT originated. All of our papers can be found at: http://www.mosaicprojects.com.au/PM-History.html

2.  The PMI members’ only Scheduling Conference 2017 is going to be great! Over 17,000 people are registered already – I’m the last speaker for the day (which means I only have to get up at 6:00am Australian time to participate…..) More information see: https://www.projectmanagement.com/events/356123/PMI-Scheduling-Conference-2017  My topic looks at the effect of the data generated by BIM, drones and other technology on controls.

3.  PGCS Canberra is on in early May – too good to miss, see: http://www.pgcs.org.au/

Advertisements

3 responses to “Project scheduling Update

  1. Very well researched and nicely done, Pat!!! You really should apply for your PhD (“PhD by publication”) for the outstanding work you have done.

    If there are no Uni’s in Australia which will grant a PhD based on your published works, then SKEMA (Prof J. Rodney Turner et al) does so.

    BR,
    Dr. PDG, Jakarta, Indonesia

  2. Hi Pat,

    Your new article, “The origins of PERT and CPM” contains part of what I wrote on LinkedIn in December 2016 at at https://www.linkedin.com/pulse/some-similarity-between-critical-path-method-dynamic-prasad-velaga. That part is:

    DP is based on a principle called Bellman’s Principle of Optimality. DP can be applied to a variety of difficult optimization problems, but the use of DP is an art rather than science. The DP approach looks like sequential (dynamic) decision making that involves development of a model based on a recursive relationships such as: “Completion time of a task in a project is the task duration plus the maximum of completion times of its predecessors”. Using the DP approach (with a similar recursive relation), Edsger Dijkstra developed in 1956 an algorithm to find the shortest path between any two nodes in a directed network. The algorithm is known as Dijkstra’s algorithm. Using Dijkstra’s algorithm with a very small change in the underlying recursive relation, we can easily find the longest path in the precedence network of a project. This is exactly how CPM finds the longest path.

    It would be appropriate if you include the date of posting of your article in the article or you include my LinkedIn article in the list of references (for connection between DP and CPM). Otherwise, due to your reputation in project management, some people can easily assume in future that I copied some stuff from your article. I cannot tolerate such accusation being the original author of that part. I am sure you would understand my position.

    Best regards,

    Prasad Velaga, PhD
    Optisol
    College Station, TX 77845
    Tel: 979-690-8306 | Email: prasad@optisol.biz | URL: http://www.optisol.biz

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s