{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T20:19:58Z","timestamp":1769285998977,"version":"3.49.0"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T00:00:00Z","timestamp":1769212800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T00:00:00Z","timestamp":1769212800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["884\/22"],"award-info":[{"award-number":["884\/22"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013043","name":"Ariel University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100013043","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2026,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>This research introduces pseudo-polynomial optimal algorithms for various variants of the problem aimed at minimizing both weighted and unweighted total earliness and tardiness for a given set of jobs with a common, non-restrictive due date and optional job rejection. In this context, each job is associated with a rejection cost, allowing for the possibility of rejecting a subset of the jobs. The variants we consider in this paper include non-restricted rejection, an upper bound on the total rejection cost, an upper bound on the total scheduling cost, and a Pareto-optimal solution. Several key innovations are presented: the integration of optional job rejection, the nontrivial adaptation to the environment of multiple machines, the provision of efficient algorithms for both weighted and unweighted scenarios, and the introduction of Pareto-optimal scheduling. These advancements make the proposed algorithms highly applicable to real-world production systems while maintaining pseudo-polynomial complexity, providing both theoretical depth and practical utility.<\/jats:p>","DOI":"10.1007\/s40314-025-03586-0","type":"journal-article","created":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T05:43:41Z","timestamp":1769233421000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimizing the total weighted earliness-tardiness about a non-restrictive common due date with optional job rejection on single and multiple machines"],"prefix":"10.1007","volume":"45","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6909-8160","authenticated-orcid":false,"given":"Baruch","family":"Mor","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2320-9064","authenticated-orcid":false,"given":"Dana","family":"Shapira","sequence":"additional","affiliation":[]},{"given":"Nir","family":"Sonn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,24]]},"reference":[{"key":"3586_CR1","doi-asserted-by":"crossref","unstructured":"Ahmadian M, Salehipour A, Kovalyov M (2020) An efficient relax-and-solve heuristic for open-shop scheduling problem to minimize total weighted earliness-tardiness. SSRN Electronic Journal","DOI":"10.2139\/ssrn.3601396"},{"key":"3586_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfueco.2021.100047","volume":"10","author":"S Akande","year":"2022","unstructured":"Akande S, Ajisegiri G (2022) Three classes of earliness-tardiness (e\/t) scheduling problems. Fuel Communications 10:100047","journal-title":"Fuel Communications"},{"issue":"3","key":"3586_CR3","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s12065-019-00305-7","volume":"13","author":"OA Arik","year":"2020","unstructured":"Arik OA (2020) Comparisons of metaheuristic algorithms for unrelated parallel machine weighted earliness\/tardiness scheduling problems. Evol Intell 13(3):415\u2013425","journal-title":"Evol Intell"},{"issue":"1","key":"3586_CR4","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1108\/GS-01-2020-0010","volume":"11","author":"OA Arik","year":"2021","unstructured":"Arik OA (2021) Single machine earliness\/tardiness scheduling problem with grey processing times and the grey common due date. Grey Syst Theory Appl 11(1):95\u2013109","journal-title":"Grey Syst Theory Appl"},{"issue":"5","key":"3586_CR5","doi-asserted-by":"publisher","first-page":"3355","DOI":"10.1007\/s00521-024-10844-5","volume":"37","author":"OA Ar\u0131k","year":"2025","unstructured":"Ar\u0131k OA (2025) Fuzzy rule-based variable neighborhood search algorithm for single-machine weighted earliness\/tardiness scheduling with common due date. Neural Comput Appl 37(5):3355\u20133371","journal-title":"Neural Comput Appl"},{"key":"3586_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115916","volume":"187","author":"OA Ar\u0131k","year":"2022","unstructured":"Ar\u0131k OA, Schutten M, Topan E (2022) Weighted earliness\/tardiness parallel machine scheduling problem with a common due date. Expert Syst Appl 187:115916","journal-title":"Expert Syst Appl"},{"issue":"5","key":"3586_CR7","doi-asserted-by":"publisher","first-page":"2161","DOI":"10.1007\/s10845-023-02147-8","volume":"35","author":"PB de Athayde","year":"2024","unstructured":"de Athayde PB, Fuchigami HY (2024) A genetic iterated greedy algorithm for the blocking flowshop to minimize total earliness and tardiness. J Intell Manuf 35(5):2161\u20132174","journal-title":"J Intell Manuf"},{"key":"3586_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2024.109915","volume":"188","author":"M Atsmony","year":"2024","unstructured":"Atsmony M, Mosheiov G (2024) Common due-date assignment problems with fixed-plus-linear earliness and tardiness costs. Computers & Industrial Engineering 188:109915","journal-title":"Computers & Industrial Engineering"},{"key":"3586_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.orp.2024.100299","volume":"12","author":"S Babu","year":"2024","unstructured":"Babu S, Girish B (2024) Pareto-optimal front generation for the bi-objective jit scheduling problems with a piecewise linear trade-off between objectives. Operations Research Perspectives 12:100299. https:\/\/doi.org\/10.1016\/j.orp.2024.100299 (https:\/\/www.sciencedirect.com\/science\/article\/pii\/S2214716024000034)","journal-title":"Operations Research Perspectives"},{"key":"3586_CR10","doi-asserted-by":"publisher","first-page":"S1447","DOI":"10.1051\/ro\/2020044","volume":"55","author":"J Behnamian","year":"2021","unstructured":"Behnamian J, Ghomi F, Taghi SM (2021) Multi-objective multi-factory scheduling. RAIRO-Oper Res 55:S1447\u2013S1467. https:\/\/doi.org\/10.1051\/ro\/2020044","journal-title":"RAIRO-Oper Res"},{"key":"3586_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106989","volume":"151","author":"A Branda","year":"2021","unstructured":"Branda A, Castellano D, Guizzi G et al (2021) Metaheuristics for the flow shop scheduling problem with maintenance activities integrated. Comput Ind Eng 151:106989","journal-title":"Comput Ind Eng"},{"issue":"3","key":"3586_CR12","doi-asserted-by":"publisher","first-page":"1867","DOI":"10.1109\/COMST.2017.2698366","volume":"19","author":"JH Cho","year":"2017","unstructured":"Cho JH, Wang Y, Chen IR et al (2017) A survey on modeling and optimizing multi-objective systems. IEEE Communications Surveys & Tutorials 19(3):1867\u20131901. https:\/\/doi.org\/10.1109\/COMST.2017.2698366","journal-title":"IEEE Communications Surveys & Tutorials"},{"issue":"3","key":"3586_CR13","first-page":"2721","volume":"22","author":"M Dabiri","year":"2022","unstructured":"Dabiri M, Yazdani M, Naderi B et al (2022) Modeling and solution methods for hybrid flow shop scheduling problem with job rejection. Oper Res 22(3):2721\u20132765","journal-title":"Oper Res"},{"issue":"2","key":"3586_CR14","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1080\/01605682.2023.2197000","volume":"75","author":"K Fang","year":"2024","unstructured":"Fang K, Luo W, Pinedo ML et al (2024) Rescheduling for new orders on a single machine with rejection. Journal of the Operational Research Society 75(2):346\u2013360","journal-title":"Journal of the Operational Research Society"},{"key":"3586_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105329","volume":"133","author":"D Freud","year":"2021","unstructured":"Freud D, Mosheiov G (2021) Scheduling with competing agents, total late work and job rejection. Comput Oper Res 133:105329","journal-title":"Comput Oper Res"},{"key":"3586_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2023.109317","volume":"181","author":"XN Geng","year":"2023","unstructured":"Geng XN, Sun X, Wang J et al (2023) Scheduling on proportionate flow shop with job rejection and common due date assignment. Computers & Industrial Engineering 181:109317","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"3586_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12351-025-00951-z","volume":"25","author":"XN Geng","year":"2025","unstructured":"Geng XN, Sun X, Wang J et al (2025) Scheduling on proportionate flowshop with total late work and job rejection. Oper Res Int Journal 25(3):1\u201330","journal-title":"Oper Res Int Journal"},{"key":"3586_CR18","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RLG Graham","year":"1979","unstructured":"Graham RLG, Lawler EL, Lenstra JK et al (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287\u2013326","journal-title":"Ann Discrete Math"},{"issue":"5","key":"3586_CR19","doi-asserted-by":"publisher","first-page":"836","DOI":"10.1287\/opre.39.5.836","volume":"39","author":"NG Hall","year":"1991","unstructured":"Hall NG, Posner ME (1991) Earliness-tardiness scheduling problems, I: weighted deviation of completion times about a common due date. Oper Res 39(5):836\u2013846","journal-title":"Oper Res"},{"issue":"2","key":"3586_CR20","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1051\/ro\/2017040","volume":"52","author":"W Huang","year":"2018","unstructured":"Huang W, Wu C, Liu S (2018) Single-machine batch scheduling problem with job rejection and resource dependent processing times. RAIRO Oper Res 52(2):315","journal-title":"RAIRO Oper Res"},{"key":"3586_CR21","doi-asserted-by":"crossref","unstructured":"Jin M, Liu X, Luo W (2020) Single-machine parallel-batch scheduling with nonidentical job sizes and rejection. Mathematics 8(2)","DOI":"10.3390\/math8020258"},{"issue":"4","key":"3586_CR22","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1002\/nav.3800280411","volume":"28","author":"JJ Kanet","year":"1981","unstructured":"Kanet JJ (1981) Minimizing the average deviation of job completion times about a common due date. Naval Research Logistics Quarterly 28(4):643\u2013651","journal-title":"Naval Research Logistics Quarterly"},{"issue":"4","key":"3586_CR23","first-page":"369","volume":"42","author":"H Kazemi","year":"2025","unstructured":"Kazemi H, Nourelfath M, Gendreau M (2025) Minimizing the sum of earliness and tardiness in the multi-factory two-stage assembly scheduling problem. J Ind Prod Eng 42(4):369\u2013384","journal-title":"J Ind Prod Eng"},{"key":"3586_CR24","first-page":"18","volume":"38","author":"B Van Khanh","year":"2021","unstructured":"Van Khanh B, Hop N (2021) Genetic algorithm with initial sequence for parallel machines scheduling with sequence dependent setup times based on earliness- tardiness. J Ind Prod Eng 38:18\u201328","journal-title":"J Ind Prod Eng"},{"key":"#cr-split#-3586_CR25.1","doi-asserted-by":"crossref","unstructured":"Kittel F, Enenkel J, Guckert M, et\u00a0al (2021) Optimisation algorithms for parallel machine scheduling problems with setup times. In: Krawiec K","DOI":"10.1145\/3449726.3459487"},{"key":"#cr-split#-3586_CR25.2","unstructured":"(ed) GECCO '21: Genetic and Evolutionary Computation Conference, Companion Volume, Lille, France, July 10-14, 2021. ACM, pp 131-132"},{"issue":"4","key":"3586_CR26","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10878-025-01295-2","volume":"49","author":"F Kong","year":"2025","unstructured":"Kong F, Song J, Miao C et al (2025) Scheduling problems with rejection in green manufacturing industry. J Comb Optim 49(4):63","journal-title":"J Comb Optim"},{"issue":"4","key":"3586_CR27","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1007\/s11590-019-01389-x","volume":"14","author":"M Kong","year":"2020","unstructured":"Kong M, Liu X, Pei J et al (2020) Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine. Optim Lett 14(4):857\u2013871","journal-title":"Optim Lett"},{"issue":"2","key":"3586_CR28","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1016\/j.ejor.2022.06.025","volume":"305","author":"C Koulamas","year":"2023","unstructured":"Koulamas C, Kyparisis GJ (2023) Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection. Eur J Oper Res 305(2):608\u2013616","journal-title":"Eur J Oper Res"},{"issue":"1","key":"3586_CR29","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10951-017-0549-6","volume":"22","author":"A Kramer","year":"2019","unstructured":"Kramer A, Subramanian A (2019) A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems. J Sched 22(1):21\u201357","journal-title":"J Sched"},{"issue":"4","key":"3586_CR30","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1145\/321906.321910","volume":"22","author":"HT Kung","year":"1975","unstructured":"Kung HT, Luccio F, Preparata FP (1975) On finding the maxima of a set of vectors. J ACM 22(4):469\u2013476","journal-title":"J ACM"},{"key":"3586_CR31","unstructured":"Leung JY (ed) (2004) Handbook of Scheduling - Algorithms, Models, and Performance Analysis. Chapman and Hall\/CRC"},{"issue":"3","key":"3586_CR32","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1007\/s10878-019-00429-7","volume":"38","author":"S Li","year":"2019","unstructured":"Li S, Chen R, Feng Q et al (2019) Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection. J Comb Optim 38(3):957\u2013971","journal-title":"J Comb Optim"},{"key":"3586_CR33","doi-asserted-by":"crossref","unstructured":"Li W, Cui Q (2018) Vector scheduling with rejection on a single machine. 4OR 16(1):95\u2013104","DOI":"10.1007\/s10288-017-0356-0"},{"key":"3586_CR34","doi-asserted-by":"crossref","unstructured":"Lin SS (2021) Due-window assignment scheduling with learning and deterioration effects. Journal of Industrial & Management Optimization 18","DOI":"10.3934\/jimo.2021081"},{"issue":"4","key":"3586_CR35","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1016\/j.orl.2020.06.006","volume":"48","author":"Z Liu","year":"2020","unstructured":"Liu Z (2020) Scheduling with partial rejection. Oper Res Lett 48(4):524\u2013529","journal-title":"Oper Res Lett"},{"issue":"02","key":"3586_CR36","doi-asserted-by":"publisher","first-page":"2450009","DOI":"10.1142\/S021759592450009X","volume":"42","author":"YY Lu","year":"2025","unstructured":"Lu YY, Zhang S, Tao JY (2025) Earliness-tardiness scheduling with delivery times and deteriorating jobs. Asia-Pacific J Oper Res 42(02):2450009","journal-title":"Asia-Pacific J Oper Res"},{"key":"3586_CR37","doi-asserted-by":"crossref","unstructured":"Lv D, Wang J (2021) Study on resource-dependent no-wait flow shop scheduling with different due-window assignment and learning effects. Asia Pac J Oper Res 38(6):2150008:1\u20132150008:23","DOI":"10.1142\/S0217595921500081"},{"key":"3586_CR38","first-page":"15","volume-title":"International Conference on Industrial","author":"A Missaoui","year":"2025","unstructured":"Missaoui A, O\u2019Sullivan B (2025) Reinforcement learning based iterated greedy for parallel machine scheduling with weighted earliness tardiness. International Conference on Industrial. Springer, Engineering and Other Applications of Applied Intelligent Systems, pp 15\u201326"},{"key":"3586_CR39","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2025.107046","volume":"181","author":"B Mor","year":"2025","unstructured":"Mor B, Geng XN (2025) Improved algorithm for minimizing total late work on a proportionate flow shop and extensions to job rejection and generalized due dates. Computers & Operations Research 181:107046","journal-title":"Computers & Operations Research"},{"issue":"19","key":"3586_CR40","doi-asserted-by":"publisher","first-page":"6933","DOI":"10.1080\/00207543.2024.2314714","volume":"62","author":"B Mor","year":"2024","unstructured":"Mor B, Mosheiov G (2024) Scheduling on parallel dedicated machines with job rejection. Int J Prod Res 62(19):6933\u20136940. https:\/\/doi.org\/10.1080\/00207543.2024.2314714","journal-title":"Int J Prod Res"},{"issue":"2","key":"3586_CR41","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s40314-020-1130-z","volume":"39","author":"B Mor","year":"2020","unstructured":"Mor B, Shapira D (2020) Regular scheduling measures on proportionate flowshop with job rejection. Comput Appl Math 39(2):107","journal-title":"Comput Appl Math"},{"issue":"3","key":"3586_CR42","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1007\/s11590-021-01763-8","volume":"16","author":"B Mor","year":"2022","unstructured":"Mor B, Shapira D (2022) Minsum scheduling with acceptable lead-times and optional job rejection. Optim Lett 16(3):1073\u20131091","journal-title":"Optim Lett"},{"issue":"7","key":"3586_CR43","doi-asserted-by":"publisher","first-page":"1499","DOI":"10.1080\/01605682.2021.1915191","volume":"73","author":"B Mor","year":"2022","unstructured":"Mor B, Shapira D (2022) Scheduling problems on a new setting of flexible flowshops: $$\\ell -$$machine proportionate flowshops. J Oper Res Soc 73(7):1499\u20131516","journal-title":"J Oper Res Soc"},{"issue":"6","key":"3586_CR44","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(6):631\u2013641","journal-title":"J Sched"},{"issue":"6","key":"3586_CR45","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(6):553\u2013567","journal-title":"J Sched"},{"issue":"6","key":"3586_CR46","doi-asserted-by":"publisher","first-page":"6063","DOI":"10.1007\/s12190-024-02198-x","volume":"70","author":"B Mor","year":"2024","unstructured":"Mor B, Mor D, Shani N et al (2024) Single machine scheduling with generalized due-dates, learning effect, and job-rejection. J Appl Math Comput 70(6):6063\u20136083","journal-title":"J Appl Math Comput"},{"issue":"6","key":"3586_CR47","doi-asserted-by":"publisher","first-page":"2083","DOI":"10.1080\/00207543.2023.2217277","volume":"62","author":"G Mosheiov","year":"2024","unstructured":"Mosheiov G, Sarig A (2024) A common due-date assignment problem with job rejection on parallel uniform machines. Int J Prod Res 62(6):2083\u20132092","journal-title":"Int J Prod Res"},{"issue":"2","key":"3586_CR48","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s12351-025-00921-5","volume":"25","author":"G Mosheiov","year":"2025","unstructured":"Mosheiov G, Sarig A (2025) A note: approximation algorithms for batch scheduling on shops with job rejection. Oper Res Int Journal 25(2):47","journal-title":"Oper Res Int Journal"},{"key":"3586_CR49","doi-asserted-by":"crossref","unstructured":"Mosheiov G, Sarig A, Strusevich VA (2020) Minmax scheduling and due-window assignment with position-dependent processing times and job rejection. 4OR 18(4):439\u2013456","DOI":"10.1007\/s10288-019-00418-w"},{"issue":"3","key":"3586_CR50","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"},{"key":"3586_CR51","doi-asserted-by":"publisher","DOI":"10.1016\/j.orhc.2019.100194","volume":"22","author":"M Otten","year":"2019","unstructured":"Otten M, Braaksma A, Boucherie RJ (2019) Minimizing earliness\/tardiness costs on multiple machines with an application to surgery scheduling. Operations Research for Health Care 22:100194","journal-title":"Operations Research for Health Care"},{"issue":"5","key":"3586_CR52","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s10951-020-00657-4","volume":"23","author":"J Ou","year":"2020","unstructured":"Ou J (2020) Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection. J Sched 23(5):525\u2013538","journal-title":"J Sched"},{"issue":"3","key":"3586_CR53","doi-asserted-by":"publisher","first-page":"418","DOI":"10.3390\/math13030418","volume":"13","author":"P Palominos","year":"2025","unstructured":"Palominos P, Mazo M, Fuertes G et al (2025) An improved marriage in honey-bee optimization algorithm for minimizing earliness\/tardiness penalties in single-machine scheduling with a restrictive common due date. Mathematics 13(3):418","journal-title":"Mathematics"},{"issue":"4","key":"3586_CR54","doi-asserted-by":"publisher","first-page":"2173","DOI":"10.1007\/s12190-021-01607-9","volume":"68","author":"J Qian","year":"2022","unstructured":"Qian J, Han H (2022) The due date assignment scheduling problem with the deteriorating jobs and delivery time. J Appl Math Comput 68(4):2173\u20132186","journal-title":"J Appl Math Comput"},{"issue":"2","key":"3586_CR55","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s12293-021-00329-6","volume":"13","author":"H Qin","year":"2021","unstructured":"Qin H, Li T, Teng Y et al (2021) Integrated production and distribution scheduling in distributed hybrid flow shops. Memetic Comput 13(2):185\u2013202","journal-title":"Memetic Comput"},{"key":"3586_CR56","doi-asserted-by":"crossref","unstructured":"Seyyedi M, Saghih A, Pooya A, et\u00a0al (2019) Designing a multi-objective mathematical model for flexible job shop scheduling problem with the earliness\/tardiness penalty. The Journal of Social Sciences Research pp 1375\u20131382","DOI":"10.32861\/jssr.510.1375.1382"},{"issue":"1","key":"3586_CR57","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(1):3\u201328","journal-title":"J Sched"},{"issue":"1","key":"3586_CR58","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/s12351-024-00887-w","volume":"25","author":"J Song","year":"2025","unstructured":"Song J, Miao C, Kong F (2025) Scheduling with step learning and job rejection. Oper Res Int Journal 25(1):6","journal-title":"Oper Res Int Journal"},{"issue":"5","key":"3586_CR59","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1016\/S0305-0548(02)00055-2","volume":"30","author":"H Sun","year":"2003","unstructured":"Sun H, Wang G (2003) Parallel machine earliness and tardiness scheduling with proportional weights. Comput Oper Res 30(5):801\u2013808","journal-title":"Comput Oper Res"},{"key":"3586_CR60","doi-asserted-by":"crossref","unstructured":"Wang D, Yin Y, Cheng TCE (2018) Parallel-machine rescheduling with job unavailability and rejection. Omega 81","DOI":"10.1016\/j.omega.2018.04.008"},{"issue":"3","key":"3586_CR61","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1080\/0305215X.2021.1876041","volume":"54","author":"JB Wang","year":"2022","unstructured":"Wang JB, Xu JX, Guo F et al (2022) Single-machine scheduling problems with job rejection, deterioration effects and past-sequence-dependent setup times. Eng Optim 54(3):471\u2013486","journal-title":"Eng Optim"},{"issue":"3","key":"3586_CR62","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1080\/0305215X.2021.1876041","volume":"54","author":"JB Wang","year":"2022","unstructured":"Wang JB, Xu JX, Guo F et al (2022) Single-machine scheduling problems with job rejection, deterioration effects and past-sequence-dependent setup times. Eng Optim 54(3):471\u2013486","journal-title":"Eng Optim"},{"issue":"Supplement","key":"3586_CR63","doi-asserted-by":"publisher","first-page":"S2747","DOI":"10.1051\/ro\/2020117","volume":"55","author":"L Wang","year":"2021","unstructured":"Wang L, Huang X, Liu W et al (2021) Scheduling with position-dependent weights, due-date assignment and past-sequence-dependent setup times. RAIRO Oper Res 55(Supplement):S2747\u2013S2758","journal-title":"RAIRO Oper Res"},{"issue":"3","key":"3586_CR64","doi-asserted-by":"publisher","first-page":"1787","DOI":"10.1051\/ro\/2021079","volume":"55","author":"C Xu","year":"2021","unstructured":"Xu C, Xu Y, Zheng F et al (2021) Multitasking scheduling problems with a common due-window. RAIRO Oper Res 55(3):1787\u20131798","journal-title":"RAIRO Oper Res"},{"key":"3586_CR65","doi-asserted-by":"crossref","unstructured":"Zuo L, Sun Z, Lu L, et\u00a0al (2019) Single-machine scheduling with rejection and an operator non-availability interval. Mathematics 7(8)","DOI":"10.3390\/math7080668"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03586-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-025-03586-0","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03586-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T07:02:20Z","timestamp":1769238140000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-025-03586-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,24]]},"references-count":66,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["3586"],"URL":"https:\/\/doi.org\/10.1007\/s40314-025-03586-0","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,24]]},"assertion":[{"value":"5 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 August 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 2026","order":4,"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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}],"article-number":"217"}}