{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T15:06:54Z","timestamp":1767625614357,"version":"3.33.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,1,25]],"date-time":"2025-01-25T00:00:00Z","timestamp":1737763200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,25]],"date-time":"2025-01-25T00:00:00Z","timestamp":1737763200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"DOI":"10.1007\/s42979-024-03642-2","type":"journal-article","created":{"date-parts":[[2025,1,25]],"date-time":"2025-01-25T05:36:05Z","timestamp":1737783365000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Iterative Local Search for the Single Machine Scheduling Problem with Periodic Machine Availability"],"prefix":"10.1007","volume":"6","author":[{"given":"Manisha","family":"Israni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9679-0892","authenticated-orcid":false,"given":"Shyam","family":"Sundar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,25]]},"reference":[{"issue":"5","key":"3642_CR1","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1007\/s42979-023-02042-2","volume":"4","author":"CP Kumar","year":"2023","unstructured":"Kumar CP, Shyam S. A steady-state genetic algorithm for the single machine scheduling problem with periodic machine availability. SN Comput Sci. 2023;4(5):651.","journal-title":"SN Comput Sci"},{"issue":"11","key":"3642_CR2","first-page":"3929","volume":"215","author":"C-J Hsu","year":"2010","unstructured":"Hsu C-J, Low C, Chwen-Tzeng S. A single-machine scheduling problem with maintenance activities to minimize makespan. Appl Math Comput. 2010;215(11):3929\u201335.","journal-title":"Appl Math Comput"},{"issue":"6","key":"3642_CR3","doi-asserted-by":"publisher","first-page":"1764","DOI":"10.1016\/j.cor.2005.05.034","volume":"34","author":"J Min","year":"2007","unstructured":"Min J, Yong H, Edwin CTC. Single-machine scheduling with periodic maintenance to minimize makespan. Comput Oper Res. 2007;34(6):1764\u201370.","journal-title":"Comput Oper Res"},{"issue":"3\u20134","key":"3642_CR4","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/BF00121681","volume":"9","author":"C-Y Lee","year":"1996","unstructured":"Lee C-Y. Machine scheduling with an availability constraint. J Glob Optim. 1996;9(3\u20134):395\u2013416.","journal-title":"J Glob Optim"},{"key":"3642_CR5","unstructured":"Louren\u00e7o Helena\u00a0R, Martin Olivier\u00a0C, Thomas S. Iterated local search. 2000."},{"key":"3642_CR6","doi-asserted-by":"crossref","unstructured":"Louren\u00e7o Helena\u00a0R, Martin Olivier\u00a0C, Thomas S. Iterated local search: framework and applications. In: Handbook of metaheuristics. Springer; 2010.","DOI":"10.1007\/978-1-4419-1665-5_12"},{"issue":"9","key":"3642_CR7","doi-asserted-by":"publisher","first-page":"6429","DOI":"10.1016\/j.eswa.2010.02.075","volume":"37","author":"C Low","year":"2010","unstructured":"Low C, Hsu C-J, Chwen-Tzeng S. A modified particle swarm optimization algorithm for a single-machine scheduling problem with periodic maintenance. Expert Syst Appl. 2010;37(9):6429\u201334.","journal-title":"Expert Syst Appl"},{"issue":"2","key":"3642_CR8","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1016\/j.apm.2009.04.014","volume":"34","author":"C Low","year":"2010","unstructured":"Low C, Ji M, Hsu C-J, Chwen-Tzeng S. Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance. Appl Math Model. 2010;34(2):334\u201342.","journal-title":"Appl Math Model"},{"key":"3642_CR9","unstructured":"Silvano M, Paolo T. Bin-packing problem,knapsack problems: algorithms and computer implementations. New York: Wiley. 1990. pp. 221\u201345."},{"key":"3642_CR10","doi-asserted-by":"crossref","unstructured":"Paz P-G, Framinan Jose M. Single machine scheduling with periodic machine availability. Comput Ind Eng. 2018;123:180\u20138.","DOI":"10.1016\/j.cie.2018.06.025"},{"issue":"1","key":"3642_CR11","doi-asserted-by":"publisher","first-page":"193","DOI":"10.2991\/ijcis.d.200214.003","volume":"13","author":"J Shen","year":"2020","unstructured":"Shen J, Zhu Y. A single machine scheduling with periodic maintenance and uncertain processing time. Int J Comput Intell Syst. 2020;13(1):193\u2013200.","journal-title":"Int J Comput Intell Syst"},{"key":"3642_CR12","unstructured":"Wilcoxon F. Wilcoxon signed-rank test calculator. https:\/\/www.socscistatistics.com\/tests\/signedranks\/default2.aspx."},{"issue":"3","key":"3642_CR13","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10951-013-0350-0","volume":"17","author":"Yu Xianyu","year":"2014","unstructured":"Xianyu Yu, Zhang Y, Steiner G. Single-machine scheduling with periodic maintenance to minimize makespan revisited. J Schedul. 2014;17(3):263\u201370.","journal-title":"J Schedul"},{"issue":"3","key":"3642_CR14","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/BF02011198","volume":"11","author":"M Yue","year":"1995","unstructured":"Yue M, Zhang L. A simple proof of the inequality mffd (l) $$\\le$$ 71\/60 opt (l)+ 1, l for the mffd bin-packing algorithm. Acta Mathematicae Applicatae Sinica. 1995;11(3):318\u201330.","journal-title":"Acta Mathematicae Applicatae Sinica"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-024-03642-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-024-03642-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-024-03642-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,25]],"date-time":"2025-01-25T05:36:10Z","timestamp":1737783370000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-024-03642-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,25]]},"references-count":14,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2025,2]]}},"alternative-id":["3642"],"URL":"https:\/\/doi.org\/10.1007\/s42979-024-03642-2","relation":{},"ISSN":["2661-8907"],"issn-type":[{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,25]]},"assertion":[{"value":"3 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 December 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2025","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 that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}],"article-number":"108"}}