Minimizing mean tardiness subject to unspecified minimum number tardy for a single machine (Q1266653)
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 1208586
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing mean tardiness subject to unspecified minimum number tardy for a single machine |
scientific article; zbMATH DE number 1208586 |
Statements
Minimizing mean tardiness subject to unspecified minimum number tardy for a single machine (English)
0 references
18 March 1999
0 references
hybrid branch-and-bound
0 references
mean tardiness
0 references
single machine problem
0 references
minimum number of tardy jobs
0 references
0 references
0 references
0.8451835513114929
0 references
0.8379148244857788
0 references
0.8376170992851257
0 references
0.8372484445571899
0 references
