An exact quantum annealing-driven branch and bound algorithm for maximizing the total weighted number of on-time jobs on a single machine
From MaRDI portal
Publication:6619607
DOI10.1007/978-3-031-35173-0_8MaRDI QIDQ6619607
Wojciech Bożejko, Mariusz Uchroński, Jaroslaw Pempera, Mieczyslaw Wodecki
Publication date: 16 October 2024
Cites Work
- Maximizing the weighted number of on-time jobs in single machine scheduling with time windows
- Minimizing the weighted number of tardy jobs on a single machine: strongly correlated instances
- Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey
- Minimizing Total Costs in One-Machine Scheduling
- Reducibility among Combinatorial Problems
- Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection
This page was built for publication: An exact quantum annealing-driven branch and bound algorithm for maximizing the total weighted number of on-time jobs on a single machine
