A modified LPT algorithm for the two uniform parallel machine makespan minimization problem (Q2378450): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ejor.2008.02.008 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.EJOR.2008.02.008 / rank | |||
Normal rank | |||
Latest revision as of 07:11, 18 December 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
