Corrigendum to: ``Solving the job-shop scheduling problem optimally by dynamic programming

DOI10.1016/J.COR.2016.09.001zbMath1391.90335OpenAlexW2184941558MaRDI QIDQ1652100

Jelke J. van Hoorn, Joaquim A. S. Gromicho, Agustín Nogueira, Ignacio Ojea

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.09.001

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

Corrigendum to: ``Solving the job-shop scheduling problem optimally by dynamic programming ⋮ Improved bounded dynamic programming algorithm for solving the blocking flow shop problem

Cites Work

• Solving the job-shop scheduling problem optimally by dynamic programming
• Corrigendum to: ``Solving the job-shop scheduling problem optimally by dynamic programming

This page was built for publication: Corrigendum to: ``Solving the job-shop scheduling problem optimally by dynamic programming