{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:42:08Z","timestamp":1740145328767,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,10,17]],"date-time":"2019-10-17T00:00:00Z","timestamp":1571270400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,17]],"date-time":"2019-10-17T00:00:00Z","timestamp":1571270400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71671090","71871117"],"award-info":[{"award-number":["71671090","71871117"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["71811530338"],"award-info":[{"award-number":["71811530338"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["NP2018466"],"award-info":[{"award-number":["NP2018466"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Qinglan Project for excellent youth or middle-aged academic leaders in Jiangsu Province"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s10100-019-00655-8","type":"journal-article","created":{"date-parts":[[2019,10,17]],"date-time":"2019-10-17T19:32:40Z","timestamp":1571340760000},"page":"671-684","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Single workgroup scheduling problem with variable processing personnel"],"prefix":"10.1007","volume":"28","author":[{"given":"Bentao","family":"Su","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6574-0702","authenticated-orcid":false,"given":"Naiming","family":"Xie","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,17]]},"reference":[{"key":"655_CR1","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.ejor.2013.08.011","volume":"233","author":"C Alves","year":"2014","unstructured":"Alves C, de Carvalho JV, Clautiaux F, Rietz J (2014) Multi dimensional dual-feasible functions and fast lower bounds for the vector packing problem. Eur J Oper Res 233:43\u201363","journal-title":"Eur J Oper Res"},{"issue":"1","key":"655_CR2","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.ejor.2014.11.036","volume":"243","author":"J-C Billaut","year":"2015","unstructured":"Billaut J-C, Della Croce F, Grosso A (2015) A single machine scheduling problem with two-dimensional vector packing constraints. Eur J Oper Res 243(1):75\u201381","journal-title":"Eur J Oper Res"},{"issue":"4","key":"655_CR3","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1287\/opre.1040.0109","volume":"52","author":"EK Burke","year":"2004","unstructured":"Burke EK, Kendall G, Whitwell G (2004) A new placement heuristic for the orthogonal stock-cutting problem. Oper Res 52(4):655\u2013671. \nhttps:\/\/doi.org\/10.1287\/opre.1040.0109","journal-title":"Oper Res"},{"issue":"1","key":"655_CR4","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.cie.2013.05.016","volume":"66","author":"N Dahmani","year":"2013","unstructured":"Dahmani N, Clautiaux Fran\u00e7ois, Krichen S, Talbi EG (2013) Iterative approaches for solving a multi-objective 2-dimensional vector packing problem. Comput Ind Eng 66(1):158\u2013170","journal-title":"Comput Ind Eng"},{"issue":"2","key":"655_CR5","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0377-2217(02)00124-8","volume":"141","author":"JMV De Carvalho","year":"2002","unstructured":"De Carvalho JMV (2002) Lp models for bin packing and cutting stock problems. Eur J Oper Res 141(2):253\u2013273","journal-title":"Eur J Oper Res"},{"issue":"1","key":"655_CR6","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s10100-017-0481-z","volume":"26","author":"Gy\u00f6rgy D\u00f3sa","year":"2018","unstructured":"D\u00f3sa Gy\u00f6rgy, F\u00fcgenschuh Armin, Tan Z et al (2018) Tight upper bounds for semi-online scheduling on two uniform machines with known optimum. Cent Eur J Oper Res 26(1):161\u2013180","journal-title":"Cent Eur J Oper Res"},{"issue":"2","key":"655_CR7","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1016\/j.ejor.2017.01.002","volume":"260","author":"L Fanjul-Peyro","year":"2017","unstructured":"Fanjul-Peyro L, Perea F, Ruiz Rub\u00e9n (2017) Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources. Eur J Oper Res 260(2):482\u2013493","journal-title":"Eur J Oper Res"},{"issue":"11","key":"655_CR8","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1016\/S0305-0548(98)00008-2","volume":"25","author":"M Hifi","year":"1998","unstructured":"Hifi M (1998) Exact algorithms for the guillotine strip cutting\/packing problem. Comput Oper Res 25(11):925\u2013940","journal-title":"Comput Oper Res"},{"issue":"1","key":"655_CR9","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10100-017-0489-4","volume":"27","author":"Mark\u00f3 Horv\u00e1th","year":"2019","unstructured":"Horv\u00e1th Mark\u00f3, Kis Tam\u00e1s (2019) Computing strong lower and upper bounds for the integrated multiple- depot vehicle and crew scheduling problem with branch-and-price. Cent Eur J Oper Res 27(1):39\u201367","journal-title":"Cent Eur J Oper Res"},{"key":"655_CR10","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.omega.2014.07.004","volume":"50","author":"Q Hu","year":"2015","unstructured":"Hu Q, Lim A, Zhu W (2015) The two-dimensional vector packing problem with piecewise linear cost function. Omega 50:43\u201353","journal-title":"Omega"},{"issue":"1","key":"655_CR11","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.ejor.2018.04.046","volume":"271","author":"VM Kartak","year":"2018","unstructured":"Kartak VM, Ripatti AV (2018) The minimum raster set problem and its application to the d -dimensional orthogonal packing problem. Eur J Oper Res 271(1):33\u201339","journal-title":"Eur J Oper Res"},{"issue":"1\u20132","key":"655_CR12","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s10479-017-2615-z","volume":"261","author":"HJ Kim","year":"2018","unstructured":"Kim HJ (2018) Bounds for parallel machine scheduling with predefined parts of jobs and setup time. Ann Oper Res 261(1\u20132):401\u2013412","journal-title":"Ann Oper Res"},{"key":"655_CR13","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/S0167-5060(08)70742-8","volume":"1","author":"EL Lawler","year":"1977","unstructured":"Lawler EL (1977) A \u201cPseudopolynomial\u201d algorithm for sequencing jobs to minimize total tardiness. Ann Discret Math 1:331\u2013342. \nhttps:\/\/doi.org\/10.1016\/S0167-5060(08)70742-8","journal-title":"Ann Discret Math"},{"key":"655_CR14","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.ipl.2004.01.006","volume":"90","author":"N Lesh","year":"2004","unstructured":"Lesh N, Marks J, McMahon A, Mitzenmacher M (2004) Exhaustive approaches to 2D rectanglar perfect packings. Inform Process Lett 90:7\u201314","journal-title":"Inform Process Lett"},{"key":"655_CR15","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1287\/opre.8.2.219","volume":"8","author":"AS Manne","year":"1960","unstructured":"Manne AS (1960) On the job-shop scheduling problem. Oper Res 8:219\u2013223","journal-title":"Oper Res"},{"key":"655_CR16","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.endm.2018.01.004","volume":"64","author":"F Marinelli","year":"2018","unstructured":"Marinelli F, Pizzuti A (2018) A sequential value correction heuristic for a bi-objective two-dimensional bin-packing. Electron Notes Discret Math 64:25\u201334","journal-title":"Electron Notes Discret Math"},{"issue":"3","key":"655_CR17","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1287\/ijoc.15.3.310.16082","volume":"15","author":"S Martello","year":"2003","unstructured":"Martello S, Monaci M, Vigo D (2003) An exact approach to the strip-packing problem. Informs J Comput 15(3):310\u2013319. \nhttps:\/\/doi.org\/10.1287\/ijoc.15.3.310.16082","journal-title":"Informs J Comput"},{"issue":"10","key":"655_CR18","doi-asserted-by":"publisher","first-page":"2600","DOI":"10.3724\/SP.J.1001.2012.04187","volume":"23","author":"BT Peng","year":"2012","unstructured":"Peng BT, Zhou YW (2012) Recursive heuristic algorithm for the 2D rectangular strip packing problem. J Softw 23(10):2600\u20132611 (in Chinese)","journal-title":"J Softw"},{"issue":"3","key":"655_CR19","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1016\/j.ejor.2017.10.046","volume":"266","author":"S Polyakovskiy","year":"2018","unstructured":"Polyakovskiy S, M\u2019Hallah Rym (2018) A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates. Eur J Oper Res 266(3):818\u2013839","journal-title":"Eur J Oper Res"},{"issue":"5\u20138","key":"655_CR20","doi-asserted-by":"publisher","first-page":"1923","DOI":"10.1007\/s00170-016-8879-7","volume":"88","author":"R Rajkanth","year":"2017","unstructured":"Rajkanth R, Rajendran C, Ziegler H (2017) Heuristics to minimize the completion time variance of jobs on a single machine and on identical parallel machines. Int J Adv Manuf Technol 88(5\u20138):1923\u20131936","journal-title":"Int J Adv Manuf Technol"},{"key":"655_CR21","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1016\/j.psep.2016.09.013","volume":"104","author":"JFD Tapia","year":"2016","unstructured":"Tapia JFD, Lee J-Y, Ooi REH, Foo DCY, Tan RR (2016) Planning and scheduling of CO 2 capture, utilization and storage (CCUS) operations as a strip packing problem. Process Saf Environ 104:358\u2013372. \nhttps:\/\/doi.org\/10.1016\/j.psep.2016.09.013","journal-title":"Process Saf Environ"},{"issue":"3","key":"655_CR22","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1142\/S0129065791000182","volume":"2","author":"MM Van Hulle","year":"1991","unstructured":"Van Hulle MM (1991) A goal programming network for mixed integer linear programming: a case study for the job-shop scheduling problem. Int J Neural Syst 2(3):201\u2013209","journal-title":"Int J Neural Syst"},{"issue":"1","key":"655_CR23","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s10100-015-0429-0","volume":"25","author":"R Walter","year":"2017","unstructured":"Walter R (2017) A note on minimizing the sum of squares of machine completion times on two identical parallel machines. Cent Eur J Oper Res 25(1):139\u2013144","journal-title":"Cent Eur J Oper Res"},{"issue":"1","key":"655_CR24","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.ipl.2015.08.008","volume":"116","author":"D Zhang","year":"2016","unstructured":"Zhang D, Shi L, Leung SCH, Wu T (2016) A priority heuristic for the guillotine rectangular packing problem. Inform Process Lett 116(1):15\u201321","journal-title":"Inform Process Lett"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-019-00655-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-019-00655-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-019-00655-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T23:33:52Z","timestamp":1602804832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-019-00655-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,17]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["655"],"URL":"https:\/\/doi.org\/10.1007\/s10100-019-00655-8","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"type":"print","value":"1435-246X"},{"type":"electronic","value":"1613-9178"}],"subject":[],"published":{"date-parts":[[2019,10,17]]},"assertion":[{"value":"17 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}