Determination of the Lower Bounds of the Goal Function for a Single-Machine Scheduling Problem on D-Wave Quantum Annealer.
Wojciech BozejkoJaroslaw PemperaMariusz UchronskiMieczyslaw WodeckiPublished in: ICCS (5) (2023)
Keyphrases
- single machine scheduling problem
- lower bound
- branch and bound algorithm
- lagrangian relaxation
- upper bound
- weighted tardiness
- release dates
- single machine
- branch and bound
- np hard
- objective function
- worst case
- sequence dependent setup times
- processing times
- lower and upper bounds
- precedence constraints
- setup times
- hybrid algorithm
- search procedure
- resource consumption