Solving Flexible Job-Shop Scheduling Problems Based on Quantum Computing
Flexible job-shop scheduling problems (FJSPs) represent one of the most complex combinatorial optimization challenges. Modern production systems and control processes demand rapid decision-making in scheduling. To address this challenge, we propose a quantum computing approach for solving FJSPs. We...
Na minha lista:
| Principais autores: | , , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
MDPI AG
2025-02-01
|
| coleção: | Entropy |
| Assuntos: | |
| Acesso em linha: | https://www.mdpi.com/1099-4300/27/2/189 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|