Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection
In this paper we study a single batch-processing machine scheduling model. In our model, a set of jobs having different release dates needs to be scheduled onto a single machine that can process a batch of jobs simultaneously at a time. Each batch incurs a fixed setup time and a fixed setup cost. Th...
Saved in:
| Published in: | Journal of scheduling Vol. 23; no. 5; pp. 525 - 538 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
Springer US
01.10.2020
Springer Nature B.V |
| Subjects: | |
| ISSN: | 1094-6136, 1099-1425 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | In this paper we study a single batch-processing machine scheduling model. In our model, a set of jobs having different release dates needs to be scheduled onto a single machine that can process a batch of jobs simultaneously at a time. Each batch incurs a fixed setup time and a fixed setup cost. The decision maker may reject some of the jobs by paying penalty cost so as to achieve a tight makespan, but the total rejection penalty cost is required to be no greater than a given value. Our model extends several existing batch-processing machine scheduling models in the literature. We present efficient approximation algorithms with near-linear-time complexities. |
|---|---|
| AbstractList | In this paper we study a single batch-processing machine scheduling model. In our model, a set of jobs having different release dates needs to be scheduled onto a single machine that can process a batch of jobs simultaneously at a time. Each batch incurs a fixed setup time and a fixed setup cost. The decision maker may reject some of the jobs by paying penalty cost so as to achieve a tight makespan, but the total rejection penalty cost is required to be no greater than a given value. Our model extends several existing batch-processing machine scheduling models in the literature. We present efficient approximation algorithms with near-linear-time complexities. |
| Author | Ou, Jinwen |
| Author_xml | – sequence: 1 givenname: Jinwen surname: Ou fullname: Ou, Jinwen email: toujinwen@jnu.edu.cn organization: Department of Management Administration, School of Management, Jinan University |
| BookMark | eNp9kE1LAzEQhoNUsK3-AU8Bz9HJbpLdPUrxC4pe9ByyadLusl9Nsqj_3rQrCB56mmF4n3dm3gWadX1nELqmcEsBsjtPoeCUQAIEQPCMsDM0j7OCUJbw2bFnRNBUXKCF9zUA5FlC52j_apQjTdUdSqhag9UwuP6ralWo-g6rZtu7Kuxaj23vsNc7sxmjfIsVLlXQOxLV2nh_GLVK76IT_owA9iaMg8eq2-C6L7EztdEHy0t0blXjzdVvXaKPx4f31TNZvz29rO7XRKeZCESYRDDGS82oTcrCgLUpTa3ZKJ5ylmgONLecq0LkZZFZyHIoDAdhi7zUmufpEt1MvvHA_Wh8kHU_ui6ulEnOeCGylNGoSiaVdr33zlg5uPi7-5YU5CFaOUUrY7TyGK1kEcr_QboKx7yCU1VzGk0n1Mc93da4v6tOUD-0upFV |
| CitedBy_id | crossref_primary_10_3934_jimo_2025105 crossref_primary_10_1016_j_ejor_2023_04_019 crossref_primary_10_1016_j_ejor_2025_08_035 crossref_primary_10_1016_j_cie_2024_110471 |
| Cites_doi | 10.1016/j.ipl.2016.02.008 10.1007/978-3-540-24777-7 10.1016/j.tcs.2009.04.006 10.1080/002075499192020 10.1016/j.tcs.2008.02.015 10.1016/S0305-0483(98)00042-5 10.1016/j.ejor.2013.08.013 10.1016/S0167-6377(02)00186-4 10.1016/j.dam.2015.10.021 10.1016/j.ejor.2017.04.036 10.1057/jors.2011.31 10.1016/S0377-2217(99)00153-8 10.1016/j.ejor.2010.09.042 10.1287/opre.43.4.692 10.1023/A:1010991401683 10.1016/j.ejor.2006.06.060 10.1016/S0166-218X(00)00181-5 10.1002/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO;2-R 10.1016/j.ejor.2016.11.036 10.1016/j.cor.2008.12.003 10.1007/s10951-012-0303-z 10.1287/opre.40.4.764 10.1016/j.ejor.2008.10.006 10.1007/s10288-016-0303-5 |
| ContentType | Journal Article |
| Copyright | Springer Science+Business Media, LLC, part of Springer Nature 2020 Springer Science+Business Media, LLC, part of Springer Nature 2020. |
| Copyright_xml | – notice: Springer Science+Business Media, LLC, part of Springer Nature 2020 – notice: Springer Science+Business Media, LLC, part of Springer Nature 2020. |
| DBID | AAYXX CITATION 3V. 7TA 7TB 7WY 7WZ 7X7 7XB 87Z 88C 8AL 8AO 8FD 8FE 8FG 8FI 8FJ 8FK 8FL ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FR3 FRNLG FYUFA F~G GHDGH GNUQQ HCIFZ JG9 JQ2 K60 K6~ K7- K9. L.- M0C M0N M0S M0T P5Z P62 PHGZM PHGZT PJZUB PKEHL PPXIY PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PYYUZ Q9U |
| DOI | 10.1007/s10951-020-00657-4 |
| DatabaseName | CrossRef ProQuest Central (Corporate) Materials Business File Mechanical & Transportation Engineering Abstracts ABI/INFORM Collection ABI/INFORM Global (PDF only) Health & Medical Collection ProQuest Central (purchase pre-March 2016) ABI/INFORM Collection Healthcare Administration Database (Alumni) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection Hospital Premium Collection Hospital Premium Collection (Alumni Edition) ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni) ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central Business Premium Collection ProQuest Technology Collection ProQuest One ProQuest Central Korea Engineering Research Database Business Premium Collection (Alumni) Proquest Health Research Premium Collection ABI/INFORM Global (Corporate) Health Research Premium Collection (Alumni) ProQuest Central Student SciTech Premium Collection Materials Research Database ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database ProQuest Health & Medical Complete (Alumni) ABI/INFORM Professional Advanced ABI/INFORM Global Computing Database ProQuest Health & Medical Collection Healthcare Administration Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) ProQuest Health & Medical Research Collection ProQuest One Academic Middle East (New) ProQuest One Health & Nursing ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ABI/INFORM Collection China ProQuest Central Basic |
| DatabaseTitle | CrossRef Materials Research Database ProQuest Business Collection (Alumni Edition) Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection SciTech Premium Collection ABI/INFORM Complete Materials Business File ProQuest One Applied & Life Sciences Health Research Premium Collection Health & Medical Research Collection ProQuest Central (New) Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global ProQuest One Academic Eastern Edition ProQuest Hospital Collection ProQuest Technology Collection Health Research Premium Collection (Alumni) ProQuest Business Collection ProQuest Hospital Collection (Alumni) ProQuest Health & Medical Complete ProQuest One Academic UKI Edition ProQuest Health Management (Alumni Edition) Engineering Research Database ProQuest One Academic ProQuest One Academic (New) ABI/INFORM Global (Corporate) ProQuest One Business Technology Collection Technology Research Database ProQuest One Academic Middle East (New) Mechanical & Transportation Engineering Abstracts ProQuest Health & Medical Complete (Alumni) ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest One Health & Nursing ProQuest Pharma Collection ProQuest Central ABI/INFORM Professional Advanced ProQuest Health & Medical Research Collection Health and Medicine Complete (Alumni Edition) ProQuest Central Korea ABI/INFORM Complete (Alumni Edition) ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest Health Management ABI/INFORM China ProQuest SciTech Collection Advanced Technologies & Aerospace Database ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni) |
| DatabaseTitleList | Materials Research Database |
| Database_xml | – sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1099-1425 |
| EndPage | 538 |
| ExternalDocumentID | 10_1007_s10951_020_00657_4 |
| GrantInformation_xml | – fundername: NSFC grantid: 71101064 |
| GroupedDBID | -57 -5G -BR -EM -Y2 -~C .4S .86 .DC .VR 06D 0R~ 0VY 1N0 1OC 203 29L 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 31~ 3V. 4.4 406 408 409 40D 40E 5GY 5VS 67Z 6NX 7WY 7X7 8-1 8AO 8FE 8FG 8FI 8FJ 8FL 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABIJN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACXQS ACZOJ ADBBV ADHHG ADHIR ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFBPY AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZJQ AFZKB AGAYW AGDGC AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHMBA AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJAOE AJBLW AJRNO AJZVZ ALIPV ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG AQUVI ARAPS ARCSS ARMRJ ASPBG AVWKF AXYYD AYQZM AZFZN AZQEC B-. BA0 BAPOH BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ BSONS BVXVI CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 DWQXO EBLON EBS EDO EHE EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC FYUFA GGCAI GGRSB GJIRD GNUQQ GNWQR GQ6 GQ7 GQ8 GROUPED_ABI_INFORM_COMPLETE GXS H13 HCIFZ HF~ HG5 HG6 HLICF HMCUK HMJXF HQYDN HRMNR HVGLF HZ~ I-F I09 IHE IJ- IKXTQ ITM IWAJR IXC IXE IZIGR IZQ I~X I~Z J-C J0Z J9A JBSCW JCJTX JZLTJ K60 K6V K6~ K7- KDC KOV LAK LAW LH4 LLZTM M0C M0N M0T M4Y MA- N2Q NB0 NPVJJ NQJWS NU0 O9- O93 O9G O9J OAM OVD P2P P62 P9M PF0 PQBIZ PQBZA PQQKQ PROAC PT4 Q2X QOS R89 R9I RNI ROL RPX RSV RZC RZD S16 S1Z S27 S3B SAP SBE SDH SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TEORI TSG TSK TSV TUC TUS U2A UG4 UKHRP UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 W99 WK8 XPP XV2 YLTOR Z45 Z7X Z83 Z88 ZMTXR ~A9 AAMMB AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEFGJ AEZWR AFDZB AFFHD AFHIU AFOHR AGQPQ AGXDD AHPBZ AHWEU AIDQK AIDYY AIXLP ALUQN AMVHM ATHPR AYFIA CITATION PHGZM PHGZT PJZUB PPXIY PQGLB 7TA 7TB 7XB 8AL 8FD 8FK FR3 JG9 JQ2 K9. L.- PKEHL PQEST PQUKI Q9U |
| ID | FETCH-LOGICAL-c376t-6e26445bc41f2b9e0ff313feda53542c5018f55a968b97f07809e506f98bcc583 |
| IEDL.DBID | RSV |
| ISICitedReferencesCount | 5 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000539535000001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1094-6136 |
| IngestDate | Wed Nov 05 00:53:07 EST 2025 Sat Nov 29 01:47:24 EST 2025 Tue Nov 18 22:42:16 EST 2025 Fri Feb 21 02:36:53 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5 |
| Keywords | Scheduling Performance analysis Batch processing Approximation algorithm Job rejection |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c376t-6e26445bc41f2b9e0ff313feda53542c5018f55a968b97f07809e506f98bcc583 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| PQID | 2845967341 |
| PQPubID | 43675 |
| PageCount | 14 |
| ParticipantIDs | proquest_journals_2845967341 crossref_primary_10_1007_s10951_020_00657_4 crossref_citationtrail_10_1007_s10951_020_00657_4 springer_journals_10_1007_s10951_020_00657_4 |
| PublicationCentury | 2000 |
| PublicationDate | 2020-10-01 |
| PublicationDateYYYYMMDD | 2020-10-01 |
| PublicationDate_xml | – month: 10 year: 2020 text: 2020-10-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Journal of scheduling |
| PublicationTitleAbbrev | J Sched |
| PublicationYear | 2020 |
| Publisher | Springer US Springer Nature B.V |
| Publisher_xml | – name: Springer US – name: Springer Nature B.V |
| References | Lee, Uzsoy, Martin-Vega (CR12) 1992; 40 Allahverdi, Ng, Cheng, Kovalyov (CR2) 2008; 187 Allahverdi, Gupta, Aldowaisan (CR1) 1999; 27 Shabtay (CR20) 2014; 233 Cheng, Liu, Yu (CR5) 2001; 33 Zhang, Lu, Yuan (CR24) 2009; 198 Kellerer, Pferschy, Pisinger (CR10) 2004 Lee, Uzsoy (CR11) 1999; 37 Lu, Cheng, Yuan, Zhang (CR15) 2009; 36 Ou, Zhong (CR17) 2017; 263 Zhang, Lu, Ng (CR25) 2012; 63 Croce, Koulamas, Vincent (CR6) 2017; 259 Shabtay, Gaspar, Kaspi (CR21) 2013; 16 Cao, Yang (CR4) 2009; 410 Havil (CR7) 2009 Liu, Yu (CR13) 2000; 105 Slotnick (CR22) 2011; 212 He, Leung, Lee, Pinedo (CR9) 2016; 14 Potts, Kovalyov (CR19) 2000; 120 Lu, Zhang, Yuan (CR16) 2010; 396 Ou, Li, Zhong (CR18) 2016; 116 He, Leung, Lee, Pinedo (CR8) 2016; 204 Brucker, Gladky, Hoogeveen, Kovalyov, Potts, van de Velde (CR3) 1998; 1 Liu, Yuan, Cheng (CR14) 2003; 31 Webster, Baker (CR23) 1995; 43 JW Ou (657_CR18) 2016; 116 C-Y Lee (657_CR11) 1999; 37 J Havil (657_CR7) 2009 ZH Liu (657_CR13) 2000; 105 LQ Zhang (657_CR24) 2009; 198 D Shabtay (657_CR21) 2013; 16 C-Y Lee (657_CR12) 1992; 40 TCE Cheng (657_CR5) 2001; 33 ZH Liu (657_CR14) 2003; 31 D Shabtay (657_CR20) 2014; 233 P Brucker (657_CR3) 1998; 1 C He (657_CR8) 2016; 204 H Kellerer (657_CR10) 2004 A Allahverdi (657_CR2) 2008; 187 LF Lu (657_CR16) 2010; 396 C He (657_CR9) 2016; 14 LF Lu (657_CR15) 2009; 36 JW Ou (657_CR17) 2017; 263 FD Croce (657_CR6) 2017; 259 Z Cao (657_CR4) 2009; 410 C Potts (657_CR19) 2000; 120 SA Slotnick (657_CR22) 2011; 212 S Webster (657_CR23) 1995; 43 A Allahverdi (657_CR1) 1999; 27 LQ Zhang (657_CR25) 2012; 63 |
| References_xml | – volume: 116 start-page: 503 year: 2016 end-page: 507 ident: CR18 article-title: Faster algorithms for single machine scheduling with release dates and rejection publication-title: Information Processing Letters doi: 10.1016/j.ipl.2016.02.008 – year: 2004 ident: CR10 publication-title: Knapsack problems doi: 10.1007/978-3-540-24777-7 – volume: 410 start-page: 2732 year: 2009 end-page: 2745 ident: CR4 article-title: A PTAS for parallel batch scheduling with rejection and dynamic job arrivals publication-title: Theoretical Computer Science doi: 10.1016/j.tcs.2009.04.006 – year: 2009 ident: CR7 publication-title: Gamma: Exploring Eulers Constant – volume: 37 start-page: 219 issue: 1 year: 1999 end-page: 236 ident: CR11 article-title: Minimizing makespan on a single batch processing machine with dynamic job arrivals publication-title: International Journal of Production Research doi: 10.1080/002075499192020 – volume: 396 start-page: 283 year: 2010 end-page: 289 ident: CR16 article-title: The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan publication-title: Theoretical Computer Science doi: 10.1016/j.tcs.2008.02.015 – volume: 27 start-page: 219 year: 1999 end-page: 239 ident: CR1 article-title: A review of scheduling research involving setup considerations publication-title: OMEGA doi: 10.1016/S0305-0483(98)00042-5 – volume: 233 start-page: 64 issue: 1 year: 2014 end-page: 74 ident: CR20 article-title: The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2013.08.013 – volume: 31 start-page: 42 year: 2003 end-page: 48 ident: CR14 article-title: On scheduling an unbounded parallel batch machine publication-title: Operations Research Letters doi: 10.1016/S0167-6377(02)00186-4 – volume: 204 start-page: 150 year: 2016 end-page: 163 ident: CR8 article-title: Scheduling a single machine with parallel batching to minimize makespan and total rejection cost publication-title: Discrete Applied Mathematics doi: 10.1016/j.dam.2015.10.021 – volume: 263 start-page: 904 issue: 3 year: 2017 end-page: 907 ident: CR17 article-title: Bicriteria order acceptance and scheduling with consideration of fill rate publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2017.04.036 – volume: 63 start-page: 293 issue: 3 year: 2012 end-page: 298 ident: CR25 article-title: The unbounded parallel-batch scheduling with rejection publication-title: Journal of the Operational Research Society doi: 10.1057/jors.2011.31 – volume: 120 start-page: 228 issue: 2 year: 2000 end-page: 249 ident: CR19 article-title: Scheduling with batching: A review publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(99)00153-8 – volume: 212 start-page: 1 issue: 1 year: 2011 end-page: 11 ident: CR22 article-title: Order acceptance and scheduling: A taxonomy and review publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2010.09.042 – volume: 43 start-page: 692 year: 1995 end-page: 703 ident: CR23 article-title: Scheduling groups of jobs on a single machine publication-title: Operations Research doi: 10.1287/opre.43.4.692 – volume: 33 start-page: 685 year: 2001 end-page: 690 ident: CR5 article-title: Scheduling jobs with release dates and deadlines on a batching processing machine publication-title: IIE Transactions doi: 10.1023/A:1010991401683 – volume: 187 start-page: 985 year: 2008 end-page: 1032 ident: CR2 article-title: A survey of scheduling problems with setup times or costs publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2006.06.060 – volume: 105 start-page: 129 year: 2000 end-page: 136 ident: CR13 article-title: Scheduling one batch processor subject to job release dates publication-title: Discrete Applied Mathematics doi: 10.1016/S0166-218X(00)00181-5 – volume: 1 start-page: 31 issue: 1 year: 1998 end-page: 54 ident: CR3 article-title: Scheduling a batching machine publication-title: Journal of Scheduling doi: 10.1002/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO;2-R – volume: 259 start-page: 898 issue: 3 year: 2017 end-page: 905 ident: CR6 article-title: A constraint generation approach for two-machine shop problems with jobs selection publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2016.11.036 – volume: 36 start-page: 2748 year: 2009 end-page: 2751 ident: CR15 article-title: Bounded single-machine parallel-batch scheduling with release dates and rejection publication-title: Computers and Operations Research doi: 10.1016/j.cor.2008.12.003 – volume: 16 start-page: 3 issue: 1 year: 2013 end-page: 28 ident: CR21 article-title: A survey on offline scheduling with rejection publication-title: Journal of Scheduling doi: 10.1007/s10951-012-0303-z – volume: 40 start-page: 764 issue: 4 year: 1992 end-page: 775 ident: CR12 article-title: Efficient algorithms for scheduling batch processing machines publication-title: Operations Research doi: 10.1287/opre.40.4.764 – volume: 198 start-page: 975 issue: 3 year: 2009 end-page: 978 ident: CR24 article-title: Single machine scheduling with release dates and rejection publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2008.10.006 – volume: 14 start-page: 41 year: 2016 end-page: 55 ident: CR9 article-title: Improved algorithms for single machine scheduling with release dates and rejections publication-title: 4OR doi: 10.1007/s10288-016-0303-5 – volume: 263 start-page: 904 issue: 3 year: 2017 ident: 657_CR17 publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2017.04.036 – volume: 212 start-page: 1 issue: 1 year: 2011 ident: 657_CR22 publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2010.09.042 – volume: 198 start-page: 975 issue: 3 year: 2009 ident: 657_CR24 publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2008.10.006 – volume: 120 start-page: 228 issue: 2 year: 2000 ident: 657_CR19 publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(99)00153-8 – volume: 105 start-page: 129 year: 2000 ident: 657_CR13 publication-title: Discrete Applied Mathematics doi: 10.1016/S0166-218X(00)00181-5 – volume: 33 start-page: 685 year: 2001 ident: 657_CR5 publication-title: IIE Transactions doi: 10.1023/A:1010991401683 – volume: 16 start-page: 3 issue: 1 year: 2013 ident: 657_CR21 publication-title: Journal of Scheduling doi: 10.1007/s10951-012-0303-z – volume-title: Gamma: Exploring Eulers Constant year: 2009 ident: 657_CR7 – volume: 40 start-page: 764 issue: 4 year: 1992 ident: 657_CR12 publication-title: Operations Research doi: 10.1287/opre.40.4.764 – volume: 233 start-page: 64 issue: 1 year: 2014 ident: 657_CR20 publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2013.08.013 – volume: 43 start-page: 692 year: 1995 ident: 657_CR23 publication-title: Operations Research doi: 10.1287/opre.43.4.692 – volume-title: Knapsack problems year: 2004 ident: 657_CR10 doi: 10.1007/978-3-540-24777-7 – volume: 396 start-page: 283 year: 2010 ident: 657_CR16 publication-title: Theoretical Computer Science doi: 10.1016/j.tcs.2008.02.015 – volume: 27 start-page: 219 year: 1999 ident: 657_CR1 publication-title: OMEGA doi: 10.1016/S0305-0483(98)00042-5 – volume: 116 start-page: 503 year: 2016 ident: 657_CR18 publication-title: Information Processing Letters doi: 10.1016/j.ipl.2016.02.008 – volume: 36 start-page: 2748 year: 2009 ident: 657_CR15 publication-title: Computers and Operations Research doi: 10.1016/j.cor.2008.12.003 – volume: 410 start-page: 2732 year: 2009 ident: 657_CR4 publication-title: Theoretical Computer Science doi: 10.1016/j.tcs.2009.04.006 – volume: 31 start-page: 42 year: 2003 ident: 657_CR14 publication-title: Operations Research Letters doi: 10.1016/S0167-6377(02)00186-4 – volume: 204 start-page: 150 year: 2016 ident: 657_CR8 publication-title: Discrete Applied Mathematics doi: 10.1016/j.dam.2015.10.021 – volume: 37 start-page: 219 issue: 1 year: 1999 ident: 657_CR11 publication-title: International Journal of Production Research doi: 10.1080/002075499192020 – volume: 14 start-page: 41 year: 2016 ident: 657_CR9 publication-title: 4OR doi: 10.1007/s10288-016-0303-5 – volume: 187 start-page: 985 year: 2008 ident: 657_CR2 publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2006.06.060 – volume: 259 start-page: 898 issue: 3 year: 2017 ident: 657_CR6 publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2016.11.036 – volume: 63 start-page: 293 issue: 3 year: 2012 ident: 657_CR25 publication-title: Journal of the Operational Research Society doi: 10.1057/jors.2011.31 – volume: 1 start-page: 31 issue: 1 year: 1998 ident: 657_CR3 publication-title: Journal of Scheduling doi: 10.1002/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO;2-R |
| SSID | ssj0008721 |
| Score | 2.2697184 |
| Snippet | In this paper we study a single batch-processing machine scheduling model. In our model, a set of jobs having different release dates needs to be scheduled... |
| SourceID | proquest crossref springer |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 525 |
| SubjectTerms | Algorithms Approximation Artificial Intelligence Batch processing Business and Management Calculus of Variations and Optimal Control; Optimization Decision making Mathematical analysis Operations Research/Decision Theory Optimization Rejection Release dates Scheduling Supply Chain Management |
| SummonAdditionalLinks | – databaseName: ABI/INFORM Global dbid: M0C link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT9wwEB61gKr2wGNL1eUlH7iB1SSOk_hUVQjEhVUPIHGLbMfmIcgum1D153fGSVioBBdOkZLYiTTjb76x5wGwL7XQUmjBhY89T32acpMbyW3lpU5lJYrchmYT-WRSXF6q3_2GW9OHVQ6YGIC6mlraI_-BMCpVliPo_pw9cOoaRaerfQuNj7BMzIZC-s6ioyckLvIu7wpdGHSR6Jhy61nqHDWYJ-eJrHDO05eGacE2_zsgDXbnZO29f7wOqz3jZL86FdmAD64ewach4H0Ea0NjB9av8xF8eVal8Cs8THA1cKKjeKFe9CwUIv9702U9Mn13hZ9tr-8bhgyYobuM5ouy3JlmBpH-ms-6bAS6dR-CNx2j_V_WuPZx1jBdV-x2atjc3YbAsHoTLk6Oz49Oed-pgVsEqJZnjniVNDaNfWKUi7wXsfCuQj2QaWKpaqCXUqusMCr3SEsi5WSUeVUYa2UhvsFSPa3dd2BWeZclOsahyDwKqwsndRUZlbgc4UKMIR7EVNq-jDl107grFwWYSbQlirYMoi3TMRw8jZl1RTzefHtnkGfZL-imXAhzDIeDRiwevz7b1tuzbcPnhJQwhAfuwFI7f3S7sGL_tDfNfC-o8z98dPsf priority: 102 providerName: ProQuest |
| Title | Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection |
| URI | https://link.springer.com/article/10.1007/s10951-020-00657-4 https://www.proquest.com/docview/2845967341 |
| Volume | 23 |
| WOSCitedRecordID | wos000539535000001&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: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1099-1425 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0008721 issn: 1094-6136 databaseCode: RSV dateStart: 20030101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3db9MwED-xDSF4YFBAdIzKD7yBpSSOY_sRpk1IiKoaAwovke3YrNOWliZD_PmcnWQdSEOCl4uS2Fbks-93F98HwAuumeZMM8p86mnu85waYTi1lec65xWTwsZiE2I6lfO5mvVBYc3g7T4cSUZJfS3YLZSED-ZOwE1B8y3YQbiToWDD8YdPV_JXii7aCg0XNIzC4eTezWP8DkcbHfOPY9GINke7__edD-B-r12S191yeAi3XD2CO4Nz-wh2hyIOpN_TI7h3LSPhI_g-xZVPg-qJl1B3nsSk4z8XXYQj0efflutFe3rRENR2CZrGCFUhop1oYlCqn9JVF3kQHl1ER01Hwr9e0rj2ctUQXVfkbGnI2p1FJ7D6MXw8Ojw5eEv7qgzUojBqaeGCDsWNzVOfGeUS71nKvKuQ5zzPbMgQ6DnXqpBGCY8qSKIcTwqvpLGWS_YEtutl7Z4Cscq7ItMpdkUtQ1otHddVYlTmBIoGNoZ0YE5p-5TloXLGeblJthwmu8TJLuNkl_kYXl71WXUJO_7aen_gedlv3qZExOaqEIjvY3g18Hjz-ubR9v6t-TO4m4VlEl0D92G7XV-653Db_mgXzXoCW-Lzl0DnYgI7bw6ns2O8eyco0vfJQaQnSGf86yRugF8AEPhM |
| linkProvider | Springer Nature |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB6VgqA9UFhA3VLABziB1U1sJ_GhQgioWm1ZcShSb8F27Harbna7SXn8qf7Gjp2kW5DorQdOkZLYip1vvhnb8wB4LRRTgilGmYsc5Y5zqlMtqCmcUFwULEtNKDaRjkbZ4aH8ugQXXSyMd6vsODEQdTE1fo98C2lUyCRF0n0_O6O-apQ_Xe1KaDSwGNrfP3HJVm3vfcL_-yaOdz4ffNylbVUBalCYappYbwMIbXjkYi3twDkWMWcL_GbBY-Mz3DkhlEwyLVOHKnQgrRgkTmbaGJEx7PcO3OU4Ci9Xw5ReMX-WNnFeuGTCJZk_Ft24FqrnC9r7xZrX-inlfyrChXX714Fs0HM7a__bDD2Ch61FTT40IvAYlmzZg_udQ38P1rrCFaTlsR6sXsvC-ATORvjR1JvbeKnHE0tCovVf4yaqk6jTIxxmfTypCFr4pEKYF95__4goolGTHdNZE23hb02Cc6olfn-bVLY-n1VElQU5mWoytyfB8a18Ct9uZUaewXI5Le06ECOdTWIVYVO0rDKjMitUMdAytinSIetD1MEiN22adl8t5DRfJJj2UMoRSnmAUs778PaqzaxJUnLj25sdfvKWsKp8AZ4-vOsQuHj87942bu7tFTzYPfiyn-_vjYbPYSX2AhBcITdhuZ6f2xdwz_yox9X8ZRAlAt9vG5mXTe9W5g |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB6Vgio4tLAUsaWAD3ACq5s4juMDqhBlRVW02gNIFZdgO3a7VTe73aQ8_lp_XcdO0i1I9NYDp0hJbDnO53nY38wAvOKKKc4Uo8xFjiYuSagWmlNTOK4SXrBMmFBsQoxG2eGhHK_ARRcL42mVnUwMgrqYGb9HvoNilMtUoNDdcS0tYrw33J2fUV9Byp-0duU0Gogc2N8_0X2r3u3v4b9-HcfDj18-fKJthQFqcGHVNLXeHuDaJJGLtbQD51jEnC1w_DyJjc925zhXMs20FA7V6UBaPkidzLQxPGPY7x24K9DH9HTCMf92pQUy0cR8ofuE7pk_It26Frbni9t7x81bAIImfyrFpaX71-Fs0HnDjf95th7Cemtpk_fN0ngEK7bswVpH9O_BRlfQgrTyrQcPrmVnfAxnIxw09WY4XurJ1JKQgP3XpIn2JOr0CD-zPp5WBC1_UiH8C8_rPyKKaNRwx3TeRGH4W9NAWrXE73uTytbn84qosiAnM00W9iQQ4spN-HorM_IEVstZaZ8CMdLZNFYRNkWLKzMqs1wVAy1jK1BMsj5EHURy06Zv91VETvNl4mkPqxxhlQdY5Ukf3ly1mTfJS258e7vDUt4KsipfAqkPbzs0Lh__u7etm3t7CWsIyPzz_ujgGdyP_VoIDMltWK0X5_Y53DM_6km1eBFWFYHvtw3MS_k0YAo |
| 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=Near-linear-time+approximation+algorithms+for+scheduling+a+batch-processing+machine+with+setups+and+job+rejection&rft.jtitle=Journal+of+scheduling&rft.au=Ou%2C+Jinwen&rft.date=2020-10-01&rft.pub=Springer+US&rft.issn=1094-6136&rft.eissn=1099-1425&rft.volume=23&rft.issue=5&rft.spage=525&rft.epage=538&rft_id=info:doi/10.1007%2Fs10951-020-00657-4&rft.externalDocID=10_1007_s10951_020_00657_4 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1094-6136&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1094-6136&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1094-6136&client=summon |