Project scheduling with calendars |
| |
Authors: | Birger Franck Klaus Neumann Christoph Schwindt |
| |
Affiliation: | (1) Institut für Wirtschaftstheorie und Operations Research, University of Karlsruhe, 76128 Karlsruhe, Germany (e-mail: {franck,neumann,schwindt}@wior.uni-karlsruhe.de) , DE |
| |
Abstract: | For many applications of project scheduling to real-life problems, it is necessary to take into account calendars specifying
time intervals during which some resources such as manpower or machines are not available. Whereas the execution of certain
activities like packaging may be suspended during breaks, other activities cannot be interrupted due to technical reasons.
Minimum and maximum time lags between activities may depend on calendars, too. In this paper, we address the problem of scheduling
the activities of a project subject to calendar constraints. We devise efficient algorithms for computing earliest and latest
start and completion times of activities. Moreover, we sketch how to use these algorithms for developing priority-rule methods
coping with renewable-resource constraints and calendars.
Received: July 26, 2000 / Accepted: May 15, 2001 |
| |
Keywords: | : Project scheduling-calendars – Minimum and maximum time lags – Priority-rule methods |
本文献已被 SpringerLink 等数据库收录! |
|