Difference between revisions of "Makespan"
From Encyclopedia of Mathematics
(Importing text file) |
m (link) |
||
| Line 1: | Line 1: | ||
| − | 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 | + | 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]]. | See also [[Scheduling theory|Scheduling theory]]. | ||
Latest revision as of 12:27, 17 February 2021
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.
How to Cite This Entry:
Makespan. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Makespan&oldid=51597
Makespan. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Makespan&oldid=51597
This article was adapted from an original article by M. Hazewinkel (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article