{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T22:33:59Z","timestamp":1772490839841,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,8,4]],"date-time":"2025-08-04T00:00:00Z","timestamp":1754265600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,4]],"date-time":"2025-08-04T00:00:00Z","timestamp":1754265600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"NSERC Canada"},{"name":"NNSF China","award":["72301205"],"award-info":[{"award-number":["72301205"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1007\/s10951-025-00850-3","type":"journal-article","created":{"date-parts":[[2025,8,4]],"date-time":"2025-08-04T16:34:00Z","timestamp":1754325240000},"page":"513-527","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Multiprocessor scheduling with testing: improved online algorithms and numerical experiments"],"prefix":"10.1007","volume":"28","author":[{"given":"Mingyang","family":"Gong","sequence":"first","affiliation":[]},{"given":"Jing","family":"Fan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4283-3396","authenticated-orcid":false,"given":"Guohui","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Bing","family":"Su","sequence":"additional","affiliation":[]},{"given":"Zihan","family":"Su","sequence":"additional","affiliation":[]},{"given":"Xiang","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,4]]},"reference":[{"key":"850_CR1","doi-asserted-by":"crossref","unstructured":"Albers, S., & Eckl, A. (2020). Explorable uncertainty in scheduling with non-uniform testing times. In Proceedings of WAOA 2020, LNCS 12806, (pp. 127\u2013142). A full version appears as arXiv:2009.13316 in Computing Research Repository.","DOI":"10.1007\/978-3-030-80879-2_9"},{"key":"850_CR2","doi-asserted-by":"crossref","unstructured":"Albers, S., & Eckl, A. (2021). Scheduling with testing on multiple identical parallel machines. In Proceedings of WADS 2021, LNCS 12808, (pp. 29\u201342). A full version appears as arXiv:2105.02052 in Computing Research Repository.","DOI":"10.1007\/978-3-030-83508-8_3"},{"key":"850_CR3","first-page":"33","volume":"78","author":"M Dell\u2019Amico","year":"2008","unstructured":"Dell\u2019Amico, M., Iori, M., Martello, S., & Monaci, M. (2008). Heuristic and exact algorithms for the identical parallel machine scheduling problem. Informs Journal on Computing, 78, 33\u2013344.","journal-title":"Informs Journal on Computing"},{"key":"850_CR4","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/j.apm.2021.12.020","volume":"104","author":"F Dufoss\u00e9","year":"2022","unstructured":"Dufoss\u00e9, F., D\u00fcrr, C., Nadal, N., Trystram, D., & V\u00e1squez, \u00d3. C. (2022). Scheduling with a processing time oracle. Applied Mathematical Modelling, 104, 701\u2013720.","journal-title":"Applied Mathematical Modelling"},{"key":"850_CR5","unstructured":"D\u00fcrr, C., Erlebach, T., Megow, N., & Mei\u00dfner, J. (2018). Scheduling with explorable uncertainty. In Proceedings of ITCS 2018, LIPIcs 94, (pp. 30:1\u201330:14)."},{"key":"850_CR6","doi-asserted-by":"publisher","first-page":"3630","DOI":"10.1007\/s00453-020-00742-2","volume":"82","author":"C D\u00fcrr","year":"2020","unstructured":"D\u00fcrr, C., Erlebach, T., Megow, N., & Mei\u00dfner, J. (2020). An adversarial model for scheduling with testing. Algorithmica, 82, 3630\u20133675.","journal-title":"Algorithmica"},{"key":"850_CR7","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0305-0548(94)90053-1","volume":"21","author":"PM Fran\u00e7a","year":"1994","unstructured":"Fran\u00e7a, P. M., Gendreau, M., Laporte, G., & M\u00fcller, F. M. (1994). A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective. Computers & Operations Research, 21, 205\u2013210.","journal-title":"Computers & Operations Research"},{"key":"850_CR8","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1023\/B:JOCO.0000031420.05971.29","volume":"8","author":"A Frangioni","year":"2004","unstructured":"Frangioni, A., Necciari, E., & Scutell\u00e1, M. G. (2004). A multi-exchange neighborhood for minimum makespan machine scheduling problems. Journal of Combinatorial Optimization, 8, 195\u2013220.","journal-title":"Journal of Combinatorial Optimization"},{"key":"850_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-completeness. San Francisco: W. H. Freeman and Company."},{"key":"850_CR10","doi-asserted-by":"publisher","first-page":"1400","DOI":"10.1007\/s00453-023-01198-w","volume":"86","author":"M Gong","year":"2024","unstructured":"Gong, M., Chen, Z.-Z., & Hayashi, K. (2024). (a.k.a. G.\u00a0Lin) Approximation algorithms for multiprocessor scheduling with testing to minimize the total job completion time. Algorithmica, 86, 1400\u20131427.","journal-title":"Algorithmica"},{"key":"850_CR11","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1007\/s10878-022-00865-y","volume":"44","author":"M Gong","year":"2022","unstructured":"Gong, M., Goebel, R., Lin, G., & Miyano, E. (2022). Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing. Journal of Combinatorial Optimization, 44, 877\u2013893.","journal-title":"Journal of Combinatorial Optimization"},{"key":"850_CR12","doi-asserted-by":"crossref","unstructured":"Gong, M., & Lin, G. (2021). Improved approximation algorithms for multiprocessor scheduling with testing. In Proceedings of FAW 2021, LNCS 12874, pp. 65\u201377.","DOI":"10.1007\/978-3-030-97099-4_5"},{"key":"850_CR13","first-page":"1563","volume":"45","author":"RL Graham","year":"1966","unstructured":"Graham, R. L. (1966). Bounds for certain multiprocessing anomalies. Bell Labs Technical Journal, 45, 1563\u20131581.","journal-title":"Bell Labs Technical Journal"},{"key":"850_CR14","first-page":"265","volume":"1991","author":"S Kahan","year":"1991","unstructured":"Kahan, S. (1991). A model for data in motion. In Proceedings of STOC, 1991, 265\u2013277.","journal-title":"In Proceedings of STOC"},{"key":"850_CR15","doi-asserted-by":"crossref","unstructured":"Liu, A.\u00a0H.-H., Liu, F.-H., Wong, P.\u00a0W.\u00a0H., & Zhang, X.-O. (2023). The power of amortization on scheduling with explorable uncertainty. In Proceedings of WAOA 2023, LNCS 14297, (pp. 90\u2013103).","DOI":"10.1007\/978-3-031-49815-2_7"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-025-00850-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-025-00850-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-025-00850-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T03:51:13Z","timestamp":1759031473000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-025-00850-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,4]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["850"],"URL":"https:\/\/doi.org\/10.1007\/s10951-025-00850-3","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,4]]},"assertion":[{"value":"1 July 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 August 2025","order":2,"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 known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}