Using a variable neighborhood search to solve a bi-objective identical parallel machine scheduling problem (Q1791932)
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: Using a variable neighborhood search to solve a bi-objective identical parallel machine scheduling problem |
scientific article; zbMATH DE number 6951753
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using a variable neighborhood search to solve a bi-objective identical parallel machine scheduling problem |
scientific article; zbMATH DE number 6951753 |
Statements
Using a variable neighborhood search to solve a bi-objective identical parallel machine scheduling problem (English)
0 references
11 October 2018
0 references
variable neighborhood search
0 references
parallel machines
0 references
makespan
0 references
flow time
0 references
0 references
0.8348380327224731
0 references
0.8196641802787781
0 references
0.8079598546028137
0 references
0.8047910928726196
0 references
