In this note, the problem of divisible activities in critical path analysis is shown to be a special case of the classical cost-time project scheduling problem.
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.