Bounded mixed batch scheduling with job release dates and rejection
This paper investigates a bounded mixed batch scheduling problem with job release dates and rejection. The machine processes a batch containing several jobs that their number does not exceed the machine capacity. For the case with a certain release date, we present a polynomial-time exact algorithm....
Uloženo v:
| Vydáno v: | Operations research letters Ročník 57; s. 107159 |
|---|---|
| Hlavní autoři: | , , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
01.11.2024
|
| Témata: | |
| ISSN: | 0167-6377 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | This paper investigates a bounded mixed batch scheduling problem with job release dates and rejection. The machine processes a batch containing several jobs that their number does not exceed the machine capacity. For the case with a certain release date, we present a polynomial-time exact algorithm. For the case with a constant number of release dates, a pseudo-polynomial-time exact algorithm is proposed. For the general problem, we provide a 2-approximation algorithm and a polynomial-time approximation scheme.
•We investigate a bounded mixed batch scheduling problem with job release dates and rejection penalty.•We present a polynomial-time exact algorithm and a pseudo-polynomial time exact algorithm for two special cases.•For the general problem, we devise a 2-approximation algorithm and a polynomial-time approximation scheme. |
|---|---|
| AbstractList | This paper investigates a bounded mixed batch scheduling problem with job release dates and rejection. The machine processes a batch containing several jobs that their number does not exceed the machine capacity. For the case with a certain release date, we present a polynomial-time exact algorithm. For the case with a constant number of release dates, a pseudo-polynomial-time exact algorithm is proposed. For the general problem, we provide a 2-approximation algorithm and a polynomial-time approximation scheme.
•We investigate a bounded mixed batch scheduling problem with job release dates and rejection penalty.•We present a polynomial-time exact algorithm and a pseudo-polynomial time exact algorithm for two special cases.•For the general problem, we devise a 2-approximation algorithm and a polynomial-time approximation scheme. |
| ArticleNumber | 107159 |
| Author | Zhang, Daxing Lin, Ran Fan, Guo-Qiang Huang, Yong-Xing Xu, Jun |
| Author_xml | – sequence: 1 givenname: Jun surname: Xu fullname: Xu, Jun organization: Advanced Manufacturing Technology Innovation Center, Guangzhou Institute of Technology, Xidian University, Guangzhou 510555, China – sequence: 2 givenname: Yong-Xing surname: Huang fullname: Huang, Yong-Xing organization: Department of Industrial Engineering, School of Mechanical Engineering, Northwestern Polytechnical University, Xi'an, 710072, China – sequence: 3 givenname: Daxing surname: Zhang fullname: Zhang, Daxing organization: Advanced Manufacturing Technology Innovation Center, Guangzhou Institute of Technology, Xidian University, Guangzhou 510555, China – sequence: 4 givenname: Ran surname: Lin fullname: Lin, Ran organization: School of Mathematics and Statistics, Zhengzhou University, Zhengzhou, 450001, China – sequence: 5 givenname: Guo-Qiang orcidid: 0000-0001-6432-3181 surname: Fan fullname: Fan, Guo-Qiang email: gqfan@xidian.edu.cn organization: School of Economics and Management, Xidian University, Xi'an 710126, China |
| BookMark | eNp9j01PAyEQhjnUxLb6A7zxB7YC3V1KPGnjV9LES--EZWYtmy0YoH78e2nqyUMvM5k380zmmZGJDx4JueFswRlvb4dFiONCMFGXWfJGTci05LJql1JekllKA2NMrvhqStYP4eABge7dd6mdyXZHk90hHEbn3-mXyzs6hI5GHNEkpGAyJmo8lGRAm13wV-SiN2PC678-J9unx-36pdq8Pb-u7zeVXQqRKwRsoO1XXS2UMIIjWlS2h840ohNlYJ1obdlVylhlWwbK1gLaBuoaJF_OiTydtTGkFLHX1mVzfCBH40bNmT7q60EXfX3U1yf9QvJ_5Ed0exN_zjJ3JwaL0afDqJN16C2Ci0VbQ3Bn6F8U5Xh4 |
| CitedBy_id | crossref_primary_10_1016_j_ejor_2025_07_012 |
| Cites_doi | 10.1016/j.ejor.2021.06.012 10.1080/00207543.2020.1820095 10.1057/jors.2011.31 10.1016/j.omega.2022.102804 10.1007/s10288-016-0304-4 10.1016/j.dam.2015.10.021 10.1137/S0895480196300522 10.1016/j.disopt.2015.02.001 10.1080/002075499192020 10.1007/s10951-010-0222-9 10.1016/S0167-5060(08)70356-X 10.1016/j.omega.2021.102567 10.1016/j.ejor.2007.11.047 10.1007/s10951-020-00656-5 10.1016/j.cor.2008.12.003 10.1016/S0166-218X(00)00181-5 10.1016/j.ejor.2008.10.006 10.1016/j.ejor.2023.01.027 10.1016/S0377-2217(99)00153-8 10.1016/0167-6377(86)90104-5 10.1007/s10951-019-00623-9 10.1007/s10288-016-0339-6 10.1007/s10479-016-2277-2 10.1287/opre.40.4.764 10.1007/BF02248589 |
| ContentType | Journal Article |
| Copyright | 2024 Elsevier B.V. |
| Copyright_xml | – notice: 2024 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.orl.2024.107159 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Sciences (General) |
| ExternalDocumentID | 10_1016_j_orl_2024_107159 S0167637724000956 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1OL 1RT 1~. 1~5 29N 4.4 457 4G. 4R4 5VS 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AACTN AAEDT AAEDW AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXKI AAXUO ABAOU ABFNM ABJNI ABMAC ABUCO ABWVN ABXDB ACDAQ ACGFS ACNCT ACRLP ACRPL ADBBV ADEZE ADGUI ADIYS ADMUD ADNMO AEBSH AEKER AENEX AFFNX AFJKZ AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AIEXJ AIGVJ AIKHN AITUG AJOXV AKRWK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ APLSM ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CS3 DU5 EBS EFJIC EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA HAMUX HVGLF HZ~ IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SDF SDG SDS SES SEW SPC SPCBC SSB SSD SSW SSZ T5K TN5 WH7 WUQ XPP XSW ~G- 9DU AATTM AAYWO AAYXX ACLOT ACVFH ADCNI AEIPS AEUPX AFPUW AGQPQ AIGII AIIUN AKBMS AKYEP ANKPU APXCP CITATION EFKBS EFLBG ~HD |
| ID | FETCH-LOGICAL-c322t-ede5d6f8b4292a21eece9cfdba52b2ece0b26cc3299ac9c60d9c42d65d44d713 |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001299928900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0167-6377 |
| IngestDate | Tue Nov 18 21:01:57 EST 2025 Sat Nov 29 03:00:02 EST 2025 Sat Dec 21 16:00:17 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Mixed batch scheduling Exact algorithm Approximation algorithm Polynomial-time approximation scheme Rejection penalty |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c322t-ede5d6f8b4292a21eece9cfdba52b2ece0b26cc3299ac9c60d9c42d65d44d713 |
| ORCID | 0000-0001-6432-3181 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_orl_2024_107159 crossref_primary_10_1016_j_orl_2024_107159 elsevier_sciencedirect_doi_10_1016_j_orl_2024_107159 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-11-01 |
| PublicationDateYYYYMMDD | 2024-11-01 |
| PublicationDate_xml | – month: 11 year: 2024 text: 2024-11-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | Operations research letters |
| PublicationYear | 2024 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Lee, Uzsoy, Martin-Vega (br0120) 1992; 40 He, Lin, Lin (br0080) 2015; 16 Zhang, Lu, Ng (br0230) 2012; 63 Zhong, Ou (br0250) 2017; 15 Bartal, Leonardi, Marchetti-Spaccamela, Sgall, Stougie (br0010) 2000; 13 Xu, Wang, Liu (br0210) 2022; 108 Liu, Yu (br0150) 2000; 105 Mönch, Fowler, Dauzère-Pérès, Mason, Rose (br0170) 2011; 14 Cheng, Sun (br0020) 2009; 194 Graham, Lawler, Lenstra, Kan (br0060) 1979; 5 Zhang, Lu (br0220) 2016; 14 Fowler, Mönch (br0050) 2022; 298 Ou, Zhong (br0180) 2017; 248 He, Xu, Lin (br0090) 2020; 23 Fan, Wang, Liu (br0040) 2023; 61 He, Leung, Lee, Pinedo (br0070) 2016; 204 Lee (br0110) 1999; 37 Lin, Wang, Oulamara (br0140) 2023; 116 Coffman, Yannakakis, Magazine, Santos (br0030) 1990; 26 Ikura, Gimple (br0100) 1986; 5 Lin, Wang, Liu, Xu (br0130) 2023; 309 Potts, Kovalyov (br0190) 2000; 120 Zhang, Lu, Yuan (br0240) 2009; 198 Lu, Cheng, Yuan, Zhang (br0160) 2009; 36 Wang, Fan, Liu (br0200) 2020; 23 Ou (10.1016/j.orl.2024.107159_br0180) 2017; 248 Fan (10.1016/j.orl.2024.107159_br0040) 2023; 61 Fowler (10.1016/j.orl.2024.107159_br0050) 2022; 298 Liu (10.1016/j.orl.2024.107159_br0150) 2000; 105 Bartal (10.1016/j.orl.2024.107159_br0010) 2000; 13 He (10.1016/j.orl.2024.107159_br0080) 2015; 16 Lin (10.1016/j.orl.2024.107159_br0140) 2023; 116 Graham (10.1016/j.orl.2024.107159_br0060) 1979; 5 Mönch (10.1016/j.orl.2024.107159_br0170) 2011; 14 Zhang (10.1016/j.orl.2024.107159_br0220) 2016; 14 Potts (10.1016/j.orl.2024.107159_br0190) 2000; 120 Lin (10.1016/j.orl.2024.107159_br0130) 2023; 309 Wang (10.1016/j.orl.2024.107159_br0200) 2020; 23 Coffman (10.1016/j.orl.2024.107159_br0030) 1990; 26 Zhang (10.1016/j.orl.2024.107159_br0230) 2012; 63 Zhang (10.1016/j.orl.2024.107159_br0240) 2009; 198 Lu (10.1016/j.orl.2024.107159_br0160) 2009; 36 Xu (10.1016/j.orl.2024.107159_br0210) 2022; 108 Zhong (10.1016/j.orl.2024.107159_br0250) 2017; 15 Lee (10.1016/j.orl.2024.107159_br0120) 1992; 40 He (10.1016/j.orl.2024.107159_br0070) 2016; 204 Lee (10.1016/j.orl.2024.107159_br0110) 1999; 37 He (10.1016/j.orl.2024.107159_br0090) 2020; 23 Cheng (10.1016/j.orl.2024.107159_br0020) 2009; 194 Ikura (10.1016/j.orl.2024.107159_br0100) 1986; 5 |
| References_xml | – volume: 105 start-page: 129 year: 2000 end-page: 136 ident: br0150 article-title: Scheduling one batch processor subject to job release dates publication-title: Discrete Appl. Math. – volume: 14 start-page: 583 year: 2011 end-page: 599 ident: br0170 article-title: A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations publication-title: J. Sched. – volume: 198 start-page: 975 year: 2009 end-page: 978 ident: br0240 article-title: Single machine scheduling with release dates and rejection publication-title: Eur. J. Oper. Res. – volume: 63 start-page: 293 year: 2012 end-page: 298 ident: br0230 article-title: The unbounded parallel-batch scheduling with rejection publication-title: J. Oper. Res. Soc. – volume: 116 year: 2023 ident: br0140 article-title: Online scheduling on parallel-batch machines with periodic availability constraints and job delivery publication-title: Omega – volume: 37 start-page: 219 year: 1999 end-page: 236 ident: br0110 article-title: Minimizing makespan on a single batch processing machine with dynamic job arrivals publication-title: Int. J. Prod. Res. – volume: 16 start-page: 70 year: 2015 end-page: 75 ident: br0080 article-title: Bounded serial-batching scheduling for minimizing maximum lateness and makespan publication-title: Discrete Optim. – volume: 26 start-page: 135 year: 1990 end-page: 147 ident: br0030 article-title: Batch sizing and job sequencing on a single machine publication-title: Ann. Oper. Res. – volume: 61 start-page: 238 year: 2023 end-page: 257 ident: br0040 article-title: Two-agent scheduling on mixed batch machines to minimise the total weighted makespan publication-title: Int. J. Prod. Res. – volume: 15 start-page: 387 year: 2017 end-page: 406 ident: br0250 article-title: Improved approximation algorithms for parallel machine scheduling with release dates and job rejection publication-title: 4OR – volume: 36 start-page: 2748 year: 2009 end-page: 2751 ident: br0160 article-title: Bounded single-machine parallel-batch scheduling with release dates and rejection publication-title: Comput. Oper. Res. – volume: 5 start-page: 61 year: 1986 end-page: 65 ident: br0100 article-title: Efficient scheduling algorithms for a single batch processing machine publication-title: Oper. Res. Lett. – volume: 248 start-page: 429 year: 2017 end-page: 447 ident: br0180 article-title: Order acceptance and scheduling with consideration of service level publication-title: Ann. Oper. Res. – volume: 204 start-page: 150 year: 2016 end-page: 163 ident: br0070 article-title: Scheduling a single machine with parallel batching to minimize makespan and total rejection cost publication-title: Discrete Appl. Math. – volume: 5 start-page: 287 year: 1979 end-page: 326 ident: br0060 article-title: Optimization and approximation in deterministic sequencing and scheduling: a survey publication-title: Ann. Discrete Math. – volume: 120 start-page: 228 year: 2000 end-page: 249 ident: br0190 article-title: Scheduling with batching: a review publication-title: Eur. J. Oper. Res. – volume: 108 year: 2022 ident: br0210 article-title: Parallel batch scheduling: impact of increasing machine capacity publication-title: Omega – volume: 194 start-page: 18 year: 2009 end-page: 27 ident: br0020 article-title: Scheduling linear deteriorating jobs with rejection on a single machine publication-title: Eur. J. Oper. Res. – volume: 23 start-page: 609 year: 2020 end-page: 617 ident: br0090 article-title: Serial-batching scheduling with two agents to minimize makespan and maximum cost publication-title: J. Sched. – volume: 23 start-page: 487 year: 2020 end-page: 496 ident: br0200 article-title: Mixed batch scheduling on identical machines publication-title: J. Sched. – volume: 40 start-page: 764 year: 1992 end-page: 775 ident: br0120 article-title: Efficient algorithms for scheduling semiconductor burn-in operations publication-title: Oper. Res. – volume: 14 start-page: 165 year: 2016 end-page: 172 ident: br0220 article-title: Parallel-machine scheduling with release dates and rejection publication-title: 4OR – volume: 298 start-page: 1 year: 2022 end-page: 24 ident: br0050 article-title: A survey of scheduling with parallel batch (p-batch) processing publication-title: Eur. J. Oper. Res. – volume: 309 start-page: 53 year: 2023 end-page: 64 ident: br0130 article-title: Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions publication-title: Eur. J. Oper. Res. – volume: 13 start-page: 64 year: 2000 end-page: 78 ident: br0010 article-title: Multiprocessor scheduling with rejection publication-title: SIAM J. Discrete Math. – volume: 298 start-page: 1 issue: 1 year: 2022 ident: 10.1016/j.orl.2024.107159_br0050 article-title: A survey of scheduling with parallel batch (p-batch) processing publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2021.06.012 – volume: 61 start-page: 238 issue: 1 year: 2023 ident: 10.1016/j.orl.2024.107159_br0040 article-title: Two-agent scheduling on mixed batch machines to minimise the total weighted makespan publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2020.1820095 – volume: 63 start-page: 293 year: 2012 ident: 10.1016/j.orl.2024.107159_br0230 article-title: The unbounded parallel-batch scheduling with rejection publication-title: J. Oper. Res. Soc. doi: 10.1057/jors.2011.31 – volume: 116 year: 2023 ident: 10.1016/j.orl.2024.107159_br0140 article-title: Online scheduling on parallel-batch machines with periodic availability constraints and job delivery publication-title: Omega doi: 10.1016/j.omega.2022.102804 – volume: 14 start-page: 165 year: 2016 ident: 10.1016/j.orl.2024.107159_br0220 article-title: Parallel-machine scheduling with release dates and rejection publication-title: 4OR doi: 10.1007/s10288-016-0304-4 – volume: 204 start-page: 150 year: 2016 ident: 10.1016/j.orl.2024.107159_br0070 article-title: Scheduling a single machine with parallel batching to minimize makespan and total rejection cost publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2015.10.021 – volume: 13 start-page: 64 issue: 1 year: 2000 ident: 10.1016/j.orl.2024.107159_br0010 article-title: Multiprocessor scheduling with rejection publication-title: SIAM J. Discrete Math. doi: 10.1137/S0895480196300522 – volume: 16 start-page: 70 year: 2015 ident: 10.1016/j.orl.2024.107159_br0080 article-title: Bounded serial-batching scheduling for minimizing maximum lateness and makespan publication-title: Discrete Optim. doi: 10.1016/j.disopt.2015.02.001 – volume: 37 start-page: 219 issue: 1 year: 1999 ident: 10.1016/j.orl.2024.107159_br0110 article-title: Minimizing makespan on a single batch processing machine with dynamic job arrivals publication-title: Int. J. Prod. Res. doi: 10.1080/002075499192020 – volume: 14 start-page: 583 year: 2011 ident: 10.1016/j.orl.2024.107159_br0170 article-title: A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations publication-title: J. Sched. doi: 10.1007/s10951-010-0222-9 – volume: 5 start-page: 287 year: 1979 ident: 10.1016/j.orl.2024.107159_br0060 article-title: Optimization and approximation in deterministic sequencing and scheduling: a survey publication-title: Ann. Discrete Math. doi: 10.1016/S0167-5060(08)70356-X – volume: 108 year: 2022 ident: 10.1016/j.orl.2024.107159_br0210 article-title: Parallel batch scheduling: impact of increasing machine capacity publication-title: Omega doi: 10.1016/j.omega.2021.102567 – volume: 194 start-page: 18 issue: 1 year: 2009 ident: 10.1016/j.orl.2024.107159_br0020 article-title: Scheduling linear deteriorating jobs with rejection on a single machine publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2007.11.047 – volume: 23 start-page: 609 year: 2020 ident: 10.1016/j.orl.2024.107159_br0090 article-title: Serial-batching scheduling with two agents to minimize makespan and maximum cost publication-title: J. Sched. doi: 10.1007/s10951-020-00656-5 – volume: 36 start-page: 2748 issue: 10 year: 2009 ident: 10.1016/j.orl.2024.107159_br0160 article-title: Bounded single-machine parallel-batch scheduling with release dates and rejection publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2008.12.003 – volume: 105 start-page: 129 issue: 1–3 year: 2000 ident: 10.1016/j.orl.2024.107159_br0150 article-title: Scheduling one batch processor subject to job release dates publication-title: Discrete Appl. Math. doi: 10.1016/S0166-218X(00)00181-5 – volume: 198 start-page: 975 issue: 3 year: 2009 ident: 10.1016/j.orl.2024.107159_br0240 article-title: Single machine scheduling with release dates and rejection publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2008.10.006 – volume: 309 start-page: 53 issue: 1 year: 2023 ident: 10.1016/j.orl.2024.107159_br0130 article-title: Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2023.01.027 – volume: 120 start-page: 228 issue: 2 year: 2000 ident: 10.1016/j.orl.2024.107159_br0190 article-title: Scheduling with batching: a review publication-title: Eur. J. Oper. Res. doi: 10.1016/S0377-2217(99)00153-8 – volume: 5 start-page: 61 issue: 2 year: 1986 ident: 10.1016/j.orl.2024.107159_br0100 article-title: Efficient scheduling algorithms for a single batch processing machine publication-title: Oper. Res. Lett. doi: 10.1016/0167-6377(86)90104-5 – volume: 23 start-page: 487 year: 2020 ident: 10.1016/j.orl.2024.107159_br0200 article-title: Mixed batch scheduling on identical machines publication-title: J. Sched. doi: 10.1007/s10951-019-00623-9 – volume: 15 start-page: 387 year: 2017 ident: 10.1016/j.orl.2024.107159_br0250 article-title: Improved approximation algorithms for parallel machine scheduling with release dates and job rejection publication-title: 4OR doi: 10.1007/s10288-016-0339-6 – volume: 248 start-page: 429 year: 2017 ident: 10.1016/j.orl.2024.107159_br0180 article-title: Order acceptance and scheduling with consideration of service level publication-title: Ann. Oper. Res. doi: 10.1007/s10479-016-2277-2 – volume: 40 start-page: 764 issue: 4 year: 1992 ident: 10.1016/j.orl.2024.107159_br0120 article-title: Efficient algorithms for scheduling semiconductor burn-in operations publication-title: Oper. Res. doi: 10.1287/opre.40.4.764 – volume: 26 start-page: 135 year: 1990 ident: 10.1016/j.orl.2024.107159_br0030 article-title: Batch sizing and job sequencing on a single machine publication-title: Ann. Oper. Res. doi: 10.1007/BF02248589 |
| SSID | ssj0007818 |
| Score | 2.3976274 |
| Snippet | This paper investigates a bounded mixed batch scheduling problem with job release dates and rejection. The machine processes a batch containing several jobs... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 107159 |
| SubjectTerms | Approximation algorithm Exact algorithm Mixed batch scheduling Polynomial-time approximation scheme Rejection penalty |
| Title | Bounded mixed batch scheduling with job release dates and rejection |
| URI | https://dx.doi.org/10.1016/j.orl.2024.107159 |
| Volume | 57 |
| WOSCitedRecordID | wos001299928900001&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: 0167-6377 databaseCode: AIEXJ dateStart: 19950201 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0007818 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Rb9MwELZg4wEeJjZAjAHyAw9AFZS6Thw_jm0I0DQQ9CE8RY7tbKtKWqXd1J-_s31JMwYIkHiJEit2q_tO5_Pl7jtCXnBZ8SxNFCAgRcR1piMllYiqobZCsqzS2iN9LE5OsjyXn7Gt4sK3ExB1na1Wcv5foYYxANuVzv4F3N2iMAD3ADpcAXa4_hHwb12jJHAjv5-vnHcJpvZsAEdY2FKmXeB1Mit9txTYwgbuyB-Imhs78YlZdd9j_TS3DabLITHQ2WDqa4A6bzy_CPUd9VpHMAr9bVafRnm7O_bj04dq1Rs-DkwGX1BVMQrBOJbjdaGxG-UxIVoJVjgdYZ8WNLeBj_qG5Q5BhMmbWeM-CDEOI2KIZOHXCbG_umXdqi791fEo3iabTCQSbNrm_oej_GO3E4vMx3e7v9F-1fb5fT_80M_9kp6vMb5PtvCQQPcDuNvklq13yL0edeQO2UajvKAvkTn81QNygNhTjz312NM19tRhTwF7ithTjz0F7GmH_UMyfnc0PngfYZeMSIMxXkbW2MSkVVa6xmOKDa3VVurKlCphJYOHuGSphnelVFrqNDZSc2bSxHBuxHD0iGzUs9o-JjS21vVtNjqzlpsqVmykEq1GijtPTqe7JG5FVGhkkHeNTKZFmyo4KUCqhZNqEaS6S153U-aBPuV3L_NW7gX6f8GvK0BJfj3tyb9N2yN314r8lGwsmwv7jNzRl8vzRfMcVekK7mN_FA |
| 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=Bounded+mixed+batch+scheduling+with+job+release+dates+and+rejection&rft.jtitle=Operations+research+letters&rft.au=Xu%2C+Jun&rft.au=Huang%2C+Yong-Xing&rft.au=Zhang%2C+Daxing&rft.au=Lin%2C+Ran&rft.date=2024-11-01&rft.pub=Elsevier+B.V&rft.issn=0167-6377&rft.volume=57&rft_id=info:doi/10.1016%2Fj.orl.2024.107159&rft.externalDocID=S0167637724000956 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0167-6377&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0167-6377&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0167-6377&client=summon |