Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach (Q1772848)
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: Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach |
scientific article; zbMATH DE number 2160300
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach |
scientific article; zbMATH DE number 2160300 |
Statements
Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach (English)
0 references
21 April 2005
0 references
Scheduling
0 references
Unrelated machines
0 references
Beam search
0 references
0 references
0 references
0 references
0.9028442
0 references
0.90036213
0 references
0.90036213
0 references
0.8969668
0 references
0.89070827
0 references
0.8881589
0 references
0.88451755
0 references
