The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times (Q905364)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times |
scientific article; zbMATH DE number 6532816
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times |
scientific article; zbMATH DE number 6532816 |
Statements
The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times (English)
0 references
19 January 2016
0 references
scheduling
0 references
learning
0 references
aging
0 references
deteriorating
0 references
flowshop
0 references
computational complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9150662422180176
0 references
0.8684676885604858
0 references
0.8325775265693665
0 references
0.8209823966026306
0 references
