Log in

www.springer.com The European Mathematical Society

Tools

View source for Makespan

Jump to: navigation, search

You do not have permission to edit this page, for the following reasons:

The action you have requested is limited to users in the group: Users.
You must confirm your email address before editing pages. Please set and validate your email address through your user preferences.

You can view and copy the source of this page.

A term from [[Scheduling theory|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|Scheduling theory]].

Return to Makespan.

How to Cite This Entry:
Makespan. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Makespan&oldid=17079

This article was adapted from an original article by M. Hazewinkel (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article

Retrieved from "https://encyclopediaofmath.org/wiki/Makespan"