A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems (Q2029256)
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 7354500
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems |
scientific article; zbMATH DE number 7354500 |
Statements
A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems (English)
0 references
3 June 2021
0 references
non-permutation flow shop scheduling problem
0 references
makespan
0 references
critical path
0 references
unknown processing times
0 references
structural and dominance properties
0 references
0 references
0 references
0 references
0 references
0.8338882923126221
0 references
0.8251794576644897
0 references
0.8026303052902222
0 references
0.8009878396987915
0 references
0.7936840653419495
0 references
