{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T08:02:29Z","timestamp":1771660949992,"version":"3.50.1"},"reference-count":23,"publisher":"Zhejiang University Press","issue":"3","license":[{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"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":["Front Inform Technol Electron Eng"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1631\/fitee.2300767","type":"journal-article","created":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T23:20:23Z","timestamp":1743981623000},"page":"472-478","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An optimal algorithm for preemptive scheduling on non-simultaneously available uniform machines","\u975e\u540c\u65f6\u53ef\u7528\u540c\u7c7b\u673a\u53ef\u4e2d\u65ad\u8c03\u5ea6\u95ee\u9898\u7684\u6700\u4f18\u7b97\u6cd5"],"prefix":"10.1631","volume":"26","author":[{"given":"Hao","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Liping","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Qi","family":"Wei","sequence":"additional","affiliation":[]},{"given":"Zhenyu","family":"Shu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9779-0613","authenticated-orcid":false,"given":"Yiwei","family":"Jiang","sequence":"additional","affiliation":[]}],"member":"635","published-online":{"date-parts":[[2025,4,7]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/s0377-2217(02)00760-9"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/s0166-218x(99)00049-9"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/322047.322055"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-016-0501-1"},{"issue":"1","key":"ref5","first-page":"29","article-title":"Parametric LPT-bound on parallel machine scheduling with non-simultaneous available time","volume":"15","author":"He","year":"1998","journal-title":"Asia-Pac J Oper Res"},{"issue":"2","key":"ref6","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/BF02677672","article-title":"Uniform machine scheduling with machine available constraints","volume":"16","author":"He","year":"2000","journal-title":"Acta Math Appl Sin"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/321992.321995"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-017-0551-z"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2013.10.022"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2018.1471242"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.24867\/ijiem-2024-1-345"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218x(91)90013-m"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1023\/a:1018909801944"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/s0166-218x(99)00201-2"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/800182.810377"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12589"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.6.1.1"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/321574.321586"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2023.109219"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/bf01920917"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2012.09.053"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2014.05.003"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1142\/s0217595915500499"}],"container-title":["Frontiers of Information Technology & Electronic Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1631\/FITEE.2300767.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1631\/FITEE.2300767\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1631\/FITEE.2300767.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T07:06:55Z","timestamp":1771657615000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1631\/FITEE.2300767"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["767"],"URL":"https:\/\/doi.org\/10.1631\/fitee.2300767","relation":{},"ISSN":["2095-9184","2095-9230"],"issn-type":[{"value":"2095-9184","type":"print"},{"value":"2095-9230","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3]]},"assertion":[{"value":"9 November 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"All the authors declare that they have no conflict of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}