Scheduling with assignable due dates, two competing agents and late work related criteria
This paper investigates several scheduling problems on a single machine that exhibit three key features: (i) assignable due dates are considered, meaning that a predefined set of due dates is provided, and these due dates can be assigned to the jobs independently and arbitrarily; (ii) two competing...
Uložené v:
| Vydané v: | Computers & operations research Ročník 182; s. 107144 |
|---|---|
| Hlavní autori: | , , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier Ltd
01.10.2025
|
| Predmet: | |
| ISSN: | 0305-0548 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | This paper investigates several scheduling problems on a single machine that exhibit three key features: (i) assignable due dates are considered, meaning that a predefined set of due dates is provided, and these due dates can be assigned to the jobs independently and arbitrarily; (ii) two competing agents are involved, with jobs divided into two disjoint sets, each owned by one agent; and (iii) each agent’s objective is to minimize a specific late work-related criterion. Specifically, the goal is to determine a due date assignment and a feasible schedule that minimizes the weighted sum of the selected scheduling criteria for both agents. For the first time, we integrate two-agent scheduling, assignable due dates, and late work-related criteria. We develop pseudo-polynomial-time dynamic programming algorithms to address problems where one agent’s criterion is the total late work, while the other agent’s criterion is either the total late work, total tardiness, or weighted number of tardy jobs. Moreover, we propose polynomial-time algorithms to tackle various special cases of these related problems.
•Scheduling with assignable due date and two competing agents is studied.•The weighted sum of the late-work-related criteria of the two agents is minimized.•Pseudo-polynomial-time dynamic programming (DP) algorithms are proposed.•Extensive numerical experiments are conducted to test the DP algorithms.•Polynomial-time algorithms are designed to tackle various special cases. |
|---|---|
| AbstractList | This paper investigates several scheduling problems on a single machine that exhibit three key features: (i) assignable due dates are considered, meaning that a predefined set of due dates is provided, and these due dates can be assigned to the jobs independently and arbitrarily; (ii) two competing agents are involved, with jobs divided into two disjoint sets, each owned by one agent; and (iii) each agent’s objective is to minimize a specific late work-related criterion. Specifically, the goal is to determine a due date assignment and a feasible schedule that minimizes the weighted sum of the selected scheduling criteria for both agents. For the first time, we integrate two-agent scheduling, assignable due dates, and late work-related criteria. We develop pseudo-polynomial-time dynamic programming algorithms to address problems where one agent’s criterion is the total late work, while the other agent’s criterion is either the total late work, total tardiness, or weighted number of tardy jobs. Moreover, we propose polynomial-time algorithms to tackle various special cases of these related problems.
•Scheduling with assignable due date and two competing agents is studied.•The weighted sum of the late-work-related criteria of the two agents is minimized.•Pseudo-polynomial-time dynamic programming (DP) algorithms are proposed.•Extensive numerical experiments are conducted to test the DP algorithms.•Polynomial-time algorithms are designed to tackle various special cases. |
| ArticleNumber | 107144 |
| Author | Sang, Yao-Wen Chen, Ren-Xia Li, Shi-Sheng Sterna, Malgorzata Kis, Tamas |
| Author_xml | – sequence: 1 givenname: Shi-Sheng orcidid: 0000-0003-3197-1558 surname: Li fullname: Li, Shi-Sheng email: shishengli96@163.com organization: School of Mathematics and Information Science, Zhongyuan University of Technology, Zhengzhou 450007, People’s Republic of China – sequence: 2 givenname: Yao-Wen orcidid: 0000-0003-4800-7167 surname: Sang fullname: Sang, Yao-Wen organization: College of Economics and Management, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, People’s Republic of China – sequence: 3 givenname: Ren-Xia orcidid: 0000-0002-6131-1369 surname: Chen fullname: Chen, Ren-Xia organization: School of Mathematics and Information Science, Zhongyuan University of Technology, Zhengzhou 450007, People’s Republic of China – sequence: 4 givenname: Malgorzata orcidid: 0000-0002-3845-8194 surname: Sterna fullname: Sterna, Malgorzata organization: Institute of Computing Science, Poznan University of Technology, Piotrowo 2, Poznan 60-965, Poland – sequence: 5 givenname: Tamas orcidid: 0000-0002-2759-1264 surname: Kis fullname: Kis, Tamas organization: HUN-REN Institute for Computer Science and Control, Kende utca 13-17, Budapest, 1111, Hungary |
| BookMark | eNp9kM1KAzEQx3OoYFt9AG95ALcm2ewXnqSoFQoe1IOnkJ1M2tTtbklSi29vlnp2YJjP_zD8ZmTSDz0ScsPZgjNe3u0WMPiFYKJIdcWlnJApy1mRsULWl2QWwo4lqwSfks832KI5dq7f0JOLW6pDcJtetx1Sc0yuI4ZbGk8DhWF_wDgu6g32MVDdG9qlOT0N_ot6HHNDwbuI3ukrcmF1F_D6L87Jx9Pj-3KVrV-fX5YP6wxEVcYMWmmtlXUDTW3aRti2sLzMhchTrZvGVFCkpqmM5Hmpc86ERYkIUOsCasznhJ_vgh9C8GjVwbu99j-KMzXyUDuVeKiRhzrzSJr7swbTY98OvQrgsAc0ziNEZQb3j_oXXApuKg |
| Cites_doi | 10.1080/00207543.2020.1820095 10.1016/j.ejor.2024.01.009 10.1016/j.ijpe.2015.06.018 10.1016/j.cor.2023.106365 10.3390/math11122737 10.1016/j.ejor.2023.08.002 10.1142/S0217595923500239 10.1016/j.dam.2020.05.023 10.1142/S021759592150007X 10.1287/opre.1030.0092 10.1016/j.ejor.2024.11.010 10.1016/j.cie.2006.12.004 10.1007/s10957-017-1147-7 10.1007/s40305-022-00402-y 10.1016/j.cor.2025.106989 10.1016/j.cor.2023.106489 10.1080/00207543.2022.2160502 10.1002/nav.3800020109 10.1080/07408178608975351 10.1287/opre.1090.0744 10.1007/s10951-018-0566-0 10.1016/j.omega.2021.102453 10.1016/j.ejor.2022.02.017 10.1016/j.ejor.2021.10.064 10.1016/j.cor.2022.105742 10.1016/j.ejor.2013.09.017 10.1016/j.dam.2015.03.011 10.1080/00207543.2023.2188646 10.1016/S0166-218X(03)00339-1 10.1287/ijoc.7.2.232 10.1016/j.ejor.2024.09.042 10.1287/opre.40.3.586 10.1016/j.tcs.2024.114729 10.1023/A:1022231419049 10.1016/j.ejor.2015.01.003 10.1080/00207543.2017.1346323 10.1016/j.omega.2020.102313 10.1016/j.cor.2022.106133 10.1007/s10878-022-00890-x 10.1007/s10878-018-0337-z 10.1016/j.cor.2021.105329 10.1080/09537280110069621 10.1016/S0166-218X(01)00316-X 10.1002/nav.21684 10.1016/j.disopt.2022.100698 10.1016/j.ejor.2022.10.047 10.1007/s40314-024-02753-z 10.1002/nav.22222 10.1016/j.ejor.2020.12.061 10.1016/j.omega.2023.102923 10.1007/s10951-020-00646-7 10.1016/j.ejor.2019.12.003 10.1007/s00500-015-1900-5 10.1016/j.compind.2024.104120 10.1007/s10479-023-05780-x 10.1016/j.cie.2020.106803 10.1287/opre.49.6.854.10014 10.1016/j.omega.2010.06.006 10.1016/j.ejor.2023.01.026 10.1007/s10951-023-00779-5 10.1016/j.cie.2022.108386 10.1007/s10951-014-0410-0 10.1007/s10479-022-04806-0 10.1002/nav.21961 |
| ContentType | Journal Article |
| Copyright | 2025 Elsevier Ltd |
| Copyright_xml | – notice: 2025 Elsevier Ltd |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.cor.2025.107144 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| ExternalDocumentID | 10_1016_j_cor_2025_107144 S0305054825001728 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 186 1B1 1OL 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 6J9 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AAEDT AAEDW AAFJI AAIKJ AAKOC AALRI AAOAW AAQXK AARIN AATTM AAXKI AAXUO AAYFN AAYOK AAYWO ABAOU ABBOA ABDPE ABEFU ABFNM ABFRF ABJNI ABMAC ABMMH ABUCO ABWVN ABXDB ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACRPL ACVFH ACZNC ADBBV ADCNI ADEZE ADGUI ADJOM ADMUD ADNMO AEBSH AEFWE AEHXG AEIPS AEKER AENEX AEUPX AFFNX AFJKZ AFPUW AFTJW AFXIZ AGCQF AGHFR AGQPQ AGRNS AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGII AIGVJ AIIUN AIKHN AITUG AKBMS AKRWK AKYEP ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU AOMHK AOUOD APLSM APXCP ARUGR ASPBG AVARZ AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC BNPGV CS3 DU5 EBS EFJIC EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX HVGLF HZ~ H~9 IHE J1W KOM LY1 M41 MHUIS MO0 MS~ O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ PRBVW Q38 R2- RIG ROL RPZ RXW SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSH SSO SSV SSW SSZ T5K TAE TN5 U5U UPT VH1 WUQ XPP ZMT ~02 ~G- 9DU AAYXX ACLOT CITATION EFKBS EFLBG ~HD |
| ID | FETCH-LOGICAL-c276t-cb4fff489c98db92fb5f16322398da99d7c52fbd7d4136a3102fe4eecc8a5c8e3 |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001504242600002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0305-0548 |
| IngestDate | Sat Nov 29 06:59:17 EST 2025 Sat Jul 05 17:11:03 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Two-agent Late work Scheduling Assignable due dates Single machine |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c276t-cb4fff489c98db92fb5f16322398da99d7c52fbd7d4136a3102fe4eecc8a5c8e3 |
| ORCID | 0000-0003-3197-1558 0000-0003-4800-7167 0000-0002-2759-1264 0000-0002-3845-8194 0000-0002-6131-1369 |
| ParticipantIDs | crossref_primary_10_1016_j_cor_2025_107144 elsevier_sciencedirect_doi_10_1016_j_cor_2025_107144 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-10-01 |
| PublicationDateYYYYMMDD | 2025-10-01 |
| PublicationDate_xml | – month: 10 year: 2025 text: 2025-10-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | Computers & operations research |
| PublicationYear | 2025 |
| Publisher | Elsevier Ltd |
| Publisher_xml | – name: Elsevier Ltd |
| References | Jiang, Wu, Chen, Dong, Cheng, Blazewicz, Ji (b30) 2024; 315 Leung, Pinedo, Wan (b34) 2010; 58 Xu, Mak, Minaricova, Brintrup (b65) 2024; 161 Chen, Li, Feng (b13) 2024; 41 Chen, Shen, Kovalyov, Sterna, Blazewicz (b15) 2022; 171 Rolim, Nagano (b53) 2020; 149 Oron, Shabtay, Steiner (b44) 2015; 244 Fan, Wang, Liu (b18) 2023; 61 Sterna (b58) 2007; 52 Geng, Yuan (b23) 2023; 308 Gordon, Proth, Chu (b24) 2002; 13 Sterna, Czerniachowska (b61) 2017; 174 Zhang, Yuan, Ng, Cheng (b71) 2021; 68 Agnetis, Mirchandani, Pacciarelli, Pacifici (b3) 2004; 52 Justkowiak, Kovalev, Kovalyov, Pesch (b31) 2023; 308 Mosheiov, Oron, Shabtay (b42) 2021; 293 Dereniowski, Kubiak (b17) 2018; 21 Sterna (b60) 2021; 104 Fomin, Goldengorin (b19) 2022; 142 Qi, Yu, Bard (b51) 2002; 122 Freud, Mosheiov (b20) 2021; 133 Kuhn (b33) 1955; 2 He, Wu, Lin (b29) 2022; 45 Choi, Park, Kim, Min (b16) 2021; 38 Wang, Yin, Xu, Wu, Cheng, Wu (b64) 2015; 168 Blazewicz, Pesch, Sterna, Werner (b8) 2004; 134 Liu, Gu, Lu (b41) 2024; 333 Phosavanh, Oron (b48) 2025; 321 Wang, Ren, Bai, Chu, Yu, Meng, Wu (b63) 2024; 62 Sterna (b59) 2011; 39 Phosavanh, Oron (b47) 2024; 312 Yin, Cheng, Cheng, Wu, Wu (b66) 2012; 219 Wang, Kang, Shiau, Wu, Hsu (b62) 2017; 21 Agnetis, Aloulou, Kovalyov (b1) 2017; 55 Li (b35) 2024; 12 Li, Lv, Lv, Zhang, Wang (b39) 2024; 43 Kovalyov, Oulamara, Soukhal (b32) 2015; 18 Zhang, Lv, Wang (b69) 2023; 11 Chen, Geng, Lu, Yuan, Zhang (b11) 2022; 301 Shabtay, Mosheiov, Oron (b57) 2022; 303 Hariri, Potts, Van Wassenhove (b28) 1995; 7 Chen, Kovalev, Liu, Sterna, Chalamon, Blazewicz (b12) 2021; 290 Chen, Dong, Yuan, Ng, Cheng (b9) 2025; 322 Sang, Wang, Sterna, Blazewicz (b54) 2023; 121 Baker, Smith (b5) 2003; 6 Pal, lal Mittal, Soni, Chouhan (b45) 2023; 159 Li, Chen (b36) 2022; 44 Garey, Johnson (b22) 1979 Gu, Liu, Lu (b25) 2024; 1012 Chen, Gao, Geng, Yuan (b10) 2023; 61 Hall, Posner (b27) 2001; 49 Zhang, Yuan (b70) 2019; 37 Perez-Gonzalez, Framinan (b46) 2014; 235 Blazewicz, Ecker, Pesch, Schmidt, Sterna, Weglarz (b7) 2019 Li, Chen (b37) 2023; 26 Potts, Van Wassenhove (b49) 1992; 40 Oron (b43) 2021; 102 Yin, Wang, Cheng (b67) 2020 Atsmony, Mor, Mosheiov (b4) 2023; 152 Hall (b26) 1986; 18 Agnetis, Billaut, Gawiejnowicz, Pacciarelli, Soukhal (b2) 2014 Yin, Xu, Cheng, Wu, Wang (b68) 2016; 213 Sang, Wang, Sterna, Blazewicz (b55) 2025; 72 Prata, de Abreu, Fernandez-Viagas (b50) 2025; 177 Rodriguez-Ballesteros, Alcaraz, Anton-Sanchez (b52) 2024; 163 Blazewicz (b6) 1984; 36 Gao, Yuan (b21) 2015; 189 Li, Liu (b38) 2024; 170 Chen, Liang, Sterna, Wang, Blazewicz (b14) 2020; 248 Li, Yuan (b40) 2020; 23 Shabtay (b56) 2023; 322 Mosheiov (10.1016/j.cor.2025.107144_b42) 2021; 293 Baker (10.1016/j.cor.2025.107144_b5) 2003; 6 Sterna (10.1016/j.cor.2025.107144_b59) 2011; 39 Li (10.1016/j.cor.2025.107144_b39) 2024; 43 Yin (10.1016/j.cor.2025.107144_b67) 2020 Gu (10.1016/j.cor.2025.107144_b25) 2024; 1012 Dereniowski (10.1016/j.cor.2025.107144_b17) 2018; 21 Wang (10.1016/j.cor.2025.107144_b64) 2015; 168 Chen (10.1016/j.cor.2025.107144_b12) 2021; 290 Li (10.1016/j.cor.2025.107144_b36) 2022; 44 Fomin (10.1016/j.cor.2025.107144_b19) 2022; 142 He (10.1016/j.cor.2025.107144_b29) 2022; 45 Oron (10.1016/j.cor.2025.107144_b44) 2015; 244 Blazewicz (10.1016/j.cor.2025.107144_b6) 1984; 36 Yin (10.1016/j.cor.2025.107144_b68) 2016; 213 Gordon (10.1016/j.cor.2025.107144_b24) 2002; 13 Sterna (10.1016/j.cor.2025.107144_b60) 2021; 104 Agnetis (10.1016/j.cor.2025.107144_b2) 2014 Chen (10.1016/j.cor.2025.107144_b15) 2022; 171 Justkowiak (10.1016/j.cor.2025.107144_b31) 2023; 308 Wang (10.1016/j.cor.2025.107144_b62) 2017; 21 Oron (10.1016/j.cor.2025.107144_b43) 2021; 102 Perez-Gonzalez (10.1016/j.cor.2025.107144_b46) 2014; 235 Atsmony (10.1016/j.cor.2025.107144_b4) 2023; 152 Sterna (10.1016/j.cor.2025.107144_b58) 2007; 52 Liu (10.1016/j.cor.2025.107144_b41) 2024; 333 Blazewicz (10.1016/j.cor.2025.107144_b8) 2004; 134 Chen (10.1016/j.cor.2025.107144_b10) 2023; 61 Li (10.1016/j.cor.2025.107144_b35) 2024; 12 Agnetis (10.1016/j.cor.2025.107144_b1) 2017; 55 Kovalyov (10.1016/j.cor.2025.107144_b32) 2015; 18 Wang (10.1016/j.cor.2025.107144_b63) 2024; 62 Freud (10.1016/j.cor.2025.107144_b20) 2021; 133 Leung (10.1016/j.cor.2025.107144_b34) 2010; 58 Chen (10.1016/j.cor.2025.107144_b14) 2020; 248 Choi (10.1016/j.cor.2025.107144_b16) 2021; 38 Garey (10.1016/j.cor.2025.107144_b22) 1979 Kuhn (10.1016/j.cor.2025.107144_b33) 1955; 2 Xu (10.1016/j.cor.2025.107144_b65) 2024; 161 Prata (10.1016/j.cor.2025.107144_b50) 2025; 177 Zhang (10.1016/j.cor.2025.107144_b71) 2021; 68 Blazewicz (10.1016/j.cor.2025.107144_b7) 2019 Phosavanh (10.1016/j.cor.2025.107144_b47) 2024; 312 Sterna (10.1016/j.cor.2025.107144_b61) 2017; 174 Li (10.1016/j.cor.2025.107144_b37) 2023; 26 Chen (10.1016/j.cor.2025.107144_b9) 2025; 322 Hall (10.1016/j.cor.2025.107144_b26) 1986; 18 Li (10.1016/j.cor.2025.107144_b38) 2024; 170 Rodriguez-Ballesteros (10.1016/j.cor.2025.107144_b52) 2024; 163 Rolim (10.1016/j.cor.2025.107144_b53) 2020; 149 Jiang (10.1016/j.cor.2025.107144_b30) 2024; 315 Zhang (10.1016/j.cor.2025.107144_b69) 2023; 11 Sang (10.1016/j.cor.2025.107144_b55) 2025; 72 Geng (10.1016/j.cor.2025.107144_b23) 2023; 308 Hall (10.1016/j.cor.2025.107144_b27) 2001; 49 Sang (10.1016/j.cor.2025.107144_b54) 2023; 121 Phosavanh (10.1016/j.cor.2025.107144_b48) 2025; 321 Gao (10.1016/j.cor.2025.107144_b21) 2015; 189 Potts (10.1016/j.cor.2025.107144_b49) 1992; 40 Yin (10.1016/j.cor.2025.107144_b66) 2012; 219 Li (10.1016/j.cor.2025.107144_b40) 2020; 23 Chen (10.1016/j.cor.2025.107144_b11) 2022; 301 Pal (10.1016/j.cor.2025.107144_b45) 2023; 159 Chen (10.1016/j.cor.2025.107144_b13) 2024; 41 Qi (10.1016/j.cor.2025.107144_b51) 2002; 122 Zhang (10.1016/j.cor.2025.107144_b70) 2019; 37 Hariri (10.1016/j.cor.2025.107144_b28) 1995; 7 Agnetis (10.1016/j.cor.2025.107144_b3) 2004; 52 Fan (10.1016/j.cor.2025.107144_b18) 2023; 61 Shabtay (10.1016/j.cor.2025.107144_b56) 2023; 322 Shabtay (10.1016/j.cor.2025.107144_b57) 2022; 303 |
| References_xml | – volume: 134 start-page: 1 year: 2004 end-page: 24 ident: b8 article-title: Open shop scheduling problems with late work criteria publication-title: Discrete Appl. Math. – volume: 18 start-page: 220 year: 1986 end-page: 222 ident: b26 article-title: Scheduling problems with generalized due dates publication-title: IIE Trans. – volume: 248 start-page: 67 year: 2020 end-page: 74 ident: b14 article-title: Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date publication-title: European J. Oper. Res. – volume: 12 start-page: 341 year: 2024 end-page: 350 ident: b35 article-title: Improved approximation schemes for early work scheduling on identical parallel machines with a common due date publication-title: J. Oper. Res. Soc. China – volume: 315 start-page: 855 year: 2024 end-page: 862 ident: b30 article-title: Online early work scheduling on parallel machines publication-title: European J. Oper. Res. – volume: 170 year: 2024 ident: b38 article-title: Two-agent scheduling on a single machine with release dates publication-title: Comput. Oper. Res. – volume: 6 start-page: 7 year: 2003 end-page: 16 ident: b5 article-title: A multiple-criterion model for machine scheduling publication-title: J. Sched. – volume: 121 year: 2023 ident: b54 article-title: Single machine scheduling with due date assignment to minimize the total weighted lead time penalty and late work publication-title: Omega – volume: 21 start-page: 583 year: 2018 end-page: 593 ident: b17 article-title: Shared processor scheduling publication-title: J. Sched. – volume: 301 start-page: 414 year: 2022 end-page: 431 ident: b11 article-title: Pareto-scheduling of two competing agents with their own equal processing times publication-title: European J. Oper. Res. – volume: 40 start-page: 586 year: 1992 end-page: 595 ident: b49 article-title: Single machine scheduling to minimize total late work publication-title: Oper. Res. – volume: 213 start-page: 172 year: 2016 end-page: 183 ident: b68 article-title: Approximation schemes for single-machine scheduling with a fixed maintenance activity to minimize the total amount of late work publication-title: Naval Res. Logist. – volume: 44 start-page: 1330 year: 2022 end-page: 1355 ident: b36 article-title: Minimizing total weighted late work on a single-machine with non-availability intervals publication-title: J. Comb. Optim. – volume: 149 year: 2020 ident: b53 article-title: Structural properties and algorithms for earliness and tardiness scheduling against common due dates and windows: A review publication-title: Comput. Ind. Eng. – volume: 133 year: 2021 ident: b20 article-title: Scheduling with competing agents, total late work and job rejection publication-title: Comput. Oper. Res. – volume: 321 start-page: 734 year: 2025 end-page: 749 ident: b48 article-title: Minimizing the number of late jobs and total late work with step-learning publication-title: European J. Oper. Res. – volume: 18 start-page: 423 year: 2015 end-page: 434 ident: b32 article-title: Two-agent scheduling with agent specific batches on an unbounded serial batching machine publication-title: J. Sched. – volume: 45 year: 2022 ident: b29 article-title: Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan publication-title: Discrete Optim. – volume: 61 start-page: 238 year: 2023 end-page: 257 ident: b18 article-title: Two-agent scheduling on mixed batch machines to minimize the total weighted makespan publication-title: Int. J. Prod. Res. – volume: 159 year: 2023 ident: b45 article-title: A multi-agent system for integrated scheduling and maintenance planning of the flexible job shop publication-title: Comput. Oper. Res. – volume: 7 start-page: 232 year: 1995 end-page: 242 ident: b28 article-title: Single machine scheduling to minimize total weighted late work publication-title: ORSA J. Comput. – volume: 219 start-page: 1674 year: 2012 end-page: 1685 ident: b66 article-title: Two-agent single-machine scheduling with assignable due dates publication-title: Appl. Math. Comput. – volume: 36 start-page: 255 year: 1984 end-page: 258 ident: b6 article-title: Scheduling preemptible tasks on parallel processors with information loss publication-title: Tech. Sci. Inform. – year: 2019 ident: b7 article-title: Handbook on Scheduling – volume: 189 start-page: 49 year: 2015 end-page: 52 ident: b21 article-title: Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates publication-title: Discrete Appl. Math. – volume: 168 start-page: 81 year: 2015 end-page: 90 ident: b64 article-title: Some due date determination scheduling problems with two agents on a single machine publication-title: Int. J. Prod. Econ. – volume: 312 start-page: 866 year: 2024 end-page: 876 ident: b47 article-title: Two-agent single-machine scheduling with a rate-modifying activity publication-title: European J. Oper. Res. – volume: 322 start-page: 467 year: 2025 end-page: 479 ident: b9 article-title: Single-machine preemptive scheduling with assignable due dates or assignable weights to minimize total weighted late work publication-title: European J. Oper. Res. – volume: 62 start-page: 421 year: 2024 end-page: 443 ident: b63 article-title: Scheduling a multi-agent flow shop with two scenarios and release dates publication-title: Int. J. Prod. Res. – volume: 38 year: 2021 ident: b16 article-title: A parallel machine scheduling problem maximizing total weighted early work publication-title: Asia-Pac. J. Oper. Res. – year: 2014 ident: b2 article-title: Multiagent Scheduling: Models and Algorithms – volume: 39 start-page: 120 year: 2011 end-page: 129 ident: b59 article-title: A survey of scheduling problems with late work criteria publication-title: Omega – volume: 41 year: 2024 ident: b13 article-title: Minimizing total weighted late work in a proportionate flow shop with job rejection publication-title: Asia-Pac. J. Oper. Res. – volume: 2 start-page: 83 year: 1955 end-page: 97 ident: b33 article-title: The Hungarian method for the assignment problem publication-title: Naval Res. Logist. – volume: 13 start-page: 117 year: 2002 end-page: 132 ident: b24 article-title: Due date assignment and scheduling: SLK, TWK and other due date assignment models publication-title: Prod. Plan. Control – volume: 43 start-page: 229 year: 2024 ident: b39 article-title: A two-agent resource allocation scheduling problem with slack due-date assignment and general deterioration function publication-title: Comput. Appl. Math. – volume: 52 start-page: 229 year: 2004 end-page: 242 ident: b3 article-title: Scheduling problems with two competing agents publication-title: Oper. Res. – volume: 303 start-page: 66 year: 2022 end-page: 77 ident: b57 article-title: Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work publication-title: European J. Oper. Res. – volume: 72 start-page: 260 year: 2025 end-page: 274 ident: b55 article-title: Single machine scheduling with the total weighted late work and rejection cost publication-title: Naval Res. Logist. – volume: 52 start-page: 210 year: 2007 end-page: 228 ident: b58 article-title: Late work minimization in a small flexible manufacturing system publication-title: Comput. Ind. Eng. – volume: 68 start-page: 378 year: 2021 end-page: 393 ident: b71 article-title: Pareto-optimization of three-agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work publication-title: Naval Res. Logist. – volume: 37 start-page: 989 year: 2019 end-page: 999 ident: b70 article-title: A note on a two-agent scheduling problem related to the total weighted late work publication-title: J. Comb. Optim. – volume: 152 year: 2023 ident: b4 article-title: Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity publication-title: Comput. Oper. Res. – volume: 290 start-page: 71 year: 2021 end-page: 78 ident: b12 article-title: Semi-online scheduling on two identical machines with a common due date to maximize total early work publication-title: Discrete Appl. Math. – volume: 174 start-page: 927 year: 2017 end-page: 944 ident: b61 article-title: Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work publication-title: J. Optim. Theory Appl. – volume: 142 year: 2022 ident: b19 article-title: An exact algorithm for the preemptive single machine scheduling of equal-length jobs publication-title: Comput. Oper. Res. – year: 1979 ident: b22 article-title: Computers and Intractability: A Guide to the Theory of NP-Completeness – volume: 177 year: 2025 ident: b50 article-title: A systematic review of permutation flow shop scheduling with due-date-related objectives publication-title: Comput. Oper. Res. – volume: 104 year: 2021 ident: b60 article-title: Late and early work scheduling: A survey publication-title: Omega – volume: 333 start-page: 275 year: 2024 end-page: 301 ident: b41 article-title: Two-agent scheduling in a two-machine open shop publication-title: Ann. Oper. Res. – volume: 21 start-page: 2015 year: 2017 end-page: 2033 ident: b62 article-title: A two-agent single-machine scheduling problem with late work criteria publication-title: Soft Comput. – volume: 49 start-page: 854 year: 2001 end-page: 865 ident: b27 article-title: Generating experimental data for computational testing with machine scheduling applications publication-title: Oper. Res. – volume: 244 start-page: 86 year: 2015 end-page: 99 ident: b44 article-title: Single machine scheduling with two competing agents and equal job processing times publication-title: European J. Oper. Res. – volume: 161 year: 2024 ident: b65 article-title: On implementing autonomous supply chains: A multi-agent system approach publication-title: Comput. Ind. – volume: 171 year: 2022 ident: b15 article-title: Alternative algorithms for identical machines scheduling to maximize total early work with a common due date publication-title: Comput. Ind. Eng. – volume: 23 start-page: 497 year: 2020 end-page: 512 ident: b40 article-title: Single-machine scheduling with multi-agents to minimize total weighted late work publication-title: J. Sched. – volume: 308 start-page: 76 year: 2023 end-page: 83 ident: b31 article-title: Single machine scheduling with assignable due dates to minimize maximum and total late work publication-title: European J. Oper. Res. – volume: 308 start-page: 1074 year: 2023 end-page: 1090 ident: b23 article-title: Single-machine scheduling of multiple projects with controllable processing times publication-title: European J. Oper. Res. – volume: 235 start-page: 1 year: 2014 end-page: 16 ident: b46 article-title: A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: Multi-agent scheduling problems publication-title: European J. Oper. Res. – volume: 122 start-page: 211 year: 2002 end-page: 233 ident: b51 article-title: Single machine scheduling with assignable due dates publication-title: Discrete Appl. Math. – volume: 11 start-page: 2737 year: 2023 ident: b69 article-title: Two-agent slack due-date assignment scheduling with resource allocations and deteriorating jobs publication-title: Mathematics – volume: 1012 year: 2024 ident: b25 article-title: Optimal algorithms for preemptive two-agent scheduling on uniform parallel machines publication-title: Theoret. Comput. Sci. – volume: 26 start-page: 227 year: 2023 end-page: 249 ident: b37 article-title: Competitive two-agent scheduling with release dates and preemption on a single machine publication-title: J. Sched. – year: 2020 ident: b67 article-title: Due Date-Related Scheduling with Two Agents: Models and Algorithms – volume: 322 start-page: 947 year: 2023 end-page: 966 ident: b56 article-title: A new perspective on single-machine scheduling problems with late work related criteria publication-title: Ann. Oper. Res. – volume: 55 start-page: 6193 year: 2017 end-page: 6206 ident: b1 article-title: Integrated production scheduling and batch delivery with fixed departure times and inventory holding costs publication-title: Int. J. Prod. Res. – volume: 293 start-page: 837 year: 2021 end-page: 846 ident: b42 article-title: Minimizing total late work on a single machine with generalized due-dates publication-title: European J. Oper. Res. – volume: 61 start-page: 7630 year: 2023 end-page: 7648 ident: b10 article-title: Revisit the scheduling problem with assignable or generalized due dates to minimize total weighted late work publication-title: Int. J. Prod. Res. – volume: 58 start-page: 458 year: 2010 end-page: 469 ident: b34 article-title: Competitive two-agent scheduling and its applications publication-title: Oper. Res. – volume: 102 year: 2021 ident: b43 article-title: Two-agent scheduling problems under rejection budget constraints publication-title: Omega – volume: 163 year: 2024 ident: b52 article-title: Metaheuristics for the bi-objective resource-constrained project scheduling problem with time-dependent resource costs: An experimental comparison publication-title: Comput. Oper. Res. – volume: 61 start-page: 238 issue: 1 year: 2023 ident: 10.1016/j.cor.2025.107144_b18 article-title: Two-agent scheduling on mixed batch machines to minimize the total weighted makespan publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2020.1820095 – volume: 315 start-page: 855 issue: 3 year: 2024 ident: 10.1016/j.cor.2025.107144_b30 article-title: Online early work scheduling on parallel machines publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2024.01.009 – volume: 168 start-page: 81 year: 2015 ident: 10.1016/j.cor.2025.107144_b64 article-title: Some due date determination scheduling problems with two agents on a single machine publication-title: Int. J. Prod. Econ. doi: 10.1016/j.ijpe.2015.06.018 – volume: 159 year: 2023 ident: 10.1016/j.cor.2025.107144_b45 article-title: A multi-agent system for integrated scheduling and maintenance planning of the flexible job shop publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2023.106365 – volume: 11 start-page: 2737 issue: 12 year: 2023 ident: 10.1016/j.cor.2025.107144_b69 article-title: Two-agent slack due-date assignment scheduling with resource allocations and deteriorating jobs publication-title: Mathematics doi: 10.3390/math11122737 – volume: 312 start-page: 866 issue: 3 year: 2024 ident: 10.1016/j.cor.2025.107144_b47 article-title: Two-agent single-machine scheduling with a rate-modifying activity publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2023.08.002 – volume: 41 issue: 3 year: 2024 ident: 10.1016/j.cor.2025.107144_b13 article-title: Minimizing total weighted late work in a proportionate flow shop with job rejection publication-title: Asia-Pac. J. Oper. Res. doi: 10.1142/S0217595923500239 – volume: 219 start-page: 1674 issue: 4 year: 2012 ident: 10.1016/j.cor.2025.107144_b66 article-title: Two-agent single-machine scheduling with assignable due dates publication-title: Appl. Math. Comput. – volume: 290 start-page: 71 year: 2021 ident: 10.1016/j.cor.2025.107144_b12 article-title: Semi-online scheduling on two identical machines with a common due date to maximize total early work publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2020.05.023 – volume: 38 issue: 6 year: 2021 ident: 10.1016/j.cor.2025.107144_b16 article-title: A parallel machine scheduling problem maximizing total weighted early work publication-title: Asia-Pac. J. Oper. Res. doi: 10.1142/S021759592150007X – volume: 52 start-page: 229 issue: 2 year: 2004 ident: 10.1016/j.cor.2025.107144_b3 article-title: Scheduling problems with two competing agents publication-title: Oper. Res. doi: 10.1287/opre.1030.0092 – volume: 322 start-page: 467 issue: 2 year: 2025 ident: 10.1016/j.cor.2025.107144_b9 article-title: Single-machine preemptive scheduling with assignable due dates or assignable weights to minimize total weighted late work publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2024.11.010 – volume: 52 start-page: 210 issue: 2 year: 2007 ident: 10.1016/j.cor.2025.107144_b58 article-title: Late work minimization in a small flexible manufacturing system publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2006.12.004 – volume: 174 start-page: 927 year: 2017 ident: 10.1016/j.cor.2025.107144_b61 article-title: Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-017-1147-7 – year: 1979 ident: 10.1016/j.cor.2025.107144_b22 – volume: 12 start-page: 341 issue: 2 year: 2024 ident: 10.1016/j.cor.2025.107144_b35 article-title: Improved approximation schemes for early work scheduling on identical parallel machines with a common due date publication-title: J. Oper. Res. Soc. China doi: 10.1007/s40305-022-00402-y – volume: 177 year: 2025 ident: 10.1016/j.cor.2025.107144_b50 article-title: A systematic review of permutation flow shop scheduling with due-date-related objectives publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2025.106989 – volume: 163 year: 2024 ident: 10.1016/j.cor.2025.107144_b52 article-title: Metaheuristics for the bi-objective resource-constrained project scheduling problem with time-dependent resource costs: An experimental comparison publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2023.106489 – volume: 61 start-page: 7630 issue: 22 year: 2023 ident: 10.1016/j.cor.2025.107144_b10 article-title: Revisit the scheduling problem with assignable or generalized due dates to minimize total weighted late work publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2022.2160502 – volume: 2 start-page: 83 issue: 1–2 year: 1955 ident: 10.1016/j.cor.2025.107144_b33 article-title: The Hungarian method for the assignment problem publication-title: Naval Res. Logist. doi: 10.1002/nav.3800020109 – volume: 18 start-page: 220 issue: 2 year: 1986 ident: 10.1016/j.cor.2025.107144_b26 article-title: Scheduling problems with generalized due dates publication-title: IIE Trans. doi: 10.1080/07408178608975351 – volume: 58 start-page: 458 issue: 2 year: 2010 ident: 10.1016/j.cor.2025.107144_b34 article-title: Competitive two-agent scheduling and its applications publication-title: Oper. Res. doi: 10.1287/opre.1090.0744 – volume: 21 start-page: 583 issue: 6 year: 2018 ident: 10.1016/j.cor.2025.107144_b17 article-title: Shared processor scheduling publication-title: J. Sched. doi: 10.1007/s10951-018-0566-0 – volume: 104 year: 2021 ident: 10.1016/j.cor.2025.107144_b60 article-title: Late and early work scheduling: A survey publication-title: Omega doi: 10.1016/j.omega.2021.102453 – volume: 170 year: 2024 ident: 10.1016/j.cor.2025.107144_b38 article-title: Two-agent scheduling on a single machine with release dates publication-title: Comput. Oper. Res. – volume: 303 start-page: 66 issue: 1 year: 2022 ident: 10.1016/j.cor.2025.107144_b57 article-title: Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2022.02.017 – volume: 301 start-page: 414 issue: 2 year: 2022 ident: 10.1016/j.cor.2025.107144_b11 article-title: Pareto-scheduling of two competing agents with their own equal processing times publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2021.10.064 – volume: 142 year: 2022 ident: 10.1016/j.cor.2025.107144_b19 article-title: An exact algorithm for the preemptive single machine scheduling of equal-length jobs publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2022.105742 – volume: 235 start-page: 1 issue: 1 year: 2014 ident: 10.1016/j.cor.2025.107144_b46 article-title: A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: Multi-agent scheduling problems publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2013.09.017 – volume: 189 start-page: 49 year: 2015 ident: 10.1016/j.cor.2025.107144_b21 article-title: Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2015.03.011 – volume: 62 start-page: 421 issue: 1–2 year: 2024 ident: 10.1016/j.cor.2025.107144_b63 article-title: Scheduling a multi-agent flow shop with two scenarios and release dates publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2023.2188646 – volume: 134 start-page: 1 issue: 1–3 year: 2004 ident: 10.1016/j.cor.2025.107144_b8 article-title: Open shop scheduling problems with late work criteria publication-title: Discrete Appl. Math. doi: 10.1016/S0166-218X(03)00339-1 – volume: 7 start-page: 232 issue: 2 year: 1995 ident: 10.1016/j.cor.2025.107144_b28 article-title: Single machine scheduling to minimize total weighted late work publication-title: ORSA J. Comput. doi: 10.1287/ijoc.7.2.232 – volume: 321 start-page: 734 issue: 3 year: 2025 ident: 10.1016/j.cor.2025.107144_b48 article-title: Minimizing the number of late jobs and total late work with step-learning publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2024.09.042 – volume: 40 start-page: 586 issue: 3 year: 1992 ident: 10.1016/j.cor.2025.107144_b49 article-title: Single machine scheduling to minimize total late work publication-title: Oper. Res. doi: 10.1287/opre.40.3.586 – volume: 1012 year: 2024 ident: 10.1016/j.cor.2025.107144_b25 article-title: Optimal algorithms for preemptive two-agent scheduling on uniform parallel machines publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2024.114729 – volume: 6 start-page: 7 issue: 1 year: 2003 ident: 10.1016/j.cor.2025.107144_b5 article-title: A multiple-criterion model for machine scheduling publication-title: J. Sched. doi: 10.1023/A:1022231419049 – volume: 244 start-page: 86 issue: 1 year: 2015 ident: 10.1016/j.cor.2025.107144_b44 article-title: Single machine scheduling with two competing agents and equal job processing times publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2015.01.003 – volume: 55 start-page: 6193 issue: 20 year: 2017 ident: 10.1016/j.cor.2025.107144_b1 article-title: Integrated production scheduling and batch delivery with fixed departure times and inventory holding costs publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2017.1346323 – volume: 102 year: 2021 ident: 10.1016/j.cor.2025.107144_b43 article-title: Two-agent scheduling problems under rejection budget constraints publication-title: Omega doi: 10.1016/j.omega.2020.102313 – volume: 152 year: 2023 ident: 10.1016/j.cor.2025.107144_b4 article-title: Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2022.106133 – volume: 44 start-page: 1330 issue: 2 year: 2022 ident: 10.1016/j.cor.2025.107144_b36 article-title: Minimizing total weighted late work on a single-machine with non-availability intervals publication-title: J. Comb. Optim. doi: 10.1007/s10878-022-00890-x – volume: 37 start-page: 989 issue: 3 year: 2019 ident: 10.1016/j.cor.2025.107144_b70 article-title: A note on a two-agent scheduling problem related to the total weighted late work publication-title: J. Comb. Optim. doi: 10.1007/s10878-018-0337-z – volume: 133 year: 2021 ident: 10.1016/j.cor.2025.107144_b20 article-title: Scheduling with competing agents, total late work and job rejection publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2021.105329 – volume: 13 start-page: 117 issue: 2 year: 2002 ident: 10.1016/j.cor.2025.107144_b24 article-title: Due date assignment and scheduling: SLK, TWK and other due date assignment models publication-title: Prod. Plan. Control doi: 10.1080/09537280110069621 – volume: 122 start-page: 211 issue: 1–3 year: 2002 ident: 10.1016/j.cor.2025.107144_b51 article-title: Single machine scheduling with assignable due dates publication-title: Discrete Appl. Math. doi: 10.1016/S0166-218X(01)00316-X – year: 2020 ident: 10.1016/j.cor.2025.107144_b67 – volume: 213 start-page: 172 issue: 2 year: 2016 ident: 10.1016/j.cor.2025.107144_b68 article-title: Approximation schemes for single-machine scheduling with a fixed maintenance activity to minimize the total amount of late work publication-title: Naval Res. Logist. doi: 10.1002/nav.21684 – volume: 45 year: 2022 ident: 10.1016/j.cor.2025.107144_b29 article-title: Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan publication-title: Discrete Optim. doi: 10.1016/j.disopt.2022.100698 – volume: 36 start-page: 255 year: 1984 ident: 10.1016/j.cor.2025.107144_b6 article-title: Scheduling preemptible tasks on parallel processors with information loss publication-title: Tech. Sci. Inform. – volume: 308 start-page: 76 issue: 1 year: 2023 ident: 10.1016/j.cor.2025.107144_b31 article-title: Single machine scheduling with assignable due dates to minimize maximum and total late work publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2022.10.047 – volume: 43 start-page: 229 issue: 4 year: 2024 ident: 10.1016/j.cor.2025.107144_b39 article-title: A two-agent resource allocation scheduling problem with slack due-date assignment and general deterioration function publication-title: Comput. Appl. Math. doi: 10.1007/s40314-024-02753-z – volume: 72 start-page: 260 issue: 2 year: 2025 ident: 10.1016/j.cor.2025.107144_b55 article-title: Single machine scheduling with the total weighted late work and rejection cost publication-title: Naval Res. Logist. doi: 10.1002/nav.22222 – volume: 293 start-page: 837 issue: 3 year: 2021 ident: 10.1016/j.cor.2025.107144_b42 article-title: Minimizing total late work on a single machine with generalized due-dates publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2020.12.061 – year: 2014 ident: 10.1016/j.cor.2025.107144_b2 – volume: 121 year: 2023 ident: 10.1016/j.cor.2025.107144_b54 article-title: Single machine scheduling with due date assignment to minimize the total weighted lead time penalty and late work publication-title: Omega doi: 10.1016/j.omega.2023.102923 – volume: 23 start-page: 497 issue: 4 year: 2020 ident: 10.1016/j.cor.2025.107144_b40 article-title: Single-machine scheduling with multi-agents to minimize total weighted late work publication-title: J. Sched. doi: 10.1007/s10951-020-00646-7 – volume: 248 start-page: 67 issue: 1 year: 2020 ident: 10.1016/j.cor.2025.107144_b14 article-title: Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2019.12.003 – volume: 21 start-page: 2015 issue: 8 year: 2017 ident: 10.1016/j.cor.2025.107144_b62 article-title: A two-agent single-machine scheduling problem with late work criteria publication-title: Soft Comput. doi: 10.1007/s00500-015-1900-5 – volume: 161 year: 2024 ident: 10.1016/j.cor.2025.107144_b65 article-title: On implementing autonomous supply chains: A multi-agent system approach publication-title: Comput. Ind. doi: 10.1016/j.compind.2024.104120 – volume: 333 start-page: 275 issue: 1 year: 2024 ident: 10.1016/j.cor.2025.107144_b41 article-title: Two-agent scheduling in a two-machine open shop publication-title: Ann. Oper. Res. doi: 10.1007/s10479-023-05780-x – volume: 149 year: 2020 ident: 10.1016/j.cor.2025.107144_b53 article-title: Structural properties and algorithms for earliness and tardiness scheduling against common due dates and windows: A review publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2020.106803 – volume: 49 start-page: 854 issue: 7 year: 2001 ident: 10.1016/j.cor.2025.107144_b27 article-title: Generating experimental data for computational testing with machine scheduling applications publication-title: Oper. Res. doi: 10.1287/opre.49.6.854.10014 – year: 2019 ident: 10.1016/j.cor.2025.107144_b7 – volume: 39 start-page: 120 issue: 2 year: 2011 ident: 10.1016/j.cor.2025.107144_b59 article-title: A survey of scheduling problems with late work criteria publication-title: Omega doi: 10.1016/j.omega.2010.06.006 – volume: 308 start-page: 1074 issue: 3 year: 2023 ident: 10.1016/j.cor.2025.107144_b23 article-title: Single-machine scheduling of multiple projects with controllable processing times publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2023.01.026 – volume: 26 start-page: 227 issue: 3 year: 2023 ident: 10.1016/j.cor.2025.107144_b37 article-title: Competitive two-agent scheduling with release dates and preemption on a single machine publication-title: J. Sched. doi: 10.1007/s10951-023-00779-5 – volume: 171 year: 2022 ident: 10.1016/j.cor.2025.107144_b15 article-title: Alternative algorithms for identical machines scheduling to maximize total early work with a common due date publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2022.108386 – volume: 18 start-page: 423 issue: 4 year: 2015 ident: 10.1016/j.cor.2025.107144_b32 article-title: Two-agent scheduling with agent specific batches on an unbounded serial batching machine publication-title: J. Sched. doi: 10.1007/s10951-014-0410-0 – volume: 322 start-page: 947 issue: 2 year: 2023 ident: 10.1016/j.cor.2025.107144_b56 article-title: A new perspective on single-machine scheduling problems with late work related criteria publication-title: Ann. Oper. Res. doi: 10.1007/s10479-022-04806-0 – volume: 68 start-page: 378 issue: 3 year: 2021 ident: 10.1016/j.cor.2025.107144_b71 article-title: Pareto-optimization of three-agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work publication-title: Naval Res. Logist. doi: 10.1002/nav.21961 |
| SSID | ssj0000721 |
| Score | 2.4682672 |
| Snippet | This paper investigates several scheduling problems on a single machine that exhibit three key features: (i) assignable due dates are considered, meaning that... |
| SourceID | crossref elsevier |
| SourceType | Index Database Publisher |
| StartPage | 107144 |
| SubjectTerms | Assignable due dates Late work Scheduling Single machine Two-agent |
| Title | Scheduling with assignable due dates, two competing agents and late work related criteria |
| URI | https://dx.doi.org/10.1016/j.cor.2025.107144 |
| Volume | 182 |
| WOSCitedRecordID | wos001504242600002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 issn: 0305-0548 databaseCode: AIEXJ dateStart: 19950101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0000721 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3fT9swED5tgCZ42KADjY1NfuAJFomaOHYeK8TEJoQmwo_yFKW2U4qqpGrTUe2v3_lHEoRAGpP20KiymqS6-2yfP993BthFP0tpdnUjrWUQauxzWX5geSuuMIBn2u7oXp3yszPR78c_PaE_s8cJ8KIQi0U8-a-uxjZ0tpHOvsDdzUOxAb-j0_GKbsfrXzk-QTeo-bghWTE6Hg29QmqOHxNcGsNW96VNKLea5_1saKVuhkYf4y_sETJO6IIRKY4slc9Hbssa-OMgZhY85URPfVKdLx_U0MynNl8guR0Fya3286ShdDxRfZOVwXWrRzvyapFzXQT9UTNnJJa3dOKi8bCc_naSuoawoKxJffMsWq2kadOWrHrLJBEyV3WzHZnpk6O8Ixzu0Emmoitl2MK7rozko-LZiXmueSxGema1K17DMuUsxiF8uff9uP-jnbW51eg1_6PeAbe5gI9e9HQM8yAuuViHt35BQXoOCBvwShcdeFPrGTrwrnYU8cN4B9YeFKF8DzctYIgBDGkBQxAwxALmK0G4kAYuxMGFIFyIgQgxcCEeLqSGyyZcfju-ODoJ_IEbgaQ8qgI5CPM8D0UsY6EGMc0HLMd4nZoakSqLY8Ulw0bFFYY-UYYrA5rrEDu5FBmTQh9uwVJRFvoDkIgrGqouE4ehxA7fFRKXcgMW8QPBtVTZNuzVJkwnrq5KWicc3qVo79TYO3X23oawNnLqA0MX8KWIiOdv-_hvt32C1Ra2O7BUTef6M6zIX9VoNv3icfMHjKiIHA |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Scheduling+with+assignable+due+dates%2C+two+competing+agents+and+late+work+related+criteria&rft.jtitle=Computers+%26+operations+research&rft.au=Li%2C+Shi-Sheng&rft.au=Sang%2C+Yao-Wen&rft.au=Chen%2C+Ren-Xia&rft.au=Sterna%2C+Malgorzata&rft.date=2025-10-01&rft.pub=Elsevier+Ltd&rft.issn=0305-0548&rft.volume=182&rft_id=info:doi/10.1016%2Fj.cor.2025.107144&rft.externalDocID=S0305054825001728 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0548&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0548&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0548&client=summon |