Generating all efficient solutions of a rescheduling problem on unrelated parallel machines (Q3055296): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q58644694, #quickstatements; #temporary_batch_1704809102140 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:46, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generating all efficient solutions of a rescheduling problem on unrelated parallel machines |
scientific article |
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
