AN ITERATIVE SET-COVERING PROCEDURE FOR ASSIGNING EMERGENCY PROJECT TASKS

ABSTRACT

This paper presents an iterative set-covering procedure for the NP-hard problem of assigning emergency project tasks to project team members so that the project may be completed in minimum time. The procedure begins with an initial assignment of all tasks to project team members. Then each team member is asked to submit one minimum-time schedule of work that covers at least the team member's assigned tasks. This results in an initial set-cover of all project tasks in an obvious manner. Next this procedure uses a time-directed probe to generate new requests for work schedule revisions which may lead to an improved set-cover. That cycle for obtaining an improved set-cover is repeated until further improvements are not possible or until project planning time is exhausted. This procedure may be implemented manually for emergency projects that are not large-scale. A numerical illustration is given.

Keywords:

• emergency project
• set-covering procedure