Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption (Q1652150)
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: Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption |
scientific article; zbMATH DE number 6901334
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption |
scientific article; zbMATH DE number 6901334 |
Statements
Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption (English)
0 references
11 July 2018
0 references
blocking flow shop scheduling
0 references
multi-task flexibility
0 references
preemption
0 references
makespan
0 references
variable neighborhood search
0 references
0 references
0 references
0 references
0 references
0.9198213
0 references
0.90857476
0 references
0.89639556
0 references
0.8940737
0 references
0.88430923
0 references
0 references
0.8831576
0 references
