Minimizing the number of late jobs under the group technology assumption (Q1304380)
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 1339724
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing the number of late jobs under the group technology assumption |
scientific article; zbMATH DE number 1339724 |
Statements
Minimizing the number of late jobs under the group technology assumption (English)
0 references
22 September 1999
0 references
one-machine scheduling
0 references
number of late jobs
0 references
group technology assumption
0 references
polynomial time algorithm
0 references
0.8395298719406128
0 references
0.8305901288986206
0 references
0.8296966552734375
0 references
