EXPANDING JOB SHOP SCHEDULING PROBLEM TO THE CONTEXT OF SERVICE PRIORITIZATION

Vol 56, 2024 - 309688
Trabalho completo (Oral)
Favoritar este trabalho
Como citar esse trabalho?
Resumo

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.

Compartilhe suas ideias ou dúvidas com os autores!

Sabia que o maior estímulo no desenvolvimento científico e cultural é a curiosidade? Deixe seus questionamentos ou sugestões para o autor!

Faça login para interagir

Tem uma dúvida ou sugestão? Compartilhe seu feedback com os autores!

Instituições
  • 1 Cesar School
Eixo Temático
  • 26. SE-QPO - Métodos Quânticos e suas Aplicações em Pesquisa Operacional
Palavras-chave
Job Shop Scheduling
Service Prioritization
Quantum Computing
Adiabatic Quantum Computing
Binary Quadratic Model