Year-end Sale % OFF 
Abstract
We consider the problem of uniform allocation according to the minimax criterion of a non-renewable resource of an innovative project's activities. A lexicographic method is used for ordering these minimax criteria To solve the problem - one objective function - developed a greedy heuristic for finding the maximum path on an acyclic digraph with double weights on arcs. The greedy heuristic gives approximate solution of the problem mentioned. The obtained solution allows building a project resources plan and schedule with four types of temporary slacks with inaccurate initial data. The proposed approach allows performing an analysis of the project Risk of Performance parameter, for which has not developed the apparatus for its analysis. These include the risks that the project when complete fails to perform as intended or fails to meet the mission or business requirements that generated the justification for the project. Performance risks are estimated on the probability distribution function of a favorable/unfavorable outcome. Proposed lexicographic disintegration is a decomposition procedure and is suitable for planning and scheduling large-scale projects. Practical calculations for the convex problem in the initial statement may be performed with the help of ready-made software, and the obtained greedy solution of the problem-consequence has theoretical significance in graph theory.
Paper version not known (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
