{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T10:52:26Z","timestamp":1769338346355,"version":"3.49.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,1,19]],"date-time":"2019-01-19T00:00:00Z","timestamp":1547856000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,1,19]],"date-time":"2019-01-19T00:00:00Z","timestamp":1547856000000},"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":["71231004"],"award-info":[{"award-number":["71231004"]}],"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":"publisher","award":["71601065"],"award-info":[{"award-number":["71601065"]}],"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":"publisher","award":["71690235"],"award-info":[{"award-number":["71690235"]}],"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":"publisher","award":["71501058"],"award-info":[{"award-number":["71501058"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Innovative Research Blocks of the National Natural Science Foundation of China","award":["71521001"],"award-info":[{"award-number":["71521001"]}]},{"name":"Humanities and Social Sciences Foundation of the Chinese Ministry of Education","award":["15YJC630097"],"award-info":[{"award-number":["15YJC630097"]}]},{"name":"Anhui Province Natural Science Foundation","award":["1608085QG167"],"award-info":[{"award-number":["1608085QG167"]}]},{"name":"project of Distinguished International Professor by the Chinese Ministry of Education","award":["MS2014HFGY026"],"award-info":[{"award-number":["MS2014HFGY026"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s11590-019-01389-x","type":"journal-article","created":{"date-parts":[[2019,1,19]],"date-time":"2019-01-19T09:37:08Z","timestamp":1547890628000},"page":"857-871","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine"],"prefix":"10.1007","volume":"14","author":[{"given":"Min","family":"Kong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinbao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Pei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiping","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,19]]},"reference":[{"key":"1389_CR1","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1080\/00207549408957026","volume":"32","author":"R Uzsoy","year":"1994","unstructured":"Uzsoy, R.: Scheduling a single batch processing machine with non-identical job sizes. Int. J. Prod. Res. 32, 1615\u20131635 (1994)","journal-title":"Int. J. Prod. Res."},{"issue":"3","key":"1389_CR2","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1002\/nav.4","volume":"48","author":"G Zhang","year":"2001","unstructured":"Zhang, G., Cai, X., Lee, C.Y., et al.: Minimizing makespan on a single batch processing machine with non-identical job sizes. Naval Res. Logist. (NRL) 48(3), 226\u2013240 (2001)","journal-title":"Naval Res. Logist. (NRL)"},{"issue":"1\u20134","key":"1389_CR3","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s00170-013-5263-8","volume":"70","author":"J Pei","year":"2014","unstructured":"Pei, J., Liu, X., Pardalos, P.M., Fan, W., Yang, S., Wang, L.: Application of an effective modified gravitational search algorithm for the coordinated scheduling problem in a two-stage supply chain. Int. J. Adv. Manuf. Technol. 70(1\u20134), 335\u2013348 (2014)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"4","key":"1389_CR4","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1080\/00207721.2014.902553","volume":"47","author":"J Pei","year":"2016","unstructured":"Pei, J., Liu, X., Pardalos, P.M., Fan, W., Wang, L., Yang, S.: Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm. Int. J. Syst. Sci. 47(4), 765\u2013776 (2016)","journal-title":"Int. J. Syst. Sci."},{"issue":"5\u20138","key":"1389_CR5","doi-asserted-by":"publisher","first-page":"1887","DOI":"10.1007\/s00170-016-9156-5","volume":"89","author":"L Jiang","year":"2017","unstructured":"Jiang, L., Pei, J., Liu, X., et al.: Uniform parallel batch machines scheduling considering transportation using a hybrid DPSO-GA algorithm. Int. J. Adv. Manuf. Technol. 89(5\u20138), 1887\u20131900 (2017)","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"1389_CR6","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.cie.2016.09.018","volume":"101","author":"N Suhaimi","year":"2016","unstructured":"Suhaimi, N., Nguyen, C., Damodaran, P.: Lagrangian approach to minimize makespan of non-identical parallel batch processing machines. Comput. Ind. Eng. 101, 295\u2013302 (2016)","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"1389_CR7","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/j.ejor.2012.04.008","volume":"221","author":"A Malapert","year":"2012","unstructured":"Malapert, A., Gu\u00e9ret, C., Rousseau, L.M.: A constraint programming approach for a batch processing problem with non-identical job sizes. Eur. J. Oper. Res. 221(3), 533\u2013545 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"1389_CR8","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/j.asoc.2015.01.013","volume":"29","author":"M Al-Salamah","year":"2015","unstructured":"Al-Salamah, M.: Constrained binary artificial bee colony to minimize the makespan for single machine batch processing with non-identical job sizes. Appl. Soft Comput. 29, 379\u2013385 (2015)","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"1389_CR9","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1287\/ijoc.2017.0746","volume":"29","author":"T Wu","year":"2017","unstructured":"Wu, T., Akartunal\u0131, K., Jans, R., Liang, Z.: Progressive selection method for the coupled lot-sizing and cutting-stock problem. INFORMS J. Comput. 29(3), 523\u2013543 (2017)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"1389_CR10","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1111\/deci.12173","volume":"47","author":"Y Tan","year":"2016","unstructured":"Tan, Y., Carrillo, J.E., Cheng, H.K.: The agency model for digital goods. Decis. Sci. 47(4), 628\u2013660 (2016)","journal-title":"Decis. Sci."},{"issue":"4","key":"1389_CR11","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1111\/poms.12595","volume":"26","author":"YR Tan","year":"2017","unstructured":"Tan, Y.R., Carrillo, J.E.: Strategic analysis of the agency model for digital goods. Prod. Oper. Manag. 26(4), 724\u2013741 (2017)","journal-title":"Prod. Oper. Manag."},{"issue":"1","key":"1389_CR12","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., et al.: Multiprocessor scheduling with rejection. SIAM J. Discrete Math. 13(1), 64\u201378 (2000)","journal-title":"SIAM J. Discrete Math."},{"issue":"1\u20133","key":"1389_CR13","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.tcs.2008.02.015","volume":"396","author":"L Lu","year":"2008","unstructured":"Lu, L., Zhang, L., Yuan, J.: The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan. Theoret. Comput. Sci. 396(1\u20133), 283\u2013289 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"1389_CR14","doi-asserted-by":"crossref","unstructured":"Feng, H., Liu, H.: Minimizing makespan on an unbounded parallel batch processor with rejection and release times. In: 2009 WRI World Congress on Computer Science and Information Engineering. IEEE, vol. 2, pp. 587\u2013590 (2009)","DOI":"10.1109\/CSIE.2009.136"},{"issue":"3","key":"1389_CR15","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1057\/jors.2011.31","volume":"63","author":"LQ Zhang","year":"2012","unstructured":"Zhang, L.Q., Lu, L.F., Ng, C.T.: The unbounded parallel-batch scheduling with rejection. J. Oper. Res. Soc. 63(3), 293\u2013298 (2012)","journal-title":"J. Oper. Res. Soc."},{"key":"1389_CR16","first-page":"3","volume":"16","author":"J Zou","year":"2014","unstructured":"Zou, J., Miao, C.: Parallel batch scheduling of deteriorating jobs with release dates and rejection. Sci. World J. 16, 3\u201328 (2014)","journal-title":"Sci. World J."},{"issue":"27\u201329","key":"1389_CR17","doi-asserted-by":"publisher","first-page":"2732","DOI":"10.1016\/j.tcs.2009.04.006","volume":"410","author":"Z Cao","year":"2009","unstructured":"Cao, Z., Yang, X.: A PTAS for parallel batch scheduling with rejection and dynamic job arrivals. Theoret. Comput. Sci. 410(27\u201329), 2732\u20132745 (2009)","journal-title":"Theoret. Comput. Sci."},{"issue":"10","key":"1389_CR18","doi-asserted-by":"publisher","first-page":"2748","DOI":"10.1016\/j.cor.2008.12.003","volume":"36","author":"L Lu","year":"2009","unstructured":"Lu, L., Cheng, T.C.E., Yuan, J., et al.: Bounded single-machine parallel-batch scheduling with release dates and rejection. Comput. Oper. Res. 36(10), 2748\u20132751 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"1389_CR19","first-page":"64","volume":"54","author":"C Miao","year":"2017","unstructured":"Miao, C., Meng, F.: Parallel-batch scheduling with deterioration and rejection on a single machine. AMSE J. AMSE IIETA Publ. 2017 Ser. Adv. A 54(1), 64\u201374 (2017)","journal-title":"AMSE J. AMSE IIETA Publ. 2017 Ser. Adv. A"},{"issue":"4","key":"1389_CR20","first-page":"1","volume":"2017","author":"C Miao","year":"2017","unstructured":"Miao, C., Meng, F., Zou, J., et al.: Batch scheduling with proportional-linear deterioration and outsourcing. Math. Probl. Eng. 2017(4), 1\u20135 (2017)","journal-title":"Math. Probl. Eng."},{"issue":"1","key":"1389_CR21","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.cor.2009.03.019","volume":"37","author":"CT Ng","year":"2010","unstructured":"Ng, C.T., Wang, J.B., Cheng, T.C.E., et al.: A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs. Comput. Oper. Res. 37(1), 83\u201390 (2010)","journal-title":"Comput. Oper. Res."},{"key":"1389_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2017.12.003","author":"J Pei","year":"2017","unstructured":"Pei, J., Liu, X., Fan, W., Pardalos, P.M., Lu, S.: A hybrid BA-VNS algorithm for coordinated serial-batching scheduling with deteriorating jobs, financial budget, and resource constraint in multiple manufacturers. Omega (2017). \n                  https:\/\/doi.org\/10.1016\/j.omega.2017.12.003","journal-title":"Omega"},{"key":"1389_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-017-2481-8","author":"J Pei","year":"2017","unstructured":"Pei, J., Cheng, B., Liu, X., Pardalos, P.M., Kong, M.: Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time. Ann. Oper. Res. (2017). \n                  https:\/\/doi.org\/10.1007\/s10479-017-2481-8","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"1389_CR24","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1016\/0360-8352(95)00006-M","volume":"28","author":"G Mosheiov","year":"1995","unstructured":"Mosheiov, G.: Scheduling jobs with step-deterioration; minimizing makespan on a single-and multi-machine. Comput. Ind. Eng. 28(4), 869\u2013879 (1995)","journal-title":"Comput. Ind. Eng."},{"issue":"1\u20133","key":"1389_CR25","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.: Scheduling linear deteriorating jobs with an availability constraint on a single machine. Theoret. Comput. Sci. 362(1\u20133), 115\u2013126 (2006)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"1389_CR26","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/0377-2217(90)90089-T","volume":"47","author":"AS Kunnathur","year":"1990","unstructured":"Kunnathur, A.S., Gupta, S.K.: Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem. Eur. J. Oper. Res. 47(1), 56\u201364 (1990)","journal-title":"Eur. J. Oper. Res."},{"issue":"9","key":"1389_CR27","doi-asserted-by":"publisher","first-page":"1184","DOI":"10.1057\/jors.1996.146","volume":"47","author":"G Mosheiov","year":"1996","unstructured":"Mosheiov, G.: \u039b-shaped policies to schedule deteriorating jobs. J. Oper. Res. Soc. 47(9), 1184\u20131191 (1996)","journal-title":"J. Oper. Res. Soc."},{"issue":"1\u20134","key":"1389_CR28","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s00170-013-4763-x","volume":"67","author":"SJ Yang","year":"2013","unstructured":"Yang, S.J., Lee, H.T., Guo, J.Y.: Multiple common due dates assignment and scheduling problems with resource allocation and general position-dependent deterioration effect. Int. J. Adv. Manuf. Technol. 67(1\u20134), 181\u2013188 (2013)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"4","key":"1389_CR29","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/0360-8352(88)90041-1","volume":"14","author":"JND Gupta","year":"1988","unstructured":"Gupta, J.N.D., Gupta, S.K.: Single facility scheduling with nonlinear processing times. Comput. Ind. Eng. 14(4), 387\u2013393 (1988)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"1389_CR30","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1080\/0305215X.2016.1163629","volume":"49","author":"X Zhang","year":"2017","unstructured":"Zhang, X., Yin, Y., Wu, C.C.: Scheduling with non-decreasing deterioration jobs and variable maintenance activities on a single machine. Eng. Optim. 49(1), 84\u201397 (2017)","journal-title":"Eng. Optim."},{"issue":"3","key":"1389_CR31","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1287\/opre.38.3.495","volume":"38","author":"S Browne","year":"1990","unstructured":"Browne, S., Yechiali, U.: Scheduling deteriorating jobs on a single processor. Oper. Res. 38(3), 495\u2013498 (1990)","journal-title":"Oper. Res."},{"issue":"7","key":"1389_CR32","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1057\/palgrave.jors.2600740","volume":"50","author":"B Alidaee","year":"1999","unstructured":"Alidaee, B., Womer, N.K.: Scheduling with time dependent processing times: review and extensions. J. Oper. Res. Soc. 50(7), 711\u2013720 (1999)","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"1389_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(02)00909-8","volume":"152","author":"TCE Cheng","year":"2004","unstructured":"Cheng, T.C.E., Ding, Q., Lin, B.M.T.: A concise survey of scheduling with time-dependent processing times. Eur. J. Oper. Res. 152(1), 1\u201313 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"1389_CR34","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., et al.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Discrete Math."},{"issue":"3","key":"1389_CR35","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1016\/j.ejor.2010.11.021","volume":"210","author":"S Li","year":"2011","unstructured":"Li, S., Ng, C.T., Cheng, T.C.E., et al.: Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan. Eur. J. Oper. Res. 210(3), 482\u2013488 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"7\u20139","key":"1389_CR36","doi-asserted-by":"publisher","first-page":"1140","DOI":"10.1016\/j.tcs.2009.12.008","volume":"411","author":"S Lu","year":"2010","unstructured":"Lu, S., Feng, H., Li, X.: Minimizing the makespan on a single parallel batching machine. Theoret. Comput. Sci. 411(7\u20139), 1140\u20131145 (2010)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-019-01389-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-019-01389-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-019-01389-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,11]],"date-time":"2020-10-11T07:37:20Z","timestamp":1602401840000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-019-01389-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,19]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["1389"],"URL":"https:\/\/doi.org\/10.1007\/s11590-019-01389-x","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,19]]},"assertion":[{"value":"6 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 January 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}