Keywords

#longest-processing-time-first_scheduling

Longest-processing-time-first scheduling

Algorithm for job scheduling

Longest-processing-time-first (LPT) is a greedy algorithm for job scheduling. The input to the algorithm is a set of jobs, each of which has a specific processing-time. There is also a number m specifying the number of machines that can process the jobs. The LPT algorithm works as follows:Order the jobs by descending order of their processing-time, such that the job with the longest processing time is first. Schedule each job in this sequence into a machine in which the current load is smallest.

Tue 23rd

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Longest-processing-time-first scheduling List scheduling LPT (disambiguation) Scheduling (computing) Earliest deadline first scheduling Round-robin scheduling Optimal job scheduling Rate-monotonic scheduling Critical path method Identical-machines scheduling
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.