Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem (Q1962067)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem |
scientific article; zbMATH DE number 1395032
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem |
scientific article; zbMATH DE number 1395032 |
Statements
Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem (English)
0 references
30 January 2000
0 references
job-shop
0 references
\(NP\)-hard problem
0 references
pseudo-polynomial algorithm
0 references
0 references
0 references
0.9177903
0 references
0.91036785
0 references
0.9057828
0 references
0 references
0.8993292
0 references
0.8988488
0 references
0.89704335
0 references
0.8969264
0 references
0.89605796
0 references
