A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements (Q2230732)
From MaRDI portal
!
WARNING
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 7402301
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements |
scientific article; zbMATH DE number 7402301 |
Statements
A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements (English)
0 references
28 September 2021
0 references
computational complexity
0 references
flow shop
0 references
buffer
0 references
polynomial-time algorithms
0 references
resource constrained scheduling
0 references
0 references
0 references
0 references
0 references
0.871935248374939
0 references
0.8183179497718811
0 references
0.7850608825683594
0 references
0.7814170122146606
0 references
0.7763533592224121
0 references
