A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights (Q1742901)
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 algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights |
scientific article; zbMATH DE number 6859034
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights |
scientific article; zbMATH DE number 6859034 |
Statements
A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights (English)
0 references
12 April 2018
0 references
permutation polyhedra
0 references
adjacency
0 references
dominance
0 references
local search
0 references
deteriorating jobs
0 references
relaxed agreeable weights
0 references
0 references
0 references
