{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:54Z","timestamp":1740122454070,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,4,19]],"date-time":"2023-04-19T00:00:00Z","timestamp":1681862400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,19]],"date-time":"2023-04-19T00:00:00Z","timestamp":1681862400000},"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":["12101593"],"award-info":[{"award-number":["12101593"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Postgraduate Research and Innovation Foundation of Yunnan University","award":["KC-22221282"],"award-info":[{"award-number":["KC-22221282"]}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["buctrc202219"],"award-info":[{"award-number":["buctrc202219"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Project of Yunling Scholars Training of Yunnan Province","award":["K264202011820"],"award-info":[{"award-number":["K264202011820"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s10878-023-01028-3","type":"journal-article","created":{"date-parts":[[2023,4,19]],"date-time":"2023-04-19T12:02:09Z","timestamp":1681905729000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties"],"prefix":"10.1007","volume":"45","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1508-1440","authenticated-orcid":false,"given":"Jianping","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Runtao","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junran","family":"Lichen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guojun","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pengxiang","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ping","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,19]]},"reference":[{"issue":"1","key":"1028_CR1","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1137\/S0895480196300522","volume":"13","author":"Y Bartal","year":"2000","unstructured":"Bartal Y, Leonardi S, Marchetti-Spaccamela A, Sgall J, Stougie L (2000) Multiprocessor scheduling with rejection. SIAM J Discrete Math 13(1):64\u201378","journal-title":"SIAM J Discrete Math"},{"key":"1028_CR2","volume-title":"Combinatorial optimization: theory and algorithms","author":"K Bernhard","year":"2008","unstructured":"Bernhard K, Vygen J (2008) Combinatorial optimization: theory and algorithms, 3rd edn. Springer, Berlin","edition":"3"},{"issue":"1","key":"1028_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0207001","volume":"7","author":"EG Coffman Jr","year":"1978","unstructured":"Coffman EG Jr, Garey MR, Johnson DS (1978) An application of bin-packing to multiprocessor scheduling. SIAM J Comput 7(1):1\u201317","journal-title":"SIAM J Comput"},{"issue":"4","key":"1028_CR4","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/0885-064X(87)90009-4","volume":"3","author":"EG Coffman Jr","year":"1987","unstructured":"Coffman EG Jr, Garey MR, Johnson DS (1987) Bin packing with divisible item sizes. J Complex 3(4):406\u2013428","journal-title":"J Complex"},{"issue":"11","key":"1028_CR5","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1016\/j.ipl.2009.02.003","volume":"109","author":"P Detti","year":"2009","unstructured":"Detti P (2009) A polynomial algorithm for the multiple knapsack problem with divisible item sizes. Inf Process Lett 109(11):582\u2013584","journal-title":"Inf Process Lett"},{"issue":"2","key":"1028_CR6","first-page":"107","volume":"9","author":"U Faigle","year":"1989","unstructured":"Faigle U, Kern W, Tur\u00e1n G (1989) On the performance of on-line algorithms for partition problems. Acta Cybernet 9(2):107\u2013119","journal-title":"Acta Cybernet"},{"issue":"9","key":"1028_CR7","doi-asserted-by":"publisher","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"RL Graham","year":"1966","unstructured":"Graham RL (1966) Bounds for certain multiprocessing anomalies. Bell Syst Tech J 45(9):1563\u20131581","journal-title":"Bell Syst Tech J"},{"issue":"2","key":"1028_CR8","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham RL (1969) Bounds on multiprocessing timing anomalies. SIAM J Appl Math 17(2):416\u2013429","journal-title":"SIAM J Appl Math"},{"key":"1028_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00021409","volume":"65","author":"Y He","year":"2000","unstructured":"He Y, Min X (2000) On-line uniform machine scheduling with rejection. Computing 65:1\u201312","journal-title":"Computing"},{"issue":"1","key":"1028_CR10","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"DS Hochbaum","year":"1987","unstructured":"Hochbaum DS, Shmoys DB (1987) Using dual approximation algorithms for scheduling problems theoretical and practical results. J ACM JACM 34(1):144\u2013162","journal-title":"J ACM JACM"},{"key":"1028_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Multidimensional knapsack problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer H, Pferschy U, Pisinger D, Kellerer H, Pferschy U, Pisinger D (2004) Multidimensional knapsack problems. Springer, Berlin"},{"key":"1028_CR12","volume-title":"The art of computer programming: fundamental algorithms","author":"DE Knuth","year":"1997","unstructured":"Knuth DE (1997) The art of computer programming: fundamental algorithms. Addison-Wesley, Boston"},{"key":"1028_CR13","first-page":"445","volume":"4","author":"EL Lawler","year":"1993","unstructured":"Lawler EL, Lenstra JK, Kan AHR, Shmoys DB (1993) Sequencing and scheduling: algorithms and complexity. Handb Oper Res Manag Sci 4:445\u2013522","journal-title":"Handb Oper Res Manag Sci"},{"key":"1028_CR14","first-page":"343","volume-title":"Annals of discrete mathematics","author":"JK Lenstra","year":"1977","unstructured":"Lenstra JK, Kan AR, Brucker P (1977) Complexity of machine scheduling problems. Annals of discrete mathematics, vol 1. Elsevier, Amsterdam, pp 343\u2013362"},{"key":"1028_CR15","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.tcs.2015.10.007","volume":"607","author":"W Li","year":"2015","unstructured":"Li W, Li J, Zhang X, Chen Z (2015) Penalty cost constrained identical parallel machine scheduling problem. Theoret Comput Sci 607:181\u2013192","journal-title":"Theoret Comput Sci"},{"key":"1028_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-2361-4","volume-title":"Scheduling","author":"ML Pinedo","year":"2012","unstructured":"Pinedo ML (2012) Scheduling, vol 29. Springer, Berlin"},{"key":"1028_CR17","doi-asserted-by":"publisher","first-page":"S41","DOI":"10.1057\/jors.2009.2","volume":"60","author":"CN Potts","year":"2009","unstructured":"Potts CN, Strusevich VA (2009) Fifty years of scheduling: a survey of milestones. J Oper Res Soc 60:S41\u2013S68","journal-title":"J Oper Res Soc"},{"key":"1028_CR18","volume-title":"Combinatorial optimization: polyhedra and efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver A et al (2003) Combinatorial optimization: polyhedra and efficiency, vol 24. Springer, Berlin"},{"key":"1028_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10951-012-0303-z","volume":"16","author":"D Shabtay","year":"2013","unstructured":"Shabtay D, Gaspar N, Kaspi M (2013) A survey on offline scheduling with rejection. J Sched 16:3\u201328","journal-title":"J Sched"},{"issue":"4","key":"1028_CR20","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1002\/1520-6750(199406)41:4<579::AID-NAV3220410409>3.0.CO;2-G","volume":"41","author":"D Simchi-Levi","year":"1994","unstructured":"Simchi-Levi D (1994) New worst-case results for the bin-packing problem. Naval Res Logist NRL 41(4):579\u2013585","journal-title":"Naval Res Logist NRL"},{"key":"1028_CR21","doi-asserted-by":"crossref","unstructured":"Zhang Y, Ren J, Wang C (2009) Scheduling with rejection to minimize the makespan. In: Combinatorial optimization and applications: third international conference, COCOA 2009, Huangshan, China, 10\u201312 June , 2009. Proceedings 3. Springer, pp. 411\u2013420","DOI":"10.1007\/978-3-642-02026-1_39"},{"key":"1028_CR22","doi-asserted-by":"crossref","unstructured":"Zheng S, Yue X, Chen Z (2018) Parallel machine scheduling with rejection under special conditions. In: Proceedings of the 8th international conference on communication and network security, pp 139\u2013143","DOI":"10.1145\/3290480.3290506"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01028-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-023-01028-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01028-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T03:40:55Z","timestamp":1685158855000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-023-01028-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,19]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1028"],"URL":"https:\/\/doi.org\/10.1007\/s10878-023-01028-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2023,4,19]]},"assertion":[{"value":"30 March 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2023","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 no conflict of interest. References","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"98"}}