{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,15]],"date-time":"2023-09-15T13:14:46Z","timestamp":1694783686399},"reference-count":18,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T00:00:00Z","timestamp":1267401600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AI Magazine"],"published-print":{"date-parts":[[2010,3]]},"abstract":"Preventive\u2010maintenance schedules occurring in industry are often suboptimal with regard to maintenance coallocation, loss\u2010of\u2010production costs, and availability. We describe the implementation and deployment of a software decision support tool for the maintenance planning of gas turbines, with the goal of reducing the direct maintenance costs and the often costly production losses during maintenance down time. The optimization problem is formally defined, and we argue that the feasibility version is NP\u2010complete. We outline a heuristic algorithm that can quickly solve the problem for practical purposes and validate the approach on a real\u2010world scenario based on an oil production facility. We also compare the performance of our algorithm with results from using integer programming and discuss the deployment of the application. The experimental results indicate that down time reductions up to 65 percent can be achieved, compared to traditional preventive maintenance. In addition, the use of our tool is expected to improve availability by up to 1 percent and to reduce the number of planned maintenance days by 12 percent. Compared to an integer programming approach, our algorithm is not optimal but is much faster and produces results that are useful in practice. Our test results and SIT AB's estimates based on operational use both indicate that significant savings can be achieved by using our software tool, compared to maintenance plans with fixed intervals.<\/jats:p>","DOI":"10.1609\/aimag.v31i1.2286","type":"journal-article","created":{"date-parts":[[2017,7,18]],"date-time":"2017-07-18T00:29:39Z","timestamp":1500337779000},"page":"21-36","source":"Crossref","is-referenced-by-count":3,"title":["Searching for Gas Turbine Maintenance Schedules"],"prefix":"10.1002","volume":"31","author":[{"given":"Markus","family":"Bohlin","sequence":"first","affiliation":[]},{"given":"Kivanc","family":"Doganay","sequence":"additional","affiliation":[]},{"given":"Per","family":"Kreuger","sequence":"additional","affiliation":[]},{"given":"Rebecca","family":"Steinert","sequence":"additional","affiliation":[]},{"given":"Mathias","family":"W\u00e4rja","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2010,3]]},"reference":[{"key":"e_1_2_9_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0098-1354(85)85002-X"},{"key":"e_1_2_9_3_1","doi-asserted-by":"crossref","unstructured":"Bohlin M. W\u00e4rja M. Holst A. Slottner P.; andDoganay K.2009.Optimization of Condition\u2010Based Maintenance for Industrial Gas Turbines: Requirements and Results. Paper no. GT2009\u201059935 presented at the ASME Gas Turbine Technical Congress and Exposition June 8\u201012 Orlando FL.","DOI":"10.1115\/GT2009-59935"},{"key":"e_1_2_9_4_1","first-page":"46","volume-title":"Approximation Algorithms for NP\u2010Hard Problems","author":"Coffman E. G.","year":"1997"},{"key":"e_1_2_9_5_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001"},{"key":"e_1_2_9_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0951-8320(95)00076-3"},{"key":"e_1_2_9_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0951-8320(98)83004-4"},{"key":"e_1_2_9_8_1","volume-title":"Computers and Intractability: A Guide to the Theory of NP\u2010Completeness","author":"Garey M. R.","year":"1979"},{"key":"e_1_2_9_9_1","doi-asserted-by":"crossref","unstructured":"Hart P. E. Nilsson N. J.; andRaphael B.1972. Correction to \u201cA Formal Basis for the Heuristic Determination of Minimum Cost Paths.\u201dSIGART Bulletin(37):28\u201329.","DOI":"10.1145\/1056777.1056779"},{"key":"e_1_2_9_10_1","first-page":"607","volume-title":"Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence","author":"Harvey W. D.","year":"1995"},{"key":"e_1_2_9_11_1","first-page":"286","volume-title":"Proceedings of the Eighth Innovative Applications of Artificial Intelligence Conference","author":"Korf R. E.","year":"1996"},{"key":"e_1_2_9_12_1","first-page":"232","volume-title":"Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence","author":"Lhomme O.","year":"1993"},{"key":"e_1_2_9_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0951-8320(02)00043-1"},{"key":"e_1_2_9_14_1","volume-title":"Problem\u2010Solving Methods in Artificial Intelligence","author":"Nilsson N. J.","year":"1971"},{"key":"e_1_2_9_15_1","volume-title":"Artificial Intelligence: A Modern Approach","author":"Russell S.","year":"2003"},{"key":"e_1_2_9_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0098-1354(97)88493-1"},{"key":"e_1_2_9_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(96)00320-7"},{"key":"e_1_2_9_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)00319-6"},{"key":"e_1_2_9_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAS.1983.317771"}],"container-title":["AI Magazine"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/aaai.org\/ojs\/index.php\/aimagazine\/article\/viewFile\/2286\/2134","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1609\/aimag.v31i1.2286","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,14]],"date-time":"2023-09-14T16:23:01Z","timestamp":1694708581000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1609\/aimag.v31i1.2286"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["10.1609\/aimag.v31i1.2286"],"URL":"https:\/\/doi.org\/10.1609\/aimag.v31i1.2286","archive":["Portico"],"relation":{},"ISSN":["0738-4602","2371-9621"],"issn-type":[{"value":"0738-4602","type":"print"},{"value":"2371-9621","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3]]}}}