{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T11:19:33Z","timestamp":1770463173384,"version":"3.49.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,8,17]],"date-time":"2023-08-17T00:00:00Z","timestamp":1692230400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,17]],"date-time":"2023-08-17T00:00:00Z","timestamp":1692230400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071427"],"award-info":[{"award-number":["12071427"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s10951-023-00790-w","type":"journal-article","created":{"date-parts":[[2023,8,17]],"date-time":"2023-08-17T17:02:24Z","timestamp":1692291744000},"page":"277-297","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Scheduling with periodic availability constraints to minimize makespan"],"prefix":"10.1007","volume":"27","author":[{"given":"Lishi","family":"Yu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4714-5448","authenticated-orcid":false,"given":"Zhiyi","family":"Tan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,17]]},"reference":[{"key":"790_CR1","unstructured":"Baase, S., & Van Gelder, A. (1999). Computer algorithms: Introduction to design and analysis. Addison Wesley."},{"key":"790_CR2","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF02579456","volume":"1","author":"Vega W de la Fernandez","year":"1981","unstructured":"de la Fernandez, Vega W., & Lueker, G. S. (1981). Bin packing can be solved within $$1+\\epsilon $$ in linear time. Combinatorica, 1, 349\u2013355.","journal-title":"Combinatorica"},{"key":"790_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-74450-4_1","volume":"4614","author":"G D\u00f3sa","year":"2007","unstructured":"D\u00f3sa, G. (2007). The tight bound of first fit decreasing bin-packing algorithm is $$FFD(L)\\le \\frac{11}{9}OPT(L)+\\frac{6}{9}$$. Lecture Notes in Computer Science, 4614, 1\u201311.","journal-title":"Lecture Notes in Computer Science"},{"key":"790_CR4","doi-asserted-by":"crossref","unstructured":"Gawiejnowicz, S. (2020a). A review of four decades of time-dependent scheduling: Main results, new topics, and open problems. Journal of Scheduling,23, 3\u201347.","DOI":"10.1007\/s10951-019-00630-w"},{"key":"790_CR5","doi-asserted-by":"crossref","unstructured":"Gawiejnowicz, S. (2020b). Models and algorithms of time-dependent scheduling. Springer.","DOI":"10.1007\/978-3-662-59362-2"},{"key":"790_CR6","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1016\/j.ejor.2006.04.021","volume":"180","author":"S Gawiejnowicz","year":"2007","unstructured":"Gawiejnowicz, S. (2007). Scheduling deteriorating jobs subject to job or machine availability constraints. European Journal of Operational Research, 180, 472\u2013478.","journal-title":"European Journal of Operational Research"},{"key":"790_CR7","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/j.ejor.2008.12.014","volume":"200","author":"S Gawiejnowicz","year":"2010","unstructured":"Gawiejnowicz, S., & Kononov, A. (2010). Complexity and approximability of scheduling resumable proportionally deteriorating jobs. European Journal of Operational Research, 200, 305\u2013308.","journal-title":"European Journal of Operational Research"},{"key":"790_CR8","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham, R. L. (1969). Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics, 17, 416\u2013429.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"790_CR9","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.tcs.2006.06.006","volume":"362","author":"M Ji","year":"2006","unstructured":"Ji, M., He, Y., & Cheng, T. C. E. (2006). Scheduling linear deteriorating jobs with an availability constraint on a single machine. Theoretical Computer Science, 362, 115\u2013126.","journal-title":"Theoretical Computer Science"},{"key":"790_CR10","doi-asserted-by":"publisher","first-page":"1764","DOI":"10.1016\/j.cor.2005.05.034","volume":"34","author":"M Ji","year":"2007","unstructured":"Ji, M., He, Y., & Cheng, T. C. E. (2007). Single-machine scheduling with periodic maintenance to minimize makespan. Computers and Operations Research, 34, 1764\u20131770.","journal-title":"Computers and Operations Research"},{"key":"790_CR11","unstructured":"Johnson, D. S. (1973). Near-optimal bin packing algorithms. Doctoral Thesis, MIT."},{"key":"790_CR12","doi-asserted-by":"crossref","unstructured":"Karmarkar, N., & Karp, R. M. (1982). An efficient approximation scheme for the one-dimensional binpacking problem. Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (pp. 312-320).","DOI":"10.1109\/SFCS.1982.61"},{"key":"790_CR13","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/BF00121681","volume":"9","author":"CY Lee","year":"1996","unstructured":"Lee, C. Y. (1996). Machine scheduling with an availability constraint. Journal of Global Optimization, 9, 363\u2013382.","journal-title":"Journal of Global Optimization"},{"key":"790_CR14","unstructured":"Lee, C. Y. (2004). Machine scheduling with an availability constraint. In Leung, J. Y. T. (Eds.), Handbook of scheduling: Algorithms, models, and performance analysis. CRC."},{"key":"790_CR15","doi-asserted-by":"publisher","first-page":"685","DOI":"10.3934\/jimo.2015.11.685","volume":"11","author":"G Li","year":"2015","unstructured":"Li, G., & Lu, X. (2015). Two-machine scheduling with periodic availability constraints to minimize makespan. Journal of Industrial and Management Optimization, 11, 685\u2013700.","journal-title":"Journal of Industrial and Management Optimization"},{"key":"790_CR16","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.cie.2009.04.014","volume":"58","author":"Y Ma","year":"2010","unstructured":"Ma, Y., Chu, C., & Zuo, C. (2010). A survey of scheduling with deterministic machine availability constraints. Computers and Industrial Engineering, 58, 199\u2013211.","journal-title":"Computers and Industrial Engineering"},{"key":"790_CR17","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1016\/j.dam.2006.06.005","volume":"155","author":"X Qi","year":"2007","unstructured":"Qi, X. (2007). A note on worst-case performance of heuristic of maintenance scheduling problems. Discrete Applied Mathematics, 155, 416\u2013422.","journal-title":"Discrete Applied Mathematics"},{"key":"790_CR18","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1057\/palgrave.jors.2600791","volume":"50","author":"X Qi","year":"1999","unstructured":"Qi, X., Chen, T., & Tu, F. (1999). Scheduling the maintenance on a single machine. Journal of Operational of Research Society, 50, 1071\u20131078.","journal-title":"Journal of Operational of Research Society"},{"key":"790_CR19","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.ijpe.2009.10.018","volume":"124","author":"K Sun","year":"2010","unstructured":"Sun, K., & Li, H. (2010). Scheduling problems with multiple maintenance activities and non-preemptive jobs on two identical parallel machine. International Journal of Production Economics, 124, 151\u2013158.","journal-title":"International Journal of Production Economics"},{"key":"790_CR20","unstructured":"Vazirani, V. V. (2001). Approximation algorithms. Springer."},{"key":"790_CR21","doi-asserted-by":"crossref","unstructured":"Xu, D., Cheng, Z., Yin, Q., & Li, H. (2009a). Makespan minimization for two parallel machines scheduling with a periodic availability constraint. Computers & Operations Research,36, 1809\u20131812.","DOI":"10.1016\/j.cor.2008.05.001"},{"key":"790_CR22","doi-asserted-by":"crossref","unstructured":"Xu, D., Sun, K., & Li, H. (2008). Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan. Computers & Operations Research, 35, 1344\u20131349.","DOI":"10.1016\/j.cor.2006.08.015"},{"key":"790_CR23","doi-asserted-by":"crossref","unstructured":"Xu, D., Yin, Y., & Li, H. (2009). A note on \u201cscheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan.\u201d European Journal of Operational Research, 197, 825\u2013827.","DOI":"10.1016\/j.ejor.2008.07.021"},{"key":"790_CR24","doi-asserted-by":"crossref","unstructured":"Yu, X., Zhang, Y., & Steiner, G. (2014). Single-machine scheduling with periodic maintenance to minimize makespan revisited. Journal of Scheduling, 17, 264\u2013270.","DOI":"10.1007\/s10951-013-0350-0"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-023-00790-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-023-00790-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-023-00790-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T07:19:12Z","timestamp":1747293552000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-023-00790-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,17]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["790"],"URL":"https:\/\/doi.org\/10.1007\/s10951-023-00790-w","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,17]]},"assertion":[{"value":"11 July 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 August 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}