{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:34:57Z","timestamp":1740123297572,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,9,15]],"date-time":"2023-09-15T00:00:00Z","timestamp":1694736000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,9,15]],"date-time":"2023-09-15T00:00:00Z","timestamp":1694736000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"ARC Centre for Transforming Maintenance Through Data Science","award":["IC180100030"],"award-info":[{"award-number":["IC180100030"]}]},{"name":"Curtin University"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2024,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper describes a maintenance scheduling model for digester banks. Digester banks are network-connected assets that lie on the critical path of the Bayer process, a chemical refinement process that converts bauxite ore into alumina. The banks require different maintenance activities at different due times. Furthermore, the maintenance schedule is subject to production-related constraints and resource limitations. Given the complexity of scheduling maintenance for large fleets of digester banks, a continuous-time, mixed-integer linear program is formulated to find the cost-minimising maintenance schedule that satisfies all required constraints. A solution approach that employs lazy constraints and Benders decomposition is proposed to solve the model. Unlike generic implementations of Benders decomposition, we show that the subproblems can be solved explicitly using a specialist algorithm. We solve the scheduling model for realistic scenarios involving two Bayer refineries based in Western Australia.\n<\/jats:p>","DOI":"10.1007\/s10479-023-05561-6","type":"journal-article","created":{"date-parts":[[2023,9,15]],"date-time":"2023-09-15T14:02:08Z","timestamp":1694786528000},"page":"269-302","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bayer digestion maintenance optimisation with lazy constraints and Benders decomposition"],"prefix":"10.1007","volume":"338","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0961-0425","authenticated-orcid":false,"given":"Sandy","family":"Spiers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hoa T.","family":"Bui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryan","family":"Loxton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moussa Reda","family":"Mansour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kylie","family":"Hollins","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Francis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christopher","family":"Martindale","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yogesh","family":"Pimpale","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,15]]},"reference":[{"key":"5561_CR1","unstructured":"Alcoa of Australia Limited. (2019). 2019 Tax Transparency Report. Retrieved from https:\/\/www.alcoa.com\/australia\/en\/pdf\/alcoa-of-australia-ltdtax-transparency-report-2019.pdf"},{"issue":"1","key":"5561_CR2","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"JF Benders","year":"1962","unstructured":"Benders, J. F. (1962). Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4(1), 238\u2013252. https:\/\/doi.org\/10.1007\/BF01386316","journal-title":"Numerische Mathematik"},{"issue":"3","key":"5561_CR3","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1007\/S40831-021-00417-4","volume":"7","author":"L-W Cheng","year":"2021","unstructured":"Cheng, L.-W., Wang, Y.-L., Zhou, Q.-S., Qi, T.-G., Liu, G.-H., Peng, Z.-H., & Li, X.-B. (2021). Scale Formation During the Bayer Process and a Potential Prevention Strategy. Journal of Sustainable Metallurgy, 7(3), 1293\u20131303. https:\/\/doi.org\/10.1007\/S40831-021-00417-4","journal-title":"Journal of Sustainable Metallurgy"},{"issue":"6","key":"5561_CR4","doi-asserted-by":"publisher","first-page":"1477","DOI":"10.1287\/OPRE.1110.0965","volume":"59","author":"I Contreras","year":"2011","unstructured":"Contreras, I., Cordeau, J. F., & Laporte, G. (2011). Benders Decomposition for Large-Scale Uncapacitated Hub Location. Operations Research, 59(6), 1477\u20131490. https:\/\/doi.org\/10.1287\/OPRE.1110.0965","journal-title":"Operations Research"},{"issue":"3","key":"5561_CR5","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1016\/j.ejor.2019.09.047","volume":"285","author":"B de Jonge","year":"2020","unstructured":"de Jonge, B., & Scarf, P. A. (2020). A review on maintenance optimization. European Journal of Operational Research, 285(3), 805\u2013824. https:\/\/doi.org\/10.1016\/j.ejor.2019.09.047","journal-title":"European Journal of Operational Research"},{"issue":"7","key":"5561_CR6","doi-asserted-by":"publisher","first-page":"2146","DOI":"10.1287\/MNSC.2016.2461","volume":"63","author":"M Fischetti","year":"2016","unstructured":"Fischetti, M., Ljubic, I., & Sinnl, M. (2016). Redesigning Benders Decomposition for Large-Scale Facility Location. Management Science, 63(7), 2146\u20132162. https:\/\/doi.org\/10.1287\/MNSC.2016.2461","journal-title":"Management Science"},{"issue":"11","key":"5561_CR7","doi-asserted-by":"publisher","first-page":"2109","DOI":"10.1016\/J.COMPCHEMENG.2004.05.002","volume":"28","author":"CA Floudas","year":"2004","unstructured":"Floudas, C. A., & Lin, X. (2004). Continuous-time versus discrete-time approaches for scheduling of chemical processes: a review. Computers & Chemical Engineering, 28(11), 2109\u20132129. https:\/\/doi.org\/10.1016\/J.COMPCHEMENG.2004.05.002","journal-title":"Computers & Chemical Engineering"},{"key":"5561_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/J.EJOR.2021.12.041","author":"M Heydar","year":"2021","unstructured":"Heydar, M., Mardaneh, E., & Loxton, R. (2021). Approximate dynamic programming for an energy-efficient parallel machine scheduling problem. European Journal of Operational Research. https:\/\/doi.org\/10.1016\/J.EJOR.2021.12.041","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"5561_CR9","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1287\/OPRE.1060.0371","volume":"55","author":"JN Hooker","year":"2007","unstructured":"Hooker, J. N. (2007). Planning and Scheduling by Logic-Based Benders Decomposition. Operations Research, 55(3), 588\u2013602. https:\/\/doi.org\/10.1287\/OPRE.1060.0371","journal-title":"Operations Research"},{"key":"5561_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.cor.2009.12.011","volume":"38","author":"O Kon\u00e9","year":"2011","unstructured":"Kon\u00e9, O., Artigues, C., Lopez, P., & Mongeau, M. (2011). Event-based MILP models for resource-constrained project scheduling problems. Computers & Operations Research, 38, 3\u201313. https:\/\/doi.org\/10.1016\/j.cor.2009.12.011","journal-title":"Computers & Operations Research"},{"key":"5561_CR11","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/J.COMPCHEMENG.2014.05.009","volume":"68","author":"GM Kopanos","year":"2014","unstructured":"Kopanos, G. M., Kyriakidis, T. S., & Georgiadis, M. C. (2014). New continuoustime and discrete-time mathematical formulation for resource-constrained project scheduling problems. Computers and Chemical Engineering, 68, 96\u2013106. https:\/\/doi.org\/10.1016\/J.COMPCHEMENG.2014.05.009","journal-title":"Computers and Chemical Engineering"},{"key":"5561_CR12","doi-asserted-by":"publisher","unstructured":"Lerch, D., & Trautmann, N. (2019). A Lazy-Constraints Approach to Resource- Constrained Project Scheduling. IEEE International Conference on Industrial Engineering and Engineering Management, 144\u2013148,. https:\/\/doi.org\/10.1109\/IEEM44572.2019.8978524","DOI":"10.1109\/IEEM44572.2019.8978524"},{"key":"5561_CR13","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/J.HYDROMET.2015.01.001","volume":"152","author":"X Li","year":"2015","unstructured":"Li, X., Yu, S., Dong, W., Chen, Y., Zhou, Q., Qi, T., & Jiang, Y. (2015). feb). Investigating the effect of ferrous ion on the digestion of diasporic bauxite in the Bayer process. Hydrometallurgy, 152, 183\u2013189. https:\/\/doi.org\/10.1016\/J.HYDROMET.2015.01.001","journal-title":"Hydrometallurgy"},{"issue":"2","key":"5561_CR14","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1287\/OPRE.8.2.219","volume":"8","author":"AS Manne","year":"1960","unstructured":"Manne, A. S. (1960). On the Job-Shop Scheduling Problem. Operations Research, 8(2), 219\u2013223. https:\/\/doi.org\/10.1287\/OPRE.8.2.219","journal-title":"Operations Research"},{"issue":"13","key":"5561_CR15","doi-asserted-by":"publisher","first-page":"3056","DOI":"10.1021\/IE020923Y","volume":"42","author":"CT Maravelias","year":"2003","unstructured":"Maravelias, C. T., & Grossmann, I. E. (2003). New General Continuous-Time State-Task Network Formulation for Short-Term Scheduling of Multipurpose Batch Plants. Industrial and Engineering Chemistry Research, 42(13), 3056\u20133074. https:\/\/doi.org\/10.1021\/IE020923Y","journal-title":"Industrial and Engineering Chemistry Research"},{"key":"5561_CR16","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"CE Miller","year":"1960","unstructured":"Miller, C. E., Tucker, A. W., & Zemlin, R. A. (1960). Integer Programming Formulation of Traveling Salesman Problems. Journal of the ACM, 7, 326\u2013329. https:\/\/doi.org\/10.1145\/321043.321046","journal-title":"Journal of the ACM"},{"issue":"1","key":"5561_CR17","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1287\/ijoc.2015.0671","volume":"28","author":"J Naoum-Sawaya","year":"2016","unstructured":"Naoum-Sawaya, J., & Buchheim, C. (2016). Robust critical node selection by benders decomposition. INFORMS Journal on Computing, 28(1), 162\u2013174. https:\/\/doi.org\/10.1287\/ijoc.2015.0671","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"5561_CR18","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1016\/J.EJOR.2015.11.008","volume":"251","author":"MC Olde Keizer","year":"2016","unstructured":"Olde Keizer, M. C., Teunter, R. H., & Veldman, J. (2016). Clustering condition-based maintenance for systems with redundancy and economic dependencies. European Journal of Operational Research, 251(2), 531\u2013540. https:\/\/doi.org\/10.1016\/J.EJOR.2015.11.008","journal-title":"European Journal of Operational Research"},{"key":"5561_CR19","unstructured":"Pearce, R. H. (2019). Towards a general formulation of lazy constraints (PhD Thesis). School of Mathematics and Physics, The University of Queensland."},{"issue":"6","key":"5561_CR20","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1080\/01605682.2018.1471374","volume":"70","author":"RH Pearce","year":"2018","unstructured":"Pearce, R. H., & Forbes, M. (2018). Disaggregated benders decomposition for solving a network maintenance scheduling problem. Journal of the Operational Research Society, 70(6), 941\u2013953. https:\/\/doi.org\/10.1080\/01605682.2018.1471374","journal-title":"Journal of the Operational Research Society"},{"issue":"3","key":"5561_CR21","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1016\/J.EJOR.2016.12.005","volume":"259","author":"R Rahmaniani","year":"2017","unstructured":"Rahmaniani, R., Crainic, T. G., Gendreau, M., & Rei, W. (2017). The Benders decomposition algorithm: A literature review. European Journal of Operational Research, 259(3), 801\u2013817. https:\/\/doi.org\/10.1016\/J.EJOR.2016.12.005","journal-title":"European Journal of Operational Research"},{"key":"5561_CR22","doi-asserted-by":"publisher","DOI":"10.1080\/01605682.2020.1745699","author":"Z Seif","year":"2020","unstructured":"Seif, Z., Mardaneh, E., Loxton, R., & Lockwood, A. (2020). Minimizing equipment shutdowns in oil and gas campaign maintenance. Journal of the Operations Research Society. https:\/\/doi.org\/10.1080\/01605682.2020.1745699","journal-title":"Journal of the Operations Research Society"},{"issue":"6","key":"5561_CR23","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1057\/jors.2014.56","volume":"66","author":"JMP Siopa","year":"2015","unstructured":"Siopa, J. M. P., Gar\u00e7\u00e3o, J. E. S., & Silva, E. J. M. (2015). Component redundancy allocation in optimal cost preventive maintenance scheduling. Journal of the Operational Research Society, 66(6), 925\u2013935.","journal-title":"Journal of the Operational Research Society"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-023-05561-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-023-05561-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-023-05561-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T16:22:40Z","timestamp":1721060560000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-023-05561-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,15]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["5561"],"URL":"https:\/\/doi.org\/10.1007\/s10479-023-05561-6","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2023,9,15]]},"assertion":[{"value":"5 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 August 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 September 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflicts of interest regarding the research presented in this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}