Quantum annealing-driven branch and bound for the single machine total weighted number of tardy jobs scheduling problem.
Wojciech BozejkoJaroslaw PemperaMariusz UchronskiMieczyslaw WodeckiPublished in: Future Gener. Comput. Syst. (2024)
Keyphrases
- single machine
- branch and bound
- weighted number of tardy jobs
- scheduling problem
- release times
- lower bound
- completion times
- branch and bound algorithm
- np hard
- search algorithm
- processing times
- total tardiness
- optimal solution
- maximum lateness
- upper bound
- total weighted tardiness
- earliness tardiness
- job processing times
- combinatorial optimization
- column generation
- search space
- flowshop
- simulated annealing
- setup times
- release dates
- sequence dependent setup times
- scheduling jobs
- weighted tardiness
- production scheduling
- precedence constraints
- tabu search
- makespan minimization
- parallel machines
- high multiplicity
- flexible manufacturing systems
- job shop scheduling problem
- approximation algorithms
- evolutionary algorithm