| Article ID: | iaor1995712 |
| Country: | Czech Republic |
| Volume: | 2 |
| Issue: | 4 |
| Start Page Number: | 319 |
| End Page Number: | 324 |
| Publication Date: | Oct 1993 |
| Journal: | Central European Journal of Operations Research |
| Authors: | Kas Peter |
The well-known model of critical path time analysis is considered in this paper. A feasibility theorem and its algorithmic proof is presented for the case when external lower and upper bounds are imposed on the earliest starting and latest finishing times of the activities.