Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption (Q1652150): Difference between revisions
From MaRDI portal
Latest revision as of 02:07, 16 July 2024
scientific article
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 |
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