English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The issue of resource over-allocating is a big concern for project engineers in the process of scheduling project activities. Resource over-allocating is frequently seen after initial scheduling of a project in practice and causes significant amount of efforts to modify the initial schedules. In this research, a new method is developed for modifying over-allocated schedules in a multi-mode resource constrained project scheduling problems (MRCPSPs) with positive cash flows (MRCPSP-PCF). The aim is to maximize profit of the MRCPSPs or logically minimizing costs. The proposed method can be used as a macro in Microsoft Office Project® Software to modify resource over-allocated days after scheduling a project. This research considers progress payment method and preemptive resources. The proposed approach maximizes profit by scheduling activities through the resource calendar respecting to the available level of preemptive resources and activity numbers. To examine the performance of the proposed method a number of experiments derived from the literature are solved. The results are then compared with the circumstances where resource constraints are relaxed. The outcomes show that in all studied cases, the proposed algorithm can provide modified schedules with no over-allocated days. Afterward the method is applied to modify a manufacturing project in practice.\ud\u

Developing a new method for modifying over-allocated multi-mode resource constraint schedules in the presence of preemptive resources