A modified LPT algorithm for the two uniform parallel machine makespan minimization problem (Q2378450): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Optimal non-preemptive semi-online scheduling on two related machines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bounds for LPT Schedules on Uniform Processors / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A heuristic for maximizing the number of on-time jobs on two uniform parallel machines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An improved delayed-start LPT algorithm for a partition problem on two identical parallel machines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines / rank | |||
Normal rank | |||
Revision as of 22:26, 28 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A modified LPT algorithm for the two uniform parallel machine makespan minimization problem |
scientific article |
Statements
A modified LPT algorithm for the two uniform parallel machine makespan minimization problem (English)
0 references
8 January 2009
0 references
scheduling
0 references
uniform parallel machines
0 references
LPT
0 references
approximation algorithms
0 references
0 references
