Changes between Version 81 and Version 82 of ProjectManagementIdeas

Timestamp:

Jul 14, 2009, 2:05:03 PM (15 years ago)

Author:

Chris Nelson

Comment:

Refine research notes

ProjectManagementIdeas

@@ -451 +451 @@
 === Related research ===
 
-Scheduling activities in a project is an area of active research in operational research (or operations research, [http://en.wikipedia.org/wiki/Operations_research OR]) and has been established to be [http://en.wikipedia.org/wiki/NP-hard NP hard].  There are several variations on the problem.
+Scheduling activities in a project is an area of active research in operational research (or operations research, [http://en.wikipedia.org/wiki/Operations_research OR]) (cf. [http://books.google.com/books?id=pHetPl2LOYgC&lpg=PA153&ots=rKKZ7Lv2On&dq=pslib%20project%20scheduling&pg=PP1 Project Scheduling]) and has been established to be [http://en.wikipedia.org/wiki/NP-hard NP hard].  
+
+There are several variations on the problem.
 
  ''RCPSP'' :: Resource-Constrained Project Scheduling Problem
@@ -465 +467 @@
  * Heuristic approximations. Attempts to find a good solution in reasonable time for a realistic number of tasks (e.g., hundreds).
 
- * Metaheuristics.  More abstract approaches such as genetic algorithms, simulated annealing, ant colony optimization, and particle swarm optimization.
-
-All of these algorithmic approaches also have other dimensions such as the number of threads that are used, the method they use to prioritize activities, etc.  To be practical for implementation as a Trac plugin, it seems likely our implementation should not require heavy-weight, opaque abstractions or multiple threads.
+ * Metaheuristics.  More abstract approaches such as genetic algorithms, tabu search, simulated annealing, ant colony optimization, and particle swarm optimization.
+
+All of these algorithmic approaches also have other dimensions such as the number of threads that are used, the method they use to prioritize activities, etc.  To be practical for implementation as a Trac plugin, it seems likely our implementation should not require heavy-weight, opaque abstractions or multiple threads.  Furthermore, we desire an algorithm which can ''update'' a schedule as part of a ticket change listener rather than having to completely recompute a schedule for each, individual change.
+
+[http://129.187.106.231/psplib/ PSPLIB] provides a standard set of program scheduling problems to test the various algorithms performance against one another and the optimal solution.
+
 
 ----