Solution of the NP-hard total tardiness minimization problem in scheduling theory (Q5438152)
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 5229286
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solution of the NP-hard total tardiness minimization problem in scheduling theory |
scientific article; zbMATH DE number 5229286 |
Statements
Solution of the NP-hard total tardiness minimization problem in scheduling theory (English)
0 references
22 January 2008
0 references
scheduling theory
0 references
one machine
0 references
minimization of total tardiness
0 references
pseudopolynomial algorithms
0 references
0.911160945892334
0 references
0.870418131351471
0 references
0.8620336651802063
0 references
0.8551958203315735
0 references
0.8539961576461792
0 references
