首页|Patent Application Titled "Scheduling Project Activities Using Twin Computing Si mulation" Published Online (USPTO 20240161032)
Patent Application Titled "Scheduling Project Activities Using Twin Computing Si mulation" Published Online (USPTO 20240161032)
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NETL
NSTL
By a News Reporter-Staff News Editor at Robotics & Machine Learning Daily News Daily News-According to news reporting originatin g from Washington, D.C., by NewsRx journalists, a patent application by the inve ntors Dhoot, Akash U. (Pune, IN); Moyal, Shailendra (Pune, IN); Rakshit, Sarbaji t K. (Kolkata, IN); Sharma, Nitika (Zirakpur, IN), filed on November 14, 2022, w as made available online on May 16, 2024. No assignee for this patent application has been made. Reporters obtained the following quote from the background information supplied by the inventors: "The present invention generally relates to computer modeling, and more particularly to resource utilization algorithms for scheduling a set o f project activities. "Critical path method (CPM) is a resource-utilization algorithm for scheduling a set of project activities. The essential technique for using CPM is to contract a model of the project that includes: (1) a list of all the tasks required to c omplete the task; (2) the dependencies between the tasks; and (3) the estimated of time (duration) that each activity will take to complete. With this informati on, you can determine the critical path by identifying the longest stretch of de pendent activities, and measuring them from start to finish. Once you have ident ified which activities are on the longest, or the critical path, you can more ea sily discern which have total float, or can be delayed without making the projec t longer.
NETL
NSTL
