FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2014366273> ?p ?o ?g. }

• W2014366273 endingPage "2977" @default.
• W2014366273 startingPage "2968" @default.
• W2014366273 abstract "Scheduling problems received substantial attention during the last decennia. The job-shop problem is a very important scheduling problem, which is NP-hard in the strong sense and with well-known benchmark instances of relatively small size which attest the practical difficulty in solving it. The literature on the job-shop scheduling problem includes several approximation and exact algorithms. So 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 find optimal sequences and which offers the best complexity to solve the Traveling Salesman Problem known to this date. For the TSP this means O(n22n) which is exponentially better than O(n!) required to evaluate all feasible solutions. We reach similar results by first recovering the principle of optimality, which is not obtained for free in the case of the job-shop scheduling problem, and by performing a complexity analysis of the resulting algorithm. Our analysis is conservative but nevertheless exponentially better than brute force. We also show very promising results obtained from our implementation of this algorithm, which seem to indicate two things: firstly that there is room for improvement in the complexity analysis (we observe the generation of a number of solutions per state for the benchmark instances considered which is orders of magnitude lower than the bound we could devise) and secondly that the potential practical implications of this approach are at least as exciting as the theoretical ones, since we manage to solve some celebrated benchmark instances in processing times ranging from seconds to minutes." @default.
• W2014366273 created "2016-06-24" @default.
• W2014366273 creator A5014572640 @default.
• W2014366273 creator A5019108328 @default.
• W2014366273 creator A5041175905 @default.
• W2014366273 creator A5080838584 @default.
• W2014366273 date "2012-12-01" @default.
• W2014366273 modified "2023-10-05" @default.
• W2014366273 title "Solving the job-shop scheduling problem optimally by dynamic programming" @default.
• W2014366273 cites W1555410326 @default.
• W2014366273 cites W1610326124 @default.
• W2014366273 cites W1963774625 @default.
• W2014366273 cites W1969186119 @default.
• W2014366273 cites W1971483538 @default.
• W2014366273 cites W1988357027 @default.
• W2014366273 cites W1991124379 @default.
• W2014366273 cites W2006389447 @default.
• W2014366273 cites W2022719115 @default.
• W2014366273 cites W2031409887 @default.
• W2014366273 cites W2031724616 @default.
• W2014366273 cites W2041252124 @default.
• W2014366273 cites W2048687263 @default.
• W2014366273 cites W2058578326 @default.
• W2014366273 cites W2069642733 @default.
• W2014366273 cites W2071306171 @default.
• W2014366273 cites W2071315752 @default.
• W2014366273 cites W2076785727 @default.
• W2014366273 cites W2081278763 @default.
• W2014366273 cites W2084427019 @default.
• W2014366273 cites W2088304441 @default.
• W2014366273 cites W2107701927 @default.
• W2014366273 cites W2128674029 @default.
• W2014366273 cites W2130272456 @default.
• W2014366273 cites W2139910732 @default.
• W2014366273 cites W2168336253 @default.
• W2014366273 cites W2743045177 @default.
• W2014366273 cites W4247405782 @default.
• W2014366273 doi "https://doi.org/10.1016/j.cor.2012.02.024" @default.
• W2014366273 hasPublicationYear "2012" @default.
• W2014366273 type Work @default.
• W2014366273 sameAs 2014366273 @default.
• W2014366273 citedByCount "40" @default.
• W2014366273 countsByYear W20143662732013 @default.
• W2014366273 countsByYear W20143662732014 @default.
• W2014366273 countsByYear W20143662732015 @default.
• W2014366273 countsByYear W20143662732016 @default.
• W2014366273 countsByYear W20143662732017 @default.
• W2014366273 countsByYear W20143662732018 @default.
• W2014366273 countsByYear W20143662732019 @default.
• W2014366273 countsByYear W20143662732020 @default.
• W2014366273 countsByYear W20143662732021 @default.
• W2014366273 countsByYear W20143662732022 @default.
• W2014366273 countsByYear W20143662732023 @default.
• W2014366273 crossrefType "journal-article" @default.
• W2014366273 hasAuthorship W2014366273A5014572640 @default.
• W2014366273 hasAuthorship W2014366273A5019108328 @default.
• W2014366273 hasAuthorship W2014366273A5041175905 @default.
• W2014366273 hasAuthorship W2014366273A5080838584 @default.
• W2014366273 hasConcept C111919701 @default.
• W2014366273 hasConcept C126255220 @default.
• W2014366273 hasConcept C13280743 @default.
• W2014366273 hasConcept C158336966 @default.
• W2014366273 hasConcept C175859090 @default.
• W2014366273 hasConcept C185798385 @default.
• W2014366273 hasConcept C205649164 @default.
• W2014366273 hasConcept C206729178 @default.
• W2014366273 hasConcept C33923547 @default.
• W2014366273 hasConcept C41008148 @default.
• W2014366273 hasConcept C55416958 @default.
• W2014366273 hasConcept C68387754 @default.
• W2014366273 hasConceptScore W2014366273C111919701 @default.
• W2014366273 hasConceptScore W2014366273C126255220 @default.
• W2014366273 hasConceptScore W2014366273C13280743 @default.
• W2014366273 hasConceptScore W2014366273C158336966 @default.
• W2014366273 hasConceptScore W2014366273C175859090 @default.
• W2014366273 hasConceptScore W2014366273C185798385 @default.
• W2014366273 hasConceptScore W2014366273C205649164 @default.
• W2014366273 hasConceptScore W2014366273C206729178 @default.
• W2014366273 hasConceptScore W2014366273C33923547 @default.
• W2014366273 hasConceptScore W2014366273C41008148 @default.
• W2014366273 hasConceptScore W2014366273C55416958 @default.
• W2014366273 hasConceptScore W2014366273C68387754 @default.
• W2014366273 hasIssue "12" @default.
• W2014366273 hasLocation W20143662731 @default.
• W2014366273 hasOpenAccess W2014366273 @default.
• W2014366273 hasPrimaryLocation W20143662731 @default.
• W2014366273 hasRelatedWork W1525607884 @default.
• W2014366273 hasRelatedWork W1542103931 @default.
• W2014366273 hasRelatedWork W1980080607 @default.
• W2014366273 hasRelatedWork W2018736540 @default.
• W2014366273 hasRelatedWork W2068528676 @default.
• W2014366273 hasRelatedWork W2072187533 @default.
• W2014366273 hasRelatedWork W2393601009 @default.
• W2014366273 hasRelatedWork W2531392548 @default.
• W2014366273 hasRelatedWork W2983002716 @default.
• W2014366273 hasRelatedWork W3028389691 @default.
• W2014366273 hasVolume "39" @default.
• W2014366273 isParatext "false" @default.

• next