A stronger complexity result for the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs (Q2464405)
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 5221917
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A stronger complexity result for the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs |
scientific article; zbMATH DE number 5221917 |
Statements
A stronger complexity result for the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs (English)
0 references
20 December 2007
0 references
0.8968902826309204
0 references
0.8394501805305481
0 references
0.838525116443634
0 references
0.8367417454719543
0 references
0.8321390151977539
0 references
