A term from scheduling theory (flow shop problems). The makespan is the completion time of the last job. For general scheduling problems, the problem of minimizing the makespan is as hard to solve as the travelling salesman problem.
See also Scheduling theory.
Makespan. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Makespan&oldid=51597