Pages that link to "Item:Q806667"
From MaRDI portal
The following pages link to Bounds for nonpreemptive scheduling of jobs with similar processing times on multiprocessor systems using the LPT-algorithm (Q806667):
Displaying 8 items.
- Performance of the LPT algorithm in multiprocessor scheduling (Q583889) (← links)
- List scheduling for jobs with arbitrary release times and similar lengths (Q954249) (← links)
- The exact LPT-bound for maximizing the minimum completion time (Q1196214) (← links)
- The optimal on-line parallel machine scheduling (Q1568731) (← links)
- An LPT-bound for a parallel multiprocessor scheduling problem (Q1910052) (← links)
- An improved LS algorithm for the problem of scheduling multi groups of jobs on multi processors at the same speed (Q2867376) (← links)
- (Q3095030) (← links)
- A variation of Graham's LPT-algorithm (Q3989473) (← links)