Metadata
Author: scielo-abstract
Data
English[en]
Abstract The Job Shop Scheduling Problem (JSP) is a combinatorial optimization problem cataloged as type NP-Hard.
Spanish[es]
Resumen El Job Shop Scheduling Problem (JSP) es un problema de optimización combinatoria catalogado de tipo NP-Hard.
Portuguese[pt]
Resumo O Job Shop Scheduling Problem (JSP) é um problema de otimização combinatória catalogado de tipo NP-Hard.