Treffer: A New Project Scheduling Problem with Worker-Dependent Durations.

In this paper, we introduce a new project scheduling problem with multiple milestones and completely ordered activities. The characteristic of our problem lies in the activity durations, which are determined by the unique attributes of each activity and the worker assigned to it. The objective is to identify the optimal assignment of workers to activities that minimizes the weighted number of tardy activities. We show that the problem is strongly NP-hard by reducing it from the 3-partition problem even for two cases with a special structure of durations. Furthermore, we identify two cases that can be solved in polynomial time. [ABSTRACT FROM AUTHOR]

Copyright of Asia-Pacific Journal of Operational Research is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)