EXPANDING JOB SHOP SCHEDULING PROBLEM TO THE CONTEXT OF SERVICE PRIORITIZATION

Vol 56, 2024 - 309688
Complete Articles (CA)
Favorite this paper
How to cite this paper?
Abstract

In the Brazilian Energy Sector, effective management of maintenance services is critical due to the high complexity and urgency variations of tasks. This challenge is known as Service Prioritization, and here, we extend the classical Job Shop Scheduling Problem (JSSP) to address it. Utilizing Adiabatic Quantum Computing and Exhaustive Classical approach, the extended JSSP formulation is evaluated, demonstrating its correctness and the potential of Quantum Computing to achieve efficient solutions. Results indicate that the Binary Quadratic Model solver performs comparably to classical exact solvers. Ultimately, this study marks a significant step towards integrating quantum technologies into the Brazilian Energy Sector, underscoring the potential benefits and areas for future exploration as quantum computing evolves.

Share your ideas or questions with the authors!

Did you know that the greatest stimulus in scientific and cultural development is curiosity? Leave your questions or suggestions to the author!

Sign in to interact

Have a question or suggestion? Share your feedback with the authors!

Institutions
  • 1 Cesar School
Track
  • 26. SS-QPO - Quantum Methods and their Applications in Operational Research
Keywords
Job Shop Scheduling
Service Prioritization
Quantum Computing
Adiabatic Quantum Computing
Binary Quadratic Model