Quantum annealing to solve the unrelated parallel machine scheduling problem (Q6135480)
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: Quantum annealing to solve the unrelated parallel machine scheduling problem |
scientific article; zbMATH DE number 7731611
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Quantum annealing to solve the unrelated parallel machine scheduling problem |
scientific article; zbMATH DE number 7731611 |
Statements
Quantum annealing to solve the unrelated parallel machine scheduling problem (English)
0 references
25 August 2023
0 references
adiabatic quantum computing
0 references
quadratic unconstrained binary optimisation
0 references
scheduling on unrelated parallel machines problem
0 references
0 references
0.8070235848426819
0 references
0.7701315879821777
0 references
0.7642010450363159
0 references
0.7608502507209778
0 references
0.7577604055404663
0 references
