{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T11:58:22Z","timestamp":1781092702290,"version":"3.54.1"},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,9,16]],"date-time":"2020-09-16T00:00:00Z","timestamp":1600214400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,16]],"date-time":"2020-09-16T00:00:00Z","timestamp":1600214400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100013066","name":"Key Scientific Research Project of Colleges and Universities in Henan Province","doi-asserted-by":"publisher","award":["20A110037"],"award-info":[{"award-number":["20A110037"]}],"id":[{"id":"10.13039\/501100013066","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Young Backbone Teachers training program of Zhongyuan University of Technology","award":["2018XQG15"],"award-info":[{"award-number":["2018XQG15"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s10878-020-00649-2","type":"journal-article","created":{"date-parts":[[2020,9,16]],"date-time":"2020-09-16T08:04:57Z","timestamp":1600243497000},"page":"1044-1064","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Minimizing maximum delivery completion time for order scheduling with rejection"],"prefix":"10.1007","volume":"40","author":[{"given":"Ren-Xia","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3197-1558","authenticated-orcid":false,"given":"Shi-Sheng","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,9,16]]},"reference":[{"key":"649_CR1","volume-title":"Scheduling of multi-job customer orders in multi-machine environments","author":"R Ahmadi","year":"1990","unstructured":"Ahmadi R, Bagchi U (1990) Scheduling of multi-job customer orders in multi-machine environments. ORSA\/TIMS, Philadelphia"},{"key":"649_CR2","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1002\/nav.20092","volume":"52","author":"R Ahmadi","year":"2005","unstructured":"Ahmadi R, Bagchi U, Roemer TA (2005) Coordinated scheduling of customer orders for quick response. Naval Res Logist 52:493\u2013512","journal-title":"Naval Res Logist"},{"key":"649_CR3","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1137\/S0895480196300522","volume":"13","author":"Y Bartal","year":"2000","unstructured":"Bartal Y, Leonardi S, Spaccamela AM, Sgall J, Stougie L (2000) Multiprocessor scheduling with rejection. SIAM J Discrete Math 13:64\u201378","journal-title":"SIAM J Discrete Math"},{"key":"649_CR4","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/S0377-2217(82)80007-6","volume":"11","author":"J Carlier","year":"1982","unstructured":"Carlier J (1982) The one-machine sequencing problem. Eur J Oper Res 11:42\u201347","journal-title":"Eur J Oper Res"},{"key":"649_CR5","doi-asserted-by":"crossref","first-page":"1197","DOI":"10.1016\/j.cor.2010.09.018","volume":"39","author":"B Cesaret","year":"2012","unstructured":"Cesaret B, O\u01e7uz C, Salman FS (2012) A tabu search algorithm for order acceptance and scheduling. Comput Oper Res 39:1197\u20131205","journal-title":"Comput Oper Res"},{"key":"649_CR6","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.tcs.2015.03.046","volume":"583","author":"YJ Chen","year":"2015","unstructured":"Chen YJ, Lu LF, Yuan JJ (2015) Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time. Theoret Comput Sci 583:67\u201377","journal-title":"Theoret Comput Sci"},{"key":"649_CR7","volume-title":"Computers and Intractablity: a guide to the theory of $$\\cal{NP}$$-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and Intractablity: a guide to the theory of $$\\cal{NP}$$-completeness. Freeman, San Francisco"},{"key":"649_CR8","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/j.cor.2016.09.010","volume":"78","author":"JM Framinan","year":"2017","unstructured":"Framinan JM, Perez-Gonzalez P (2017) New approximate algorithms for the customer order scheduling problem with total completion time objective. Comput Oper Res 78:181\u2013192","journal-title":"Comput Oper Res"},{"key":"649_CR9","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1016\/j.ejor.2017.10.064","volume":"266","author":"JM Framinan","year":"2018","unstructured":"Framinan JM, Perez-Gonzalez P (2018) Order scheduling with tardiness objective: improved approximate solutions. Eur J Oper Res 266:840\u2013850","journal-title":"Eur J Oper Res"},{"key":"649_CR10","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/j.ejor.2018.04.033","volume":"273","author":"JM Framinan","year":"2019","unstructured":"Framinan JM, Perez-Gonzalez P, Fernandez-Viagas V (2019) Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures. Eur J Oper Res 273:401\u2013417","journal-title":"Eur J Oper Res"},{"key":"649_CR11","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1057\/s41274-016-0007-4","volume":"68","author":"S Geramipour","year":"2017","unstructured":"Geramipour S, Moslehi G, Reisi-Nafchi M (2017) Maximizing the profit in customer\u2019s order acceptance and scheduling problem with weighted tardiness penalty. J Oper Res Soc 68:89\u2013101","journal-title":"J Oper Res Soc"},{"key":"649_CR12","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0305-0548(96)00045-7","volume":"24","author":"JB Ghosh","year":"1997","unstructured":"Ghosh JB (1997) Job selection in a heavily loaded shop. Comput Oper Res 24:141\u2013145","journal-title":"Comput Oper Res"},{"key":"649_CR13","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s10288-016-0303-5","volume":"14","author":"C He","year":"2016","unstructured":"He C, Leung JYT, Lee K, Pinedo ML (2016) Improved algorithms for single machine scheduling with release dates and rejections. 4OR 14:41\u201355","journal-title":"4OR"},{"key":"649_CR14","doi-asserted-by":"crossref","first-page":"106102","DOI":"10.1016\/j.cie.2019.106102","volume":"138","author":"L He","year":"2019","unstructured":"He L, Guijt A, Weerdt M, Xing L, Yorke-Smith N (2019) Order acceptance and scheduling with sequence-dependent setup times: a new memetic algorithm and benchmark of the state of the art. Comput Ind Eng 138:106102","journal-title":"Comput Ind Eng"},{"key":"649_CR15","first-page":"177","volume":"3","author":"FM Julien","year":"1990","unstructured":"Julien FM, Magazine MJ (1990) Scheduling customer orders: an alternative production scheduling approach. J Manuf Opera Manag 3:177\u2013199","journal-title":"J Manuf Opera Manag"},{"key":"649_CR16","doi-asserted-by":"crossref","first-page":"3825","DOI":"10.1007\/s00453-018-0417-6","volume":"80","author":"I Kacem","year":"2018","unstructured":"Kacem I, Kellerer H (2018) Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints. Algorithmica 80:3825\u20133843","journal-title":"Algorithmica"},{"key":"649_CR17","doi-asserted-by":"crossref","first-page":"970","DOI":"10.1007\/s10878-015-9924-4","volume":"32","author":"I Kacem","year":"2016","unstructured":"Kacem I, Kellerer H, Seifaddini M (2016) Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval. J Comb Optim 32:970\u2013981","journal-title":"J Comb Optim"},{"key":"649_CR18","doi-asserted-by":"crossref","unstructured":"Karmarkar N (1984) A new polynomial-time algorithm for linear programming. In: Proceedings of the sixteenth annual ACM symposium on theory of computing (STOC), pp 302\u2013311","DOI":"10.1145\/800057.808695"},{"key":"649_CR19","doi-asserted-by":"crossref","unstructured":"Kung JY, Duan J, Xu J, Chung IH, Cheng SR, Wu CC, Lin WC (2018) Metaheuristics for order scheduling problem with unequal ready times. Discrete Dyn Nat Soc article ID: 4657368","DOI":"10.1155\/2018\/4657368"},{"key":"649_CR20","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0167-6377(98)00007-8","volume":"22","author":"A Lann","year":"1998","unstructured":"Lann A, Mosheiov G, Rinott Y (1998) Asymptotic optimality in probability of a heuristic schedule for open shops with job overlaps. Oper Res Lett 22:63\u201368","journal-title":"Oper Res Lett"},{"key":"649_CR21","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/j.ijpe.2013.01.025","volume":"144","author":"IS Lee","year":"2013","unstructured":"Lee IS (2013) Minimizing total tardiness for the order scheduling problem. Int J Prod Econ 144:128\u2013134","journal-title":"Int J Prod Econ"},{"key":"649_CR22","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s10951-005-2860-x","volume":"8","author":"JYT Leung","year":"2005","unstructured":"Leung JYT, Li H, Pinedo ML (2005) Order scheduling in an environment with dedicated resources in parallel. J Sched 8:355\u2013386","journal-title":"J Sched"},{"key":"649_CR23","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1002\/nav.20138","volume":"53","author":"JYT Leung","year":"2006","unstructured":"Leung JYT, Li H, Pinedo ML (2006a) Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel. Naval Res Logist 53:243\u2013260","journal-title":"Naval Res Logist"},{"key":"649_CR24","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1016\/j.ejor.2004.03.030","volume":"168","author":"JYT Leung","year":"2006","unstructured":"Leung JYT, Li H, Pinedo ML (2006b) Scheduling orders for multiple product types with due date related objectives. Eur J Oper Res 168:370\u2013389","journal-title":"Eur J Oper Res"},{"key":"649_CR25","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1016\/j.dam.2006.09.012","volume":"155","author":"JYT Leung","year":"2007","unstructured":"Leung JYT, Li H, Pinedo ML (2007) Scheduling orders for multiple product types to minimize total weighted completion time. Discrete Appl Math 155:945\u2013970","journal-title":"Discrete Appl Math"},{"key":"649_CR26","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s10479-007-0270-5","volume":"159","author":"JYT Leung","year":"2008","unstructured":"Leung JYT, Li H, Pinedo ML (2008) Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time. Ann Oper Res 159:107\u2013123","journal-title":"Ann Oper Res"},{"key":"649_CR27","doi-asserted-by":"crossref","first-page":"944","DOI":"10.1016\/j.ejor.2006.10.021","volume":"183","author":"BMT Lin","year":"2007","unstructured":"Lin BMT, Kononov AV (2007) Customer order scheduling to minimize the number of late jobs. Eur J Oper Res 183:944\u2013948","journal-title":"Eur J Oper Res"},{"key":"649_CR28","doi-asserted-by":"crossref","first-page":"8677","DOI":"10.1007\/s00500-018-3466-5","volume":"23","author":"WC Lin","year":"2019","unstructured":"Lin WC, Xu J, Bai D, Chung IH, Liu SC, Wu CC (2019) Artificial bee colony algorithms for the order scheduling with release dates. Soft Comput 23:8677\u20138688","journal-title":"Soft Comput"},{"key":"649_CR29","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1016\/j.asoc.2016.09.038","volume":"52","author":"WC Lin","year":"2017","unstructured":"Lin WC, Yin Y, Cheng SR, Cheng TCE, Wu CH, Wu CC (2017) Particle swarm optimization and opposite-based particle swarm optimization for two-agent multi-facility customer order scheduling with ready times. Appl Soft Comput 52:877\u2013884","journal-title":"Appl Soft Comput"},{"key":"649_CR30","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s10878-016-9992-0","volume":"34","author":"LF Lu","year":"2017","unstructured":"Lu LF, Zhang LQ (2017) Single-machine scheduling with production and rejection costs to minimize the maximum earliness. J Comb Optim 34:331\u2013342","journal-title":"J Comb Optim"},{"key":"649_CR31","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/j.orl.2010.04.011","volume":"38","author":"M Mastrolilli","year":"2010","unstructured":"Mastrolilli M, Queyranne M, Schulz AS, Svensson O, Uhane NA (2010) Minimizing the sum of weighted completion times in a concurrent open shop. Oper Res Lett 38:390\u2013395","journal-title":"Oper Res Lett"},{"key":"649_CR32","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1016\/j.ejor.2019.10.014","volume":"286","author":"B Naderi","year":"2020","unstructured":"Naderi B, Roshanaei V (2020) Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling. Eur J Oper Res 286:811\u2013827","journal-title":"Eur J Oper Res"},{"key":"649_CR33","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/j.cor.2010.06.003","volume":"38","author":"FT Nobibon","year":"2011","unstructured":"Nobibon FT, Leus R (2011) Exact algorithms for a generalization of the order acceptance and scheduling problem in a single machine environment. Comput Oper Res 38:367\u2013378","journal-title":"Comput Oper Res"},{"key":"649_CR34","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1023\/A:1024284828374","volume":"6","author":"CT Ng","year":"2003","unstructured":"Ng CT, Cheng TCE, Yuan JJ (2003) Concurrent open shop scheduling to minimize the weighted number of tardy jobs. J Sched 6:405\u2013412","journal-title":"J Sched"},{"key":"649_CR35","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1016\/j.ejor.2014.09.028","volume":"241","author":"J Ou","year":"2015","unstructured":"Ou J, Zhong X, Wang G (2015) An improved heuristic for parallel machine scheduling with rejection. Eur J Oper Res 241:653\u2013661","journal-title":"Eur J Oper Res"},{"key":"649_CR36","doi-asserted-by":"crossref","first-page":"1436","DOI":"10.1287\/opre.28.6.1436","volume":"28","author":"CN Potts","year":"1980","unstructured":"Potts CN (1980) Analysis of a heuristic for one machine sequencing with release dates and delivery times. Oper Res 28:1436\u20131441","journal-title":"Oper Res"},{"key":"649_CR37","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.cor.2019.04.015","volume":"108","author":"V Riahi","year":"2019","unstructured":"Riahi V, Newton MAH, Polash MMA, Sattar A (2019) Tailoring customer order scheduling search algorithms. Comput Oper Res 108:155\u2013165","journal-title":"Comput Oper Res"},{"key":"649_CR38","doi-asserted-by":"crossref","first-page":"1758","DOI":"10.1016\/j.cor.2008.04.010","volume":"36","author":"WO Rom","year":"2009","unstructured":"Rom WO, Slotnick SA (2009) Order acceptance using genetic algorithms. Comput Oper Res 36:1758\u20131767","journal-title":"Comput Oper Res"},{"key":"649_CR39","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/978-3-540-45078-8_8","volume":"2748","author":"S Sengupta","year":"2003","unstructured":"Sengupta S (2003) Algorithms and approximation schemes for minimum lateness\/tardiness scheduling with rejection. Lect Notes Comput Sci 2748:79\u201390","journal-title":"Lect Notes Comput Sci"},{"key":"649_CR40","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10951-012-0303-z","volume":"16","author":"D Shabtay","year":"2013","unstructured":"Shabtay D, Gasper N, Kaspi M (2013) A survey on scheduling problems with rejection. J Sched 16:3\u201328","journal-title":"J Sched"},{"key":"649_CR41","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1080\/00207543.2017.1401247","volume":"56","author":"Z Shi","year":"2018","unstructured":"Shi Z, Huang Z, Shi L (2018) Customer order scheduling on batch processing machines with incompatible job families. Int J Prod Res 56:795\u2013808","journal-title":"Int J Prod Res"},{"key":"649_CR42","doi-asserted-by":"crossref","first-page":"1558","DOI":"10.1109\/TASE.2015.2456131","volume":"14","author":"Z Shi","year":"2017","unstructured":"Shi Z, Wang L, Liu P, Shi L (2017) Minimizing completion time for order scheduling: formulation and heuristic algorithm. IEEE Trans Autom Sci Eng 14:1558\u20131569","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"649_CR43","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2010.09.042","volume":"212","author":"SA Slotnick","year":"2011","unstructured":"Slotnick SA (2011) Order acceptance and scheduling: a taxonomy and review. Eur J Oper Res 212:1\u201311","journal-title":"Eur J Oper Res"},{"key":"649_CR44","doi-asserted-by":"crossref","unstructured":"Slotnick SA, Morton TE (2007) Order acceptance with weighted tardiness. Comput Oper Res 34:3029\u20133042","DOI":"10.1016\/j.cor.2005.11.012"},{"key":"649_CR45","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0305-0548(95)00015-E","volume":"23","author":"SA Slotnick","year":"1996","unstructured":"Slotnick SA, Morton TE (1996) Selecting jobs for a heavily loaded shop with lateness penalties. Comput Oper Res 23:131\u2013140","journal-title":"Comput Oper Res"},{"key":"649_CR46","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/S0925-5273(97)00151-5","volume":"54","author":"CS Sung","year":"1998","unstructured":"Sung CS, Yoon SH (1998) Minimizing total weighted completion time at a pre-assembly stage composed of two feeding machines. Int J Prod Econ 54:247\u2013255","journal-title":"Int J Prod Econ"},{"key":"649_CR47","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1016\/0377-2217(93)90347-P","volume":"71","author":"E Wagneur","year":"1993","unstructured":"Wagneur E, Sriskandarajah C (1993) Open shops with jobs overlap. Eur J Oper Res 71:366\u2013378","journal-title":"Eur J Oper Res"},{"key":"649_CR48","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1016\/j.omega.2005.09.007","volume":"35","author":"G Wang","year":"2007","unstructured":"Wang G, Cheng TCE (2007) Customer order scheduling to minimize total weighted completion time. Omega 35:623\u2013626","journal-title":"Omega"},{"key":"649_CR49","doi-asserted-by":"crossref","first-page":"1755","DOI":"10.1057\/jors.2015.3","volume":"66","author":"X Wang","year":"2015","unstructured":"Wang X, Huang G, Hu X, Cheng TCE (2015) Order acceptance and scheduling on two identical parallel machines. J Oper Res Soc 66:1755\u20131767","journal-title":"J Oper Res Soc"},{"key":"649_CR50","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.cor.2018.12.016","volume":"104","author":"S Wang","year":"2019","unstructured":"Wang S, Ye B (2019) Exact methods for order acceptance and scheduling on unrelated parallel machines. Comput Oper Res 104:159\u2013173","journal-title":"Comput Oper Res"},{"key":"649_CR51","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1080\/01605682.2018.1447249","volume":"70","author":"CC Wu","year":"2019","unstructured":"Wu CC, Lin WC, Zhang X, Chung IH, Yang TH, Lai K (2019a) Tardiness minimization for a customer order scheduling problem with sum-of-processing-time-based learning effect. J Oper Res Soc 70:487\u2013501","journal-title":"J Oper Res Soc"},{"key":"649_CR52","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1016\/j.swevo.2018.10.003","volume":"44","author":"CC Wu","year":"2019","unstructured":"Wu CC, Yang TH, Zhang X, Kang CC, Lin WC (2019b) Using heuristic and iterative greedy algorithms for the total weighted completion time order scheduling with release times. Swarm Evol Comput 44:913\u2013926","journal-title":"Swarm Evol Comput"},{"key":"649_CR53","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1016\/j.cie.2018.01.011","volume":"117","author":"CC Wu","year":"2018","unstructured":"Wu CC, Liu SC, Lin TY, Yang TH, Chung IH, Lin WC (2018a) Bicriterion total flowtime and maximum tardiness minimization for an order scheduling problem. Comput Ind Eng 117:152\u2013163","journal-title":"Comput Ind Eng"},{"key":"649_CR54","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.1016\/j.asoc.2017.10.015","volume":"71","author":"GH Wu","year":"2018","unstructured":"Wu GH, Cheng CY, Yang HI, Chena CT (2018b) An improved water flowlike algorithm for order acceptance and scheduling with identical parallel machines. Appl Soft Comput 71:1072\u20131084","journal-title":"Appl Soft Comput"},{"key":"649_CR55","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.cor.2016.04.021","volume":"74","author":"J Xu","year":"2016","unstructured":"Xu J, Wu CC, Yin Y, Zhao C, Chiou YT, Lin WC (2016) An order scheduling problem with position-based learning effect. Comput Oper Res 74:175\u2013186","journal-title":"Comput Oper Res"},{"key":"649_CR56","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1109\/TASE.2013.2291899","volume":"12","author":"X Xu","year":"2015","unstructured":"Xu X, Ma Y, Zhou Z, Zhao Y (2015) Customer order scheduling on unrelated parallel machines to minimize total completion time. IEEE Trans Autom Sci Eng 12:244\u2013257","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"649_CR57","doi-asserted-by":"crossref","first-page":"1921","DOI":"10.1016\/j.cor.2003.12.008","volume":"32","author":"J Yang","year":"2005","unstructured":"Yang J (2005) The complexity of customer order scheduling problems on parallel machines. Comput Oper Res 32:1921\u20131939","journal-title":"Comput Oper Res"},{"key":"649_CR58","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s10288-016-0304-4","volume":"14","author":"LQ Zhang","year":"2016","unstructured":"Zhang LQ, Lu LF (2016) Parallel-machine scheduling with release dates and rejection. 4OR 14:165\u2013172","journal-title":"4OR"},{"key":"649_CR59","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1016\/j.ejor.2008.10.006","volume":"198","author":"LQ Zhang","year":"2009","unstructured":"Zhang LQ, Lu LF, Yuan JJ (2009) Single machine scheduling with release dates and rejection. Eur J Oper Res 198:975\u2013978","journal-title":"Eur J Oper Res"},{"key":"649_CR60","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/s10878-016-0044-6","volume":"35","author":"X Zhang","year":"2018","unstructured":"Zhang X, Xu D, Du D, Wu C (2018) Approximation algorithms for precedence-constrained identical machine scheduling with rejection. J Comb Optim 35:318\u2013330","journal-title":"J Comb Optim"},{"key":"649_CR61","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/j.cie.2019.04.055","volume":"133","author":"Y Zhang","year":"2019","unstructured":"Zhang Y, Dan Y, Dan B, Gao H (2019) The order scheduling problem of product-service system with time windows. Comput Ind Eng 133:253\u2013266","journal-title":"Comput Ind Eng"},{"key":"649_CR62","first-page":"387","volume":"15","author":"X Zhong","year":"2017","unstructured":"Zhong X, Ou J (2017) Improved approximation algorithms for parallel machine scheduling with release dates and job rejection. 15:387\u2013406","journal-title":"Improved approximation algorithms for parallel machine scheduling with release dates and job rejection."},{"key":"649_CR63","doi-asserted-by":"crossref","first-page":"934","DOI":"10.1007\/s10878-016-0016-x","volume":"33","author":"X Zhong","year":"2017","unstructured":"Zhong X, Pan Z, Jiang D (2017) Scheduling with release times and rejection on two parallel machines. J Comb Optim 33:934\u2013944","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00649-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-020-00649-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00649-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,16]],"date-time":"2021-09-16T00:20:31Z","timestamp":1631751631000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-020-00649-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,16]]},"references-count":63,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["649"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00649-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,16]]},"assertion":[{"value":"16 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}