| Article ID: | iaor1993514 |
| Country: | Germany |
| Volume: | 36 |
| Start Page Number: | 423 |
| End Page Number: | 438 |
| Publication Date: | Mar 1992 |
| Journal: | Mathematical Methods of Operations Research (Heidelberg) |
| Authors: | Zhan J. |
| Keywords: | scheduling |
A calendar contains working days and non-working days. How to make time planning for a project, when some activities cannot be interrupted by non-working days or in some time distances between start times of activities also non-working days count, is a problem often to be faced when undertaking a project realization. In this paper an exact method to solve this problem is presented and the optimality of this method is proved.