TITLE

Distributed Research Project Scheduling Based on Multi-Agent Methods

AUTHOR(S)
Bodea, Constanta-Nicoleta; Badea, Ileana Ruxandra; PurnuŞ, Augustin
PUB. DATE
June 2011
SOURCE
Journal of Applied Computer Science & Mathematics;2011, Issue 10, p20
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Different project planning and scheduling approaches have been developed. The Operational Research (OR) provides two major planning techniques: CPM (Critical Path Method) and PERT (Program Evaluation and Review Technique). Due to projects complexity and difficulty to use classical methods, new approaches were developed. Artificial Intelligence (AI) initially promoted the automatic planner concept, but model-based planning and scheduling methods emerged later on. The paper adresses the project scheduling optimization problem, when projects are seen as Complex Adaptive Systems (CAS). Taken into consideration two different approaches for project scheduling optimization: TCPSP (Time- Constrained Project Scheduling) and RCPSP (Resource- Constrained Project Scheduling), the paper focuses on a multiagent implementation in MATLAB for TCSP. Using the research project as a case study, the paper includes a comparison between two multi-agent methods: Genetic Algorithm (GA) and Ant Colony Algorithm (ACO).
ACCESSION #
69933595

 

Related Articles

  • A Job-Shop Scheduling Model of Software Development Planning for Constraint-based Local Search. Barba, Irene; del Valle, Carmelo // International Journal of Software Engineering & Its Applications;Oct2010, Vol. 4 Issue 4, p1 

    Software development planning usually does not take any advantage of planning and scheduling techniques involving reasoning about time and resources, which are typical in the manufacturing area. This paper proposes a constraint-based model for the Job Shop Scheduling Problem to be solved using...

  • The Application of: PRODUCTIVITY CRITERIA QUOTIENTS TO SCHEDULE DETERMINATIONS. Haspelmath, Charles E. // Industrial Management;Dec66, Vol. 8 Issue 12, p2 

    Discusses the significance of Program Evaluation and Review Technique (PERT) and Critical Path Method (CPM) for planning and scheduling activities of businesses. Definition of Productivity Criteria Quotient; Place of Productivity Criteria Quotient in the PERT and CPM scheme; Reasons behind...

  • FACTORS AFFECTING THE SUCCESSFUL APPLICATION OF PERT/CPM SYSTEMS IN A GOVERNMENT ORGANIZATION. Dane, C. W.; Gray, C. F.; Woodworth, B. M. // Interfaces;Nov79, Vol. 9 Issue 5, p94 

    PERT/CPM in project management scheduling systems is applied and used less frequently than the literature would seem to suggest. Eighteen almost-identical government units were studied to document a situation that appears to be ideally suited to PERT/CPM but where the success ratio was 4 out of...

  • PROGRAM EVALUATION AND REVIEW TECHNIQUE (PERT).  // Encyclopedia of Operations Research & Management Science;2001, p649 

    The article presents information on program evaluation and review technique. It is a method for planning and scheduling a project which models uncertainties in activity through the use of optimistic, likely and pessimistic time estimates for each activity.

  • Fuzzy Pert and its Application to Machine Installation Process. Ertugrul, �rfan; KarakasoGlu, N�lsen // Journal of Multiple-Valued Logic & Soft Computing;2009, Vol. 15 Issue 1, p65 

    Program Evaluation and Review Technique (PERT) is a well known method that helps managers plan, schedule, monitor, and control large and complex projects. In classical PERT activity durations are represented with crisp numbers. However, decision makers often have difficulty in estimating the...

  • STOCHASTIC BOUNDS ON DISTRIBUTIONS OF OPTIMAL VALUE FUNCTIONS WITH APPLICATIONS TO PERT, NETWORK FLOWS AND RELIABILITY. Weiss, Gideon // Annals of Operations Research;1984, Vol. 1 Issue 1-4, p59 

    In various network models the quantities of interest are optimal value functions of the form max Σ Xi, min max Xi, min max Xi, max min Xi, where the inner operation is on the nodes of a path/cut and the outer operation on all paths/cuts, e.g. shortest path of a project network, maximal flow...

  • Uncertainty in Project Scheduling--Its Use in PERT/CPM Conventional Techniques. Omar, Anwar // Cost Engineering;Jul2009, Vol. 51 Issue 7, p30 

    In this article, PERT/CPM, as conventional tools for planning and controlling are discussed along with problems accompanied with their application. This article demonstrates a number of benefits, the most significant among them being that: PERT/CPM as conventional planning techniques needs to be...

  • A new probabilistic approach to the path criticality in stochastic PERT. Monhor, Davaadorjin // Central European Journal of Operations Research;Dec2011, Vol. 19 Issue 4, p615 

    The notion of critical path is a key issue in the temporal analysis of project scheduling in deterministic setting. The very essence of the CPM consists in identifying the critical path, i.e., the longest path in a project network, because this path conveys information on how long it should take...

  • EXPECTED CRITICAL PATH LENGTHS IN PERT NETWORKS. Fulkerson, D.R. // Operations Research;Nov/Dec62, Vol. 10 Issue 6, p808 

    A method of obtaining a fairly good lower approximation to the expected duration time of a project whose individual job times are diserete random variables is described It is assumed that jobs that immediately precede any given job may have a joint distribution of times, with independence...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics