Minimizing the number of late jobs on unrelated machines (Q811339)
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 4215664
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing the number of late jobs on unrelated machines |
scientific article; zbMATH DE number 4215664 |
Statements
Minimizing the number of late jobs on unrelated machines (English)
0 references
1991
0 references
preemptive scheduling
0 references
due date
0 references
independent jobs with release times
0 references
unrelated machines
0 references
number of late jobs
0 references
strong NP-hardness
0 references
0.8961580991744995
0 references
0.8583435416221619
0 references
0.8389089107513428
0 references
