TY  - JOUR

T1  - Solving the job-shop scheduling problem optimally by dynamic programming

JO  - Computers & Operations Research

UR  - http://dx.doi.org/10.1016/j.cor.2012.02.024

PY  - 2012/01/01

AU  - Gromicho JAS

AU  - van Hoorn JJ

AU  - Saldanha-da-Gama F

AU  - Timmer GT

ED  - 

DO  - DOI: 10.1016/j.cor.2012.02.024

PB  - Elsevier BV

VL  - 39

IS  - 12

SP  - 2968

EP  - 2977

Y2  - 2024/10/23

ER  -