A heuristic for maximizing the number of on-time jobs on two uniform parallel machines (Q3423282)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5129175
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A heuristic for maximizing the number of on-time jobs on two uniform parallel machines |
scientific article; zbMATH DE number 5129175 |
Statements
A heuristic for maximizing the number of on-time jobs on two uniform parallel machines (English)
0 references
20 February 2007
0 references
scheduling
0 references
uniform parallel machines
0 references
due dates
0 references
worst-case bounds
0 references
approximation algorithms
0 references
0.830758273601532
0 references
0.8297911286354065
0 references
0.8250055313110352
0 references
0.8245306015014648
0 references
0.8117341995239258
0 references
