Mostrar el registro sencillo del ítem
dc.contributor.author
van Hoorn, Jelke J.
dc.contributor.author
Nogueira, Agustín
dc.contributor.author
Ojea, Ignacio
dc.contributor.author
Gromicho, Joaquim A. S.
dc.date.available
2018-08-15T04:05:20Z
dc.date.issued
2017-02
dc.identifier.citation
van Hoorn, Jelke J.; Nogueira, Agustín; Ojea, Ignacio; Gromicho, Joaquim A. S.; An corrigendum on the paper: Solving the job-shop scheduling problem optimally by dynamic programming; Pergamon-Elsevier Science Ltd; Computers & Operations Research; 78; 2-2017; 381-381
dc.identifier.issn
0305-0548
dc.identifier.uri
http://hdl.handle.net/11336/55538
dc.description.abstract
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 correctness of the dynamic programming algorithm presented in [1], the proof of correctness given there is unfortunately flawed. The contribution of the present note is to point out that flaw, and refer the reader to [2], where the flaw is corrected. Particularly, in [2], we recall the main idea of the proof proposed in [1] and present a counterexample that shows where the problem of that proof lies. Taking into account the nature of the problem, we propose a new approach for proving the correctness of the algorithm. This requires the introduction of new concepts and notation. It is important to remark that the new proof modifies our understanding of the algorithm that, in fact, works in a different way than the one explained in the original article. We also recommend [3], where all the elements for understanding the algorithm, the new proof of its correctness and the estimations of its complexity are fully developed.
dc.format
application/pdf
dc.language.iso
eng
dc.publisher
Pergamon-Elsevier Science Ltd
dc.rights
info:eu-repo/semantics/openAccess
dc.rights.uri
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.subject
Job Shop Scheduling
dc.subject.classification
Matemática Pura
dc.subject.classification
Matemáticas
dc.subject.classification
CIENCIAS NATURALES Y EXACTAS
dc.subject.classification
Ciencias de la Computación
dc.subject.classification
Ciencias de la Computación e Información
dc.subject.classification
CIENCIAS NATURALES Y EXACTAS
dc.title
An corrigendum on the paper: Solving the job-shop scheduling problem optimally by dynamic programming
dc.type
info:eu-repo/semantics/article
dc.type
info:ar-repo/semantics/artículo
dc.type
info:eu-repo/semantics/publishedVersion
dc.date.updated
2018-08-14T13:57:48Z
dc.journal.volume
78
dc.journal.pagination
381-381
dc.journal.pais
Países Bajos
dc.journal.ciudad
Amsterdam
dc.description.fil
Fil: van Hoorn, Jelke J.. Vrije Universiteit Amsterdam; Países Bajos
dc.description.fil
Fil: Nogueira, Agustín. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina
dc.description.fil
Fil: Ojea, Ignacio. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigaciones Matemáticas ; Argentina
dc.description.fil
Fil: Gromicho, Joaquim A. S.. Vrije Universiteit Amsterdam; Países Bajos
dc.journal.title
Computers & Operations Research
dc.relation.alternativeid
info:eu-repo/semantics/altIdentifier/url/http://www.sciencedirect.com/science/article/pii/S0305054816302155
dc.relation.alternativeid
info:eu-repo/semantics/altIdentifier/doi/http://dx.doi.org/10.1016/j.cor.2016.09.001
Archivos asociados