A local search using solution fragments for the 2-machine bicriteria scheduling problem (Q2643628)
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: A local search using solution fragments for the 2-machine bicriteria scheduling problem |
scientific article; zbMATH DE number 5182955
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A local search using solution fragments for the 2-machine bicriteria scheduling problem |
scientific article; zbMATH DE number 5182955 |
Statements
A local search using solution fragments for the 2-machine bicriteria scheduling problem (English)
0 references
27 August 2007
0 references
Local search
0 references
Bicriteria flowshop scheduling
0 references
0.7760765552520752
0 references
0.773752748966217
0 references
0.7727260589599609
0 references
0.7623207569122314
0 references
