Scheduling (computing)

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

In computer science, and combinatorial optimisation, the term scheduling usually refers to solutions of the problem that a plan needs to be made in what order and for how long a number of tasks run on a number of machines.