Generating all efficient solutions of a rescheduling problem on unrelated parallel machines (Q3055296)
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: Generating all efficient solutions of a rescheduling problem on unrelated parallel machines |
scientific article; zbMATH DE number 5813218
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generating all efficient solutions of a rescheduling problem on unrelated parallel machines |
scientific article; zbMATH DE number 5813218 |
Statements
Generating all efficient solutions of a rescheduling problem on unrelated parallel machines (English)
0 references
7 November 2010
0 references
rescheduling
0 references
efficient solutions
0 references
branch and bound algorithm
0 references
0.8371140360832214
0 references
0.7857475280761719
0 references
0.7830060124397278
0 references
0.7606604695320129
0 references
0.7601242065429688
0 references
