Matches in SemOpenAlex for { <https://semopenalex.org/work/W2518264398> ?p ?o ?g. }
Showing items 1 to 82 of
82
with 100 items per page.
- W2518264398 endingPage "173" @default.
- W2518264398 startingPage "165" @default.
- W2518264398 abstract "In both industry and the research literature, Mixed Integer Programming (MIP) is often the default approach for solving scheduling problems. In this paper we present and evaluate four MIP formulations for the classical job shop scheduling problem (JSP). While MIP formulations for the JSP have existed since the 1960s, it appears that comprehensive computational studies have not been performed since then. Due to substantial improvements in MIP technology in recent years, it is of interest to compare the standard JSP models using modern optimization software. We perform a fully crossed empirical study of four MIP models using CPLEX, GUROBI and SCIP, focusing on both the number of instances that can be proved optimal and the solution quality over time. Our results demonstrate that modern MIP solvers are able to prove optimality for moderate-sized problems very quickly. Comparing the four MIP models, the disjunctive formulation proposed by Manne performs best on both performance measures. We also investigate the performance of MIP with multi-threading and parameter tuning using CPLEX. Noticeable performance gain is observed when compared to the results using only single thread and default parameter settings. Our results serve as a snapshot of the performance of modern MIP solvers for an important, well-studied scheduling problem. Finally, the results of MIP is compared to constraint programming (CP), another common approach for scheduling, and the best known complete algorithm to provide a broad view among different approaches. HighlightsWe perform a complete empirical study of four MIP models for JSP.Our results demonstrate that the disjunctive MIP model is most efficient.Our results demonstrate that MIP is efficient for solving moderate-size problems.We compare MIP to constraint programming and the best known algorithm.Our results serve as a snapshot of the performance of modern MIP solvers." @default.
- W2518264398 created "2016-09-16" @default.
- W2518264398 creator A5016792286 @default.
- W2518264398 creator A5082373681 @default.
- W2518264398 date "2016-09-01" @default.
- W2518264398 modified "2023-10-14" @default.
- W2518264398 title "Mixed Integer Programming models for job shop scheduling: A computational analysis" @default.
- W2518264398 cites W1974709582 @default.
- W2518264398 cites W1990267895 @default.
- W2518264398 cites W2027524005 @default.
- W2518264398 cites W2048687263 @default.
- W2518264398 cites W2065053103 @default.
- W2518264398 cites W2071306171 @default.
- W2518264398 cites W2072298242 @default.
- W2518264398 cites W2083523511 @default.
- W2518264398 cites W2087138863 @default.
- W2518264398 cites W2088304441 @default.
- W2518264398 cites W2125990606 @default.
- W2518264398 cites W2127220062 @default.
- W2518264398 cites W2134098988 @default.
- W2518264398 cites W2156391157 @default.
- W2518264398 cites W2166928920 @default.
- W2518264398 cites W2169224602 @default.
- W2518264398 cites W2169334805 @default.
- W2518264398 doi "https://doi.org/10.1016/j.cor.2016.04.006" @default.
- W2518264398 hasPublicationYear "2016" @default.
- W2518264398 type Work @default.
- W2518264398 sameAs 2518264398 @default.
- W2518264398 citedByCount "130" @default.
- W2518264398 countsByYear W25182643982016 @default.
- W2518264398 countsByYear W25182643982017 @default.
- W2518264398 countsByYear W25182643982018 @default.
- W2518264398 countsByYear W25182643982019 @default.
- W2518264398 countsByYear W25182643982020 @default.
- W2518264398 countsByYear W25182643982021 @default.
- W2518264398 countsByYear W25182643982022 @default.
- W2518264398 countsByYear W25182643982023 @default.
- W2518264398 crossrefType "journal-article" @default.
- W2518264398 hasAuthorship W2518264398A5016792286 @default.
- W2518264398 hasAuthorship W2518264398A5082373681 @default.
- W2518264398 hasBestOaLocation W25182643982 @default.
- W2518264398 hasConcept C111919701 @default.
- W2518264398 hasConcept C11413529 @default.
- W2518264398 hasConcept C126255220 @default.
- W2518264398 hasConcept C206729178 @default.
- W2518264398 hasConcept C33923547 @default.
- W2518264398 hasConcept C41008148 @default.
- W2518264398 hasConcept C42475967 @default.
- W2518264398 hasConcept C55416958 @default.
- W2518264398 hasConcept C56086750 @default.
- W2518264398 hasConcept C68387754 @default.
- W2518264398 hasConceptScore W2518264398C111919701 @default.
- W2518264398 hasConceptScore W2518264398C11413529 @default.
- W2518264398 hasConceptScore W2518264398C126255220 @default.
- W2518264398 hasConceptScore W2518264398C206729178 @default.
- W2518264398 hasConceptScore W2518264398C33923547 @default.
- W2518264398 hasConceptScore W2518264398C41008148 @default.
- W2518264398 hasConceptScore W2518264398C42475967 @default.
- W2518264398 hasConceptScore W2518264398C55416958 @default.
- W2518264398 hasConceptScore W2518264398C56086750 @default.
- W2518264398 hasConceptScore W2518264398C68387754 @default.
- W2518264398 hasLocation W25182643981 @default.
- W2518264398 hasLocation W25182643982 @default.
- W2518264398 hasOpenAccess W2518264398 @default.
- W2518264398 hasPrimaryLocation W25182643981 @default.
- W2518264398 hasRelatedWork W1553364762 @default.
- W2518264398 hasRelatedWork W2017703544 @default.
- W2518264398 hasRelatedWork W2031485694 @default.
- W2518264398 hasRelatedWork W2068528676 @default.
- W2518264398 hasRelatedWork W2088389093 @default.
- W2518264398 hasRelatedWork W2110698131 @default.
- W2518264398 hasRelatedWork W2188917685 @default.
- W2518264398 hasRelatedWork W2480575007 @default.
- W2518264398 hasRelatedWork W2562877900 @default.
- W2518264398 hasRelatedWork W4221148221 @default.
- W2518264398 hasVolume "73" @default.
- W2518264398 isParatext "false" @default.
- W2518264398 isRetracted "false" @default.
- W2518264398 magId "2518264398" @default.
- W2518264398 workType "article" @default.