{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T05:31:30Z","timestamp":1777613490697,"version":"3.51.4"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T00:00:00Z","timestamp":1741996800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T00:00:00Z","timestamp":1741996800000},"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":["12271491"],"award-info":[{"award-number":["12271491"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["23JNULH05"],"award-info":[{"award-number":["23JNULH05"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s10288-025-00586-y","type":"journal-article","created":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T05:37:56Z","timestamp":1742017076000},"page":"247-267","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Order acceptance and scheduling with weighted makespan"],"prefix":"10.1007","volume":"23","author":[{"given":"Lingfa","family":"Lu","sequence":"first","affiliation":[]},{"given":"Lili","family":"Zuo","sequence":"additional","affiliation":[]},{"given":"Liqi","family":"Zhang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7419-3808","authenticated-orcid":false,"given":"Jinwen","family":"Ou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,15]]},"reference":[{"issue":"1","key":"586_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"},{"issue":"6","key":"586_CR2","doi-asserted-by":"publisher","first-page":"1850048","DOI":"10.1142\/S0217595918500483","volume":"35","author":"X Chai","year":"2018","unstructured":"Chai X, Lu LF, Li WH, Zhang LQ (2018) Best-possible online algorithms for single machine scheduling to minimize the maximum weighted completion time. Asia Pac J Oper Res 35(6):1850048","journal-title":"Asia Pac J Oper Res"},{"issue":"11","key":"586_CR3","doi-asserted-by":"publisher","first-page":"1044","DOI":"10.1007\/s10878-020-00649-2","volume":"40","author":"RX Chen","year":"2020","unstructured":"Chen RX, Li SS (2020) Minimizing maximum delivery completion time for order scheduling with rejection. J Comb Optim 40(11):1044\u20131064","journal-title":"J Comb Optim"},{"issue":"3","key":"586_CR4","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1287\/moor.15.3.483","volume":"15","author":"JZ Du","year":"1990","unstructured":"Du JZ, Leung JYT (1990) Minimizing total tardiness on one machine is NP-hard. Math Oper Res 15(3):483\u2013495","journal-title":"Math Oper Res"},{"issue":"1","key":"586_CR5","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0196-6774(03)00078-6","volume":"49","author":"DW Engels","year":"2003","unstructured":"Engels DW, Karger DR, Kolliopoulos SG, Sengupta S, Uma RN, Wein J (2003) Techniques for scheduling with rejection. J Algorithms 49(1):175\u2013191","journal-title":"J Algorithms"},{"issue":"2","key":"586_CR6","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1080\/01605682.2023.2197000","volume":"75","author":"K Fang","year":"2024","unstructured":"Fang K, Luo WC, Pinedo ML, Jin MM, Lu LF (2024) Rescheduling for new orders on a single machine with rejection. J Oper Res Soc 75(2):346\u2013360","journal-title":"J Oper Res Soc"},{"issue":"4","key":"586_CR7","first-page":"121","volume":"11","author":"Q Feng","year":"2007","unstructured":"Feng Q, Yuan JJ (2007) NP-hardness of a multicriteria scheduling on two families of jobs (in Chinese). OR Trans 11(4):121\u2013126","journal-title":"OR Trans"},{"key":"586_CR8","unstructured":"Garey MR, Johnson DS (1979) Computers and Intractablity: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA"},{"issue":"1","key":"586_CR9","doi-asserted-by":"publisher","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 customeros order acceptance and scheduling problem with weighted tardiness penalty. J Oper Res Soc 68(1):89\u2013101","journal-title":"J Oper Res Soc"},{"issue":"11","key":"586_CR10","doi-asserted-by":"publisher","first-page":"3164","DOI":"10.1080\/00207543.2016.1266055","volume":"55","author":"E Gerstl","year":"2017","unstructured":"Gerstl E, Mosheiov G (2017) Single machine scheduling problems with generalized due-dates and job-rejection. Int J Prod Res 55(11):3164\u20133172","journal-title":"Int J Prod Res"},{"issue":"2","key":"586_CR11","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1080\/07408178608975351","volume":"18","author":"NG Hall","year":"1986","unstructured":"Hall NG (1986) Scheduling problems with generalized due dates. IIE Trans 18(2):220\u2013222","journal-title":"IIE Trans"},{"issue":"1","key":"586_CR12","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/0377-2217(91)90149-P","volume":"51","author":"NG Hall","year":"1991","unstructured":"Hall NG, Sethi SP, Srikandarajah S (1991) On the complexity of generalized due date scheduling problems. Eur J Oper Res 51(1):100\u2013109","journal-title":"Eur J Oper Res"},{"issue":"1","key":"586_CR13","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ejor.2018.07.038","volume":"273","author":"D Hermelin","year":"2019","unstructured":"Hermelin D, Pinedo ML, Shabtay D, Talmon N (2019) On the parameterized tractability of a single machine scheduling with rejection. Eur J Oper Res 273(1):67\u201373","journal-title":"Eur J Oper Res"},{"issue":"1","key":"586_CR14","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s10107-002-0324-z","volume":"94","author":"H Hoogeveen","year":"2003","unstructured":"Hoogeveen H, Skutella M, Woeginger GJ (2003) Preemptive scheduling with rejection. Math Prog 94(1):361\u2013374","journal-title":"Math Prog"},{"issue":"4","key":"586_CR15","doi-asserted-by":"publisher","first-page":"15500","DOI":"10.1142\/S021759591550030X","volume":"32","author":"WJ Li","year":"2015","unstructured":"Li WJ (2015) A best possible online algorithm for the parallel-machine scheduling to minimize the maximum weighted completed time. Asia Pac J Oper Res 32(4):15500","journal-title":"Asia Pac J Oper Res"},{"issue":"4","key":"586_CR16","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1016\/j.orl.2020.06.006","volume":"48","author":"ZX Liu","year":"2020","unstructured":"Liu ZX (2020) Scheduling with partial rejection. Oper Res Lett 48(4):524\u2013529","journal-title":"Oper Res Lett"},{"issue":"9","key":"586_CR17","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1007\/s10878-020-00642-9","volume":"40","author":"PH Liu","year":"2020","unstructured":"Liu PH, Lu XW (2020) New approximation algorithms for machine scheduling with rejection on single and parallel machine. J Comb Optim 40(9):929\u2013952","journal-title":"J Comb Optim"},{"issue":"8","key":"586_CR18","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1002\/nav.22135","volume":"70","author":"LF Lu","year":"2023","unstructured":"Lu LF, Ou JW, Yu X, Zhang LQ (2023) Order acceptance and scheduling with delivery under generalized parameters. Nav Res Logist 70(8):844\u2013857","journal-title":"Nav Res Logist"},{"issue":"1","key":"586_CR19","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ejor.2020.08.009","volume":"290","author":"R Ma","year":"2021","unstructured":"Ma R, Guo SN (2021) Applying \u201cPeeling Onion\u2019\u2019 approach for competitive analysis in online scheduling with rejection. Eur J Oper Res 290(1):57\u201367","journal-title":"Eur J Oper Res"},{"issue":"8","key":"586_CR20","doi-asserted-by":"publisher","first-page":"1315","DOI":"10.1080\/01605682.2019.1621222","volume":"71","author":"B Mor","year":"2020","unstructured":"Mor B, Shapira D (2020) Scheduling with regular performance measures and optional job rejection on a single machine. J Oper Res Soc 71(8):1315\u20131325","journal-title":"J Oper Res Soc"},{"issue":"12","key":"586_CR21","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/s10951-019-00612-y","volume":"23","author":"B Mor","year":"2020","unstructured":"Mor B, Mosheiov G, Shapira D (2020) Flowshop scheduling with learning effect and job rejection. J Sched 23(12):631\u2013641","journal-title":"J Sched"},{"issue":"7","key":"586_CR22","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/s10951-021-00697-4","volume":"24","author":"B Mor","year":"2021","unstructured":"Mor B, Mosheiov G, Shabtay D (2021) Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates. J Sched 24(7):553\u2013567","journal-title":"J Sched"},{"issue":"6","key":"586_CR23","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1287\/opre.39.6.979","volume":"39","author":"G Mosheiov","year":"1991","unstructured":"Mosheiov G (1991) V-shaped policies for scheduling deteriorating jobs. Oper Res 39(6):979\u2013991","journal-title":"Oper Res"},{"issue":"3","key":"586_CR24","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1016\/j.ejor.2020.12.061","volume":"293","author":"G Mosheiov","year":"2021","unstructured":"Mosheiov G, Oron D, Shabtay D (2021) Minimizing total late work on a single machine with generalized due-dates. Eur J Oper Res 293(3):837\u2013846","journal-title":"Eur J Oper Res"},{"issue":"2\u20133","key":"586_CR25","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0166-218X(90)90105-L","volume":"26","author":"E Nowicki","year":"1990","unstructured":"Nowicki E, Zdrzalka S (1990) A survey of results for sequencing problems with controllable processing times. Discrete Appl Math 26(2\u20133):271\u2013287","journal-title":"Discrete Appl Math"},{"issue":"7","key":"586_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2020.102313","volume":"102","author":"D Oron","year":"2021","unstructured":"Oron D (2021) Two-agent scheduling problems under rejection budget constraints. Omega 102(7):102313","journal-title":"Omega"},{"issue":"3","key":"586_CR27","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1016\/j.ejor.2017.04.036","volume":"262","author":"JW Ou","year":"2017","unstructured":"Ou JW, Zhong XL (2017) Bicriteria order acceptance and scheduling with consideration of fill rate. Eur J Oper Res 262(3):904\u2013907","journal-title":"Eur J Oper Res"},{"key":"586_CR28","unstructured":"Schuurman P, Woeginger GJ (2009) Approximation Schemes - A Tutorial. In M\u00f6hring RH, Potts CN, Schulz AS, Woeginger GJ, Wolsey LA (ed), Lectures on Scheduling. https:\/\/www.win.tue.nl\/ wscor\/woeginger\/AC-2015\/ptas.pdf"},{"issue":"13","key":"586_CR29","doi-asserted-by":"publisher","first-page":"1643","DOI":"10.1016\/j.dam.2007.02.003","volume":"155","author":"D Shabtay","year":"2007","unstructured":"Shabtay D, Steiner G (2007) A survey of scheduling with controllable processing times. Discrete Appl Math 155(13):1643\u20131666","journal-title":"Discrete Appl Math"},{"issue":"2","key":"586_CR30","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(2):3\u201328","journal-title":"J Sched"},{"issue":"1","key":"586_CR31","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/S0377-2217(82)80008-8","volume":"11","author":"LN van Wassenhove","year":"1982","unstructured":"van Wassenhove LN, Baker KR (1982) A bicriterion approach to time\/cost trade-offs in sequencing. Eur J Oper Res 11(1):48\u201354","journal-title":"Eur J Oper Res"},{"issue":"1","key":"586_CR32","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ejor.2006.01.017","volume":"178","author":"XL Wang","year":"2007","unstructured":"Wang XL, Cheng TCE (2007) Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan. Eur J Oper Res 178(1):57\u201370","journal-title":"Eur J Oper Res"},{"issue":"1","key":"586_CR33","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1287\/ijoc.12.1.57.11901","volume":"12","author":"GJ Woeginger","year":"2000","unstructured":"Woeginger GJ (2000) When does a dynamic programming formulation guarantee the existence of an FPTAS? INFORMS J Comput 12(1):57\u201374","journal-title":"INFORMS J Comput"},{"issue":"2","key":"586_CR34","first-page":"111","volume":"24","author":"YZ Zhang","year":"2020","unstructured":"Zhang YZ (2020) A survey on job scheduling with rejection (in Chinese). OR Trans 24(2):111\u2013130","journal-title":"OR Trans"},{"issue":"3","key":"586_CR35","doi-asserted-by":"publisher","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(3):975\u2013978","journal-title":"Eur J Oper Res"},{"issue":"1","key":"586_CR36","first-page":"75","volume":"49","author":"LQ Zhang","year":"2024","unstructured":"Zhang LQ, Yu X, Lu LF (2024) New results on single-machine scheduling with rejection to minimize the total weighted completion time. Fund Computing Decis Sci 49(1):75\u201394","journal-title":"Fund Computing Decis Sci"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-025-00586-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10288-025-00586-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-025-00586-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T03:07:52Z","timestamp":1758596872000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10288-025-00586-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,15]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["586"],"URL":"https:\/\/doi.org\/10.1007\/s10288-025-00586-y","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,15]]},"assertion":[{"value":"18 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 November 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}