《2016 Solving the job-shop scheduling problem optimally by dynamic programming 》.pdf

Computers Operations Research 39 (2012) 2968–2977 Contents lists available at SciVerse ScienceDirect Computers Operations Research journal homepage: /locate/caor Solving the job-shop scheduling problem optimally by dynamic programming Joaquim A.S. Gromicho a,b, Jelke J. van Hoorn a,b,n, Francisco Saldanha-da-Gama c, Gerrit T. Timmer a,b a Department of Econometrics and OR, VU University, Amsterdam, The Netherlands b ORTEC, Gouda, The Netherlands c ˆ ~ Faculdade de Ciencias Centro de Investigac- ao Operacional, Universidade de Lisboa, Portugal a r t i c l e i n f o a b s t r a c t Available online 8 March 2012 Scheduling problems received substantial attention during the last decennia. The job-shop problem is a Keywords: very important scheduling problem, which is NP-hard in the strong sense and with well-known Job-shop scheduling benchmark instances of relatively small size which attest the practical difficulty in solving it. The Dynamic programming literature on the job-shop scheduling problem includes several approximation and exact algorithms. So Complexity analysis far, no algorithm is known which solves the job-shop scheduling problem optimally with a lower complexity than the exhaustive enumeration of all feasible solutions. We propose such an algorithm, based on the well-known Bellman equation designed by Held and Karp to fin