A job shop distributed scheduling based on Lagrangian relaxation to minimise total completion time (Q3055211)
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 job shop distributed scheduling based on Lagrangian relaxation to minimise total completion time |
scientific article; zbMATH DE number 5813153
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A job shop distributed scheduling based on Lagrangian relaxation to minimise total completion time |
scientific article; zbMATH DE number 5813153 |
Statements
A job shop distributed scheduling based on Lagrangian relaxation to minimise total completion time (English)
0 references
7 November 2010
0 references
job shop scheduling
0 references
cooperation
0 references
Lagrangian relaxation
0 references
0 references
0 references
0.7537585496902466
0 references
0.7396013140678406
0 references
0.7385574579238892
0 references
0.7369369268417358
0 references
0.734748363494873
0 references
