Productivity scheduling method with maximum constraints

This research investigates maximum constraints for linear scheduling via a mathematical model. Maximum constraints are improperly ignored by most current scheduling techniques, especially for linear schedules. However, they can have substantial practical relevance, e.g. to express safety constraints. Therefore the goal is to renew awareness of this type and enable its application to linear schedules with activities of constant productivity. The methodology includes a literature review, followed by an algorithm that relies upon singularity functions. Its first two steps refer to the existing Productivity Scheduling Method, which is extended with mathematical steps to handle maximum constraints correctly. For validation the new algorithm is applied to a schedule example with different scenarios and its peculiarities are discussed. Being able to incorporate maximum constraints will provide project managers with more realistic schedules.