Quantum annealing-driven branch and bound for the single machine total weighted number of tardy jobs scheduling problem
Wojciech Bożejko, Jarosław Pempera, Mariusz Uchroński, Mieczysław Wodecki
Topics & Concepts
Computer scienceScheduling (production processes)Simulated annealingQuantum annealingBranch and boundSingle-machine schedulingQuantumUpper and lower boundsMathematical optimizationParallel computingAlgorithmJob shop schedulingQuantum computerMathematicsScheduleOperating systemPhysicsMathematical analysisQuantum mechanicsScheduling and Optimization AlgorithmsOptimization and Search ProblemsOptimization and Packing Problems