A method is presented for the construction of schedule networks on a rectangular lattice and for the solution of the resulting matrix in terms of the event times, slack, and critical path of the network. Some implications for the utilization of the technique are reviewed.
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.