Makespan minimization in reentrant flow shop problem with identical jobs (Q6573405)
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 7881845
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Makespan minimization in reentrant flow shop problem with identical jobs |
scientific article; zbMATH DE number 7881845 |
Statements
Makespan minimization in reentrant flow shop problem with identical jobs (English)
0 references
16 July 2024
0 references
schedule
0 references
identical jobs
0 references
NP-hardness
0 references
pseudopolynomial algorithm
0 references
theory of NP-completeness
0 references
0 references
0.845055341720581
0 references
0.8320412039756775
0 references
0.8204748034477234
0 references
0.8119305968284607
0 references
0.8074406385421753
0 references
