Longest-processing-time-first scheduling
id:
longest-processing-time-first-scheduling-278-12857995
title:
Longest-processing-time-first scheduling
text:
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
brand slug:
wiki
category slug:
encyclopedia
description:
Algorithm for job scheduling
original url:
https://en.wikipedia.org/wiki/Longest-processing-time-first_scheduling
date created:
date modified:
2024-04-23T00:30:58Z
main entity:
{"identifier":"Q109297361","url":"https://www.wikidata.org/entity/Q109297361"}
image:
fields total:
13
integrity:
14