A heuristic for maximizing the number of on-time jobs on two uniform parallel machines (Q3423282)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A heuristic for maximizing the number of on-time jobs on two uniform parallel machines |
scientific article |
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
