An Exact Quantum Annealing-Driven Branch and Bound Algorithm for Maximizing the Total Weighted Number of on-Time Jobs on a Single Machine
- 14 June 2023
- book chapter
- Published by Springer Nature
- p. 79-89
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejectionJournal of Scheduling, 2022
- Distributed Quantum Annealing on D-Wave for the Single Machine Total Weighted Tardiness Scheduling Problem2022
- Minimizing the weighted number of tardy jobs on a single machine: Strongly correlated instancesEuropean Journal of Operational Research, 2022
- Single machine scheduling to maximize the weighted number of on-time jobs with job-rejectionOperational Research, 2021
- Single machine scheduling to maximize the number of on-time jobs with generalized due-datesJournal of Scheduling, 2020
- Maximizing the weighted number of on-time jobs in single machine scheduling with time windowsMathematical and Computer Modelling, 1997
- Minimizing Total Costs in One-Machine SchedulingOperations Research, 1975
- Reducibility among Combinatorial Problems1972