Changes between Version 81 and Version 82 of ProjectManagementIdeas


Ignore:
Timestamp:
Jul 14, 2009 4:05:03 PM (5 years ago)
Author:
ChrisNelson
Comment:

Refine research notes

Legend:

Unmodified
Added
Removed
Modified
  • ProjectManagementIdeas

    v81 v82  
    451451=== Related research === 
    452452 
    453 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. 
     453Scheduling 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].   
     454 
     455There are several variations on the problem. 
    454456 
    455457 ''RCPSP'' :: Resource-Constrained Project Scheduling Problem 
     
    465467 * Heuristic approximations. Attempts to find a good solution in reasonable time for a realistic number of tasks (e.g., hundreds). 
    466468 
    467  * Metaheuristics.  More abstract approaches such as genetic algorithms, simulated annealing, ant colony optimization, and particle swarm optimization. 
    468  
    469 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. 
     469 * Metaheuristics.  More abstract approaches such as genetic algorithms, tabu search, simulated annealing, ant colony optimization, and particle swarm optimization. 
     470 
     471All 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. 
     472 
     473[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. 
     474 
    470475 
    471476----