An exact quantum annealing-driven branch and bound algorithm for maximizing the total weighted number of on-time jobs on a single machine (Q6619607)
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: An exact quantum annealing-driven branch and bound algorithm for maximizing the total weighted number of on-time jobs on a single machine |
scientific article; zbMATH DE number 7927044
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exact quantum annealing-driven branch and bound algorithm for maximizing the total weighted number of on-time jobs on a single machine |
scientific article; zbMATH DE number 7927044 |
Statements
An exact quantum annealing-driven branch and bound algorithm for maximizing the total weighted number of on-time jobs on a single machine (English)
0 references
16 October 2024
0 references
scheduling
0 references
quantum machine
0 references
optimization
0 references
0 references
0 references
0 references
