On the complexity of non-preemptive shop scheduling with two jobs (Q1849563)
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 1837286
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of non-preemptive shop scheduling with two jobs |
scientific article; zbMATH DE number 1837286 |
Statements
On the complexity of non-preemptive shop scheduling with two jobs (English)
0 references
1 December 2002
0 references
mixed shop scheduling
0 references
computational complexity
0 references
pseudo-polynomial time algorithm
0 references
0.8801189064979553
0 references
0.8764331936836243
0 references
0.8626397252082825
0 references
0.8612045049667358
0 references
