ConceptLongest Processing Time first / 最长处理时间优先
LPT
A classical heuristic for multi-machine scheduling. It sorts jobs in descending order of processing time and assigns each in turn to the currently least loaded machine, yielding a makespan close to optimal, with a theoretical approximation ratio of 4/3.
Timeline (last 90 days)
Nov 5
LPT (longest processing time first) is a classic multi-machine scheduling heuristic with a theoretical 4/3 approximation ratio guarantee.
Unverified50%