{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:10:32Z","timestamp":1740103832134,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T00:00:00Z","timestamp":1703116800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T00:00:00Z","timestamp":1703116800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2024,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Preventive maintenance (PM) is performed so that failure is avoided while corrective maintenance is performed after a failure has occurred in order to restore the system back to an operational state. This research aims at scheduling PM activities for a multi-component system within a finite time horizon. We consider a setting with two stakeholders, being the system operator and the maintenance workshop, and two different contract types governing their joint activities, namely an availability contract and a turn-around time contract. Components in the systems that are to be maintained are sent to the maintenance workshop, which needs to schedule and perform all maintenance activities while at the same time satisfying the contract and not exceeding the workshop capacity. Our modelling is based on a mixed-binary linear optimization model of a PM scheduling problem with so-called interval costs over a finite and discretized time horizon. We enhance this scheduling model with the flow of individual components through the maintenance workshop, including stocks of spare components, both those components that need repair and the repaired ones. The resulting scheduling model is then utilized in the optimization of two main contracts, namely maximizing the availability of repaired (or new) components and minimizing the deviation from the contracted turn-around times for the components in the maintenance loop. Each of these objectives is combined with the objective to minimize the costs for maintenance of the operating system, leading to two bi-objective optimization problems. We analyse the two contracting forms between the stakeholders by studying and comparing the Pareto fronts resulting from different parameter settings, regarding minimum allowed stock levels and investments in repair capacity of the workshop. Our bi-objective mixed-binary linear optimization model is able to capture important properties of the results from the contracting forms as well as to show that, in our setting, an availability contract performs better than a turn-around time contract in terms of tractability.\n<\/jats:p>","DOI":"10.1007\/s10951-023-00800-x","type":"journal-article","created":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T15:02:48Z","timestamp":1703170968000},"page":"87-101","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Scheduling the repair and replacement of individual components in operating systems: a bi-objective mathematical optimization model"],"prefix":"10.1007","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7610-543X","authenticated-orcid":false,"given":"Gabrijela","family":"Obradovi\u0107","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1962-7279","authenticated-orcid":false,"given":"Ann-Brith","family":"Str\u00f6mberg","sequence":"additional","affiliation":[]},{"given":"Kristian","family":"Lundberg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,21]]},"reference":[{"issue":"17","key":"800_CR1","doi-asserted-by":"publisher","first-page":"5137","DOI":"10.1080\/00207540903089536","volume":"48","author":"GA Akyuz","year":"2010","unstructured":"Akyuz, G. A., & Erkan, T. E. (2010). Supply chain performance measurement: A literature review. International Journal of Production Research, 48(17), 5137\u20135155. https:\/\/doi.org\/10.1080\/00207540903089536","journal-title":"International Journal of Production Research"},{"issue":"2","key":"800_CR2","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0167-6377(89)90001-1","volume":"8","author":"E Arkin","year":"1989","unstructured":"Arkin, E., Joneja, D., & Roundy, R. (1989). Computational complexity of uncapacitated multi-echelon production planning problems. Operations Research Letters, 8(2), 61\u201366.","journal-title":"Operations Research Letters"},{"issue":"13","key":"800_CR3","doi-asserted-by":"publisher","first-page":"2667","DOI":"10.1080\/00207540410001671660","volume":"42","author":"F Boctor","year":"2004","unstructured":"Boctor, F., Laporte, G., & Renaud, J. (2004). Models and algorithms for the dynamic demand joint replenishment problem. International Journal of Production Research, 42(13), 2667\u20132678.","journal-title":"International Journal of Production Research"},{"key":"800_CR4","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/j.ress.2018.11.028","volume":"183","author":"L Boliang","year":"2019","unstructured":"Boliang, L., Wu, J., Lin, R., Wang, J., Wang, H., & Zhang, X. (2019). Optimization of high-level preventive maintenance scheduling for high-speed trains. Reliability Engineering & System Safety, 183, 261\u2013275.","journal-title":"Reliability Engineering & System Safety"},{"key":"800_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23929-8","volume-title":"Complex scheduling","author":"P Brucker","year":"2012","unstructured":"Brucker, P., & Knust, S. (2012). Complex scheduling (2nd ed.). Berlin: GOR-Publications. Springer.","edition":"2"},{"key":"800_CR6","doi-asserted-by":"crossref","unstructured":"Conforti, M., Cornejols, G., & Zambelli, G. (2014). Integer programming. Graduate texts in mathematics, vol. 271. Springer, Switzerland.","DOI":"10.1007\/978-3-319-11008-0"},{"issue":"2","key":"800_CR7","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1137\/15M1020575","volume":"59","author":"I Dunning","year":"2017","unstructured":"Dunning, I., Huchette, J., & Lubin, M. (2017). JuMP: A modeling language for mathematical optimization. SIAM Review, 59(2), 295\u2013320. https:\/\/doi.org\/10.1137\/15M1020575","journal-title":"SIAM Review"},{"key":"800_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-27659-9","volume-title":"Multicriteria optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott, M. (2005). Multicriteria optimization (2nd ed.). Berlin: Springer. https:\/\/doi.org\/10.1007\/3-540-27659-9","edition":"2"},{"key":"800_CR9","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1016\/j.ejor.2014.10.016","volume":"242","author":"A Gavranis","year":"2015","unstructured":"Gavranis, A., & Kozanidis, G. (2015). An exact solution algorithm for maximizing the fleet availability of a unit of aircraft subject to flight and maintenance requirements. European Journal of Operational Research, 242, 631\u2013643.","journal-title":"European Journal of Operational Research"},{"key":"800_CR10","unstructured":"Gurobi. (2020). Gurobi optimizer reference manual. http:\/\/www.gurobi.com."},{"key":"800_CR11","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/j.cie.2014.02.009","volume":"76","author":"E Gustavsson","year":"2014","unstructured":"Gustavsson, E., Patriksson, M., Str\u00f6mberg, A. Q. B., Wojciechowski, A., & \u00d6nnheim, M. (2014). The preventive maintenance scheduling problem with interval costs. Computers & Industrial Engineering, 76, 390\u2013400.","journal-title":"Computers & Industrial Engineering"},{"key":"800_CR12","unstructured":"Julia. (2012). Version 1.5. Julia: A fast dynamic language for technical computing. https:\/\/docs.julialang.org\/en\/v1\/."},{"key":"800_CR13","doi-asserted-by":"crossref","unstructured":"Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., & Shmoys, D. B. (1993). Chapter 9: Sequencing and scheduling: Algorithms and complexity. In: Logistics of Production and Inventory. Handbooks in Operations Research and Management Science (Vol. 4, pp. 445\u2013522). Amsterdam: Elsevier.","DOI":"10.1016\/S0927-0507(05)80189-6"},{"key":"800_CR14","doi-asserted-by":"publisher","unstructured":"Lid\u00e9n, T. (2020). Coordinating maintenance windows and train traffic: A case study. Public Transport, 12, 261\u2013298. https:\/\/doi.org\/10.1007\/s12469-020-00232-2","DOI":"10.1007\/s12469-020-00232-2"},{"key":"800_CR15","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/j.amc.2009.03.037","volume":"213","author":"G Mavrotas","year":"2009","unstructured":"Mavrotas, G. (2009). Effective implementation of the $$\\epsilon $$-constraint method in multi-objective mathematical programming problems. Applied Mathematics and Computation, 213, 455\u2013465.","journal-title":"Applied Mathematics and Computation"},{"key":"800_CR16","doi-asserted-by":"crossref","unstructured":"Papakostas, N., Papachatzakis, P., Kanthakis, V., Mourtzis, D., & Chryssolouris, G. (2010). An approach to operational aircraft maintenance planning. Decision Support Systems, 48, 604\u2013612.","DOI":"10.1016\/j.dss.2009.11.010"},{"key":"800_CR17","doi-asserted-by":"crossref","unstructured":"Robert, E., Berenguer, C., Bouvard, K., Tedie, H., & Lesobre, H. (2018). Joint dynamic scheduling of missions and maintenance for a commercial heavy vehicle: Value of on-line information. IFAC PapersOnLine, 51(24), 837\u2013842. 10th IFAC Symposium on Fault Detection, Supervision and Safety for Technical Processes SAFEPROCESS 2018.","DOI":"10.1016\/j.ifacol.2018.09.672"},{"key":"800_CR18","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/205847","volume":"2013","author":"M Shafiee","year":"2013","unstructured":"Shafiee, M., Patriksson, M., & Str\u00f6mberg, A. Q. B. (2013). An optimal number-dependent preventive maintenance strategy for offshore wind turbine blades considering logistics. Advances in Operations Research, 2013, 205847. https:\/\/doi.org\/10.1155\/2013\/205847","journal-title":"Advances in Operations Research"},{"key":"800_CR19","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1016\/j.trpro.2015.09.048","volume":"10","author":"M Verhoeff","year":"2015","unstructured":"Verhoeff, M., Verhagen, W. J. C., & Curran, R. (2015). Maximizing operational readiness in military aviation by optimizing flight and maintenance planning. Transportation Research Procedia, 10, 941\u2013950.","journal-title":"Transportation Research Procedia"},{"key":"800_CR20","unstructured":"Yu, Q., & Str\u00f6mberg, A. Q. B. (2021). Mathematical optimization models for long-term maintenance scheduling of wind power systems. arxiv:2105.06666."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-023-00800-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-023-00800-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-023-00800-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,11]],"date-time":"2024-02-11T13:13:22Z","timestamp":1707657202000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-023-00800-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,21]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["800"],"URL":"https:\/\/doi.org\/10.1007\/s10951-023-00800-x","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2023,12,21]]},"assertion":[{"value":"7 November 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 December 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}