On non-permutation solutions to some two machine flow shop scheduling problems (Q4300604)
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 614186
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On non-permutation solutions to some two machine flow shop scheduling problems |
scientific article; zbMATH DE number 614186 |
Statements
On non-permutation solutions to some two machine flow shop scheduling problems (English)
0 references
15 August 1994
0 references
two machine flow shop scheduling
0 references
permutation schedule
0 references
NP-hard
0 references
finite storage capacity
0 references
0 references
0 references
0.9008811116218568
0 references
0.8967433571815491
0 references
0.878290593624115
0 references
0.8689345717430115
0 references
0.8648388981819153
0 references
