Hybrid Classical-Quantum Optimization Techniques for Solving Mixed-Integer Programming Problems in Production Scheduling
چکیده
Quantum computing (QC) holds great promise to open up a new era of and has been receiving significant attention recently. To overcome the performance limitations near-term QC, utilizing current quantum computers complement classical techniques for solving real-world problems is utmost importance. In this paper, we develop QC-based solution strategies that exploit annealing optimization large-scale scheduling in manufacturing systems. The applications proposed algorithms are illustrated through two case studies production scheduling. First, present hybrid approach job-shop problem. Second, propose parametric method multi-purpose batch problem with fractional objective. can tackle formulated as mixed-integer linear programs, respectively, provide feasibility guarantees. Performance comparison between state-of-the-art exact heuristic solvers presented both problems. Unlike conventional techniques, frameworks harness supplement established deterministic demonstrate efficiency over standard off-the-shelf solvers.