An corrigendum on the paper: Solving the job-shop scheduling problem optimally by dynamic programming (Computers and Operations Research (2012) 39(12) (2968–2977) (S0305054812000500) (10.1016/j.cor.2012.02.024))

In [1] an algorithm is proposed for solving the job-shop scheduling problem optimally using a dynamic programming strategy. This is, according to our knowledge, the first exact algorithm for the Job Shop problem which is not based on integer linear programming and branch and bound. Despite the corre...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Ojea, Ignacio
Publicado: 2017
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03050548_v78_n_p381_vanHoorn
http://hdl.handle.net/20.500.12110/paper_03050548_v78_n_p381_vanHoorn
Aporte de:

Ejemplares similares