A method of analysis aimed to schedule a set of tasks so that they are all completed in the shortest possible overall time. The difficulty is that the various tasks take different lengths of time to complete and that each task cannot be started until certain prerequisite other tasks have been completed. See also network flow problem.




