Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions
•Propose an online batch scheduling problem with periodic pulse interruptions.•Analyze the lower bounds on competitive ratios for the online problem.•Design the best possible online algorithms using a waiting strategy.•Prove the competitive ratios of the online algorithms. We consider an online sche...
Uloženo v:
| Vydáno v: | European journal of operational research Ročník 309; číslo 1; s. 53 - 64 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
16.08.2023
|
| Témata: | |
| ISSN: | 0377-2217, 1872-6860 |
| 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 | •Propose an online batch scheduling problem with periodic pulse interruptions.•Analyze the lower bounds on competitive ratios for the online problem.•Design the best possible online algorithms using a waiting strategy.•Prove the competitive ratios of the online algorithms.
We consider an online scheduling problem on identical batch machines to minimize the makespan with periodic pulse interruptions. Periodic pulse interruptions are machine unavailable intervals with negligible length and divide the scheduling horizon into available intervals. Jobs are released online over time and processed simultaneously as batches with the same processing times on identical batch machines. Every batch must be entirely processed in an available interval without any preemption. For unbounded machine capacity, we design best possible online algorithms with the competitive ratios of 1+η and 2m for a single machine (m=1) and m identical parallel machines (m≥2), respectively, where η≈0.8019 is the positive root of η3+2η2−η=1. For bounded machine capacity, we derive a best possible online algorithm with a competitive ratio of 1+η. |
|---|---|
| AbstractList | •Propose an online batch scheduling problem with periodic pulse interruptions.•Analyze the lower bounds on competitive ratios for the online problem.•Design the best possible online algorithms using a waiting strategy.•Prove the competitive ratios of the online algorithms.
We consider an online scheduling problem on identical batch machines to minimize the makespan with periodic pulse interruptions. Periodic pulse interruptions are machine unavailable intervals with negligible length and divide the scheduling horizon into available intervals. Jobs are released online over time and processed simultaneously as batches with the same processing times on identical batch machines. Every batch must be entirely processed in an available interval without any preemption. For unbounded machine capacity, we design best possible online algorithms with the competitive ratios of 1+η and 2m for a single machine (m=1) and m identical parallel machines (m≥2), respectively, where η≈0.8019 is the positive root of η3+2η2−η=1. For bounded machine capacity, we derive a best possible online algorithm with a competitive ratio of 1+η. |
| Author | Lin, Ran Liu, Zhixin Wang, Jun-Qiang Xu, Jun |
| Author_xml | – sequence: 1 givenname: Ran surname: Lin fullname: Lin, Ran organization: Performance Analysis Center of Production and Operations Systems (PacPos), Northwestern Polytechnical University, Xi’an, Shaanxi 710072, PR China – sequence: 2 givenname: Jun-Qiang orcidid: 0000-0001-5244-6483 surname: Wang fullname: Wang, Jun-Qiang email: wangjq@nwpu.edu.cn organization: Performance Analysis Center of Production and Operations Systems (PacPos), Northwestern Polytechnical University, Xi’an, Shaanxi 710072, PR China – sequence: 3 givenname: Zhixin orcidid: 0000-0001-6146-8932 surname: Liu fullname: Liu, Zhixin organization: Department of Management Studies, College of Business, University of Michigan-Dearborn, 19000 Hubbard Drive, Dearborn, MI 48126-2638, USA – sequence: 4 givenname: Jun surname: Xu fullname: Xu, Jun organization: Performance Analysis Center of Production and Operations Systems (PacPos), Northwestern Polytechnical University, Xi’an, Shaanxi 710072, PR China |
| BookMark | eNp9kMtOwzAQRS1UJNrCD7DyDyT4kcRZsIGKl1SJTfeWY48bR2kc2S6Iv8dVWbHoakajOaM5d4UWk58AoXtKSkpo8zCUMPhQMsJ4SWhJmLhCS9oKVjRtQxZoSbgQBWNU3KBVjAMhhNa0XqLxGWLCs4_RdSNgNe59cKk_RGx9wH4a3QQ46h7MMbf7PMHOwJScViPuVNI9Pijd562IvzOIZwjOG6fxfBwjYDclCOE4J-eneIuurcrTu7-6RrvXl93mvdh-vn1snraF5pynwja8qjmrbEcNAW4NCN0YwSrQUINV2ZhWlhqrwLIWBM_WYERtrOi0UHyN2vNZHbJXACu1S-r0QQrKjZISeQpNDvIUmjyFJgmVObSMsn_oHNxBhZ_L0OMZguz05SDIqB1MGowLoJM03l3CfwHFuoyE |
| CitedBy_id | crossref_primary_10_1016_j_dam_2025_03_008 crossref_primary_10_1016_j_orl_2024_107159 crossref_primary_10_1002_nav_22221 crossref_primary_10_1002_nav_22263 crossref_primary_10_1007_s40305_025_00604_0 crossref_primary_10_1016_j_ejor_2024_01_009 crossref_primary_10_1016_j_ejor_2025_07_012 crossref_primary_10_1007_s00291_024_00770_2 |
| Cites_doi | 10.1287/opre.40.4.764 10.1016/j.ijpe.2014.03.004 10.1016/j.ejor.2021.06.012 10.1016/j.ipl.2011.06.008 10.1080/00207543.2020.1764125 10.1016/j.omega.2021.102567 10.1016/j.cie.2009.04.014 10.1016/j.ejor.2016.10.024 10.1007/s10951-009-0154-4 10.1016/S0377-2217(99)00153-8 10.1016/j.ipl.2009.08.008 10.1007/s10951-010-0222-9 10.1016/j.ejor.2022.03.027 10.1080/24725854.2018.1519745 10.1080/00207543.2020.1820095 10.1007/s10878-014-9706-4 10.1016/j.omega.2022.102804 10.1016/S0167-5060(08)70356-X 10.1016/j.ejor.2022.09.032 10.1016/j.ijpe.2014.06.019 10.1080/01605682.2019.1578626 10.1016/j.cie.2018.01.027 10.1007/s10951-019-00623-9 10.1016/j.omega.2016.07.006 10.1007/s10878-015-9924-4 10.1016/j.ejor.2014.12.012 10.1002/nav.5 10.1007/s10878-022-00845-2 10.1080/07408170304378 10.1016/j.ejor.2007.02.051 10.1016/j.ejor.2018.04.019 |
| ContentType | Journal Article |
| Copyright | 2023 Elsevier B.V. |
| Copyright_xml | – notice: 2023 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.ejor.2023.01.027 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1872-6860 |
| EndPage | 64 |
| ExternalDocumentID | 10_1016_j_ejor_2023_01_027 S0377221723000462 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AARIN AAXUO AAYFN ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABYKQ ACAZW ACDAQ ACGFO ACGFS ACIWK ACNCT ACRLP ACZNC ADBBV ADEZE ADGUI AEBSH AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR AXJTR BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 ROL RPZ RXW SCC SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U XPP ZMT ~02 ~G- 1OL 29G 41~ 9DU AAAKG AAQXK AATTM AAXKI AAYWO AAYXX ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADIYS ADJOM ADMUD ADNMO ADXHL AEIPS AEUPX AFFNX AFJKZ AFPUW AGQPQ AI. AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS EJD FEDTE FGOYB HVGLF HZ~ R2- VH1 WUQ ~HD |
| ID | FETCH-LOGICAL-c333t-f6345324fb1d0e3fde7c6d724ece5efa10114f1dfaef28e73023ed75df7bc7a3 |
| ISICitedReferencesCount | 8 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000968901900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0377-2217 |
| IngestDate | Sat Nov 29 07:22:21 EST 2025 Tue Nov 18 21:51:48 EST 2025 Fri Feb 23 02:37:22 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | Periodic pulse interruption Scheduling Online algorithm Competitive ratio Identical batch machines |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c333t-f6345324fb1d0e3fde7c6d724ece5efa10114f1dfaef28e73023ed75df7bc7a3 |
| ORCID | 0000-0001-5244-6483 0000-0001-6146-8932 |
| PageCount | 12 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_ejor_2023_01_027 crossref_primary_10_1016_j_ejor_2023_01_027 elsevier_sciencedirect_doi_10_1016_j_ejor_2023_01_027 |
| PublicationCentury | 2000 |
| PublicationDate | 2023-08-16 |
| PublicationDateYYYYMMDD | 2023-08-16 |
| PublicationDate_xml | – month: 08 year: 2023 text: 2023-08-16 day: 16 |
| PublicationDecade | 2020 |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2023 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Wang, Leung (bib0025) 2014; 156 Huo, Zhao (bib0006) 2015; 243 Lin, Li, Chai (bib0010) 2021; 72 Yuan, Qi, Lu, Li (bib0031) 2008; 186 Yin, Wang, Cheng, Liu, Li (bib0030) 2017; 69 Liu, Lu (bib0013) 2015; 29 Kacem, Kellerer, Seifaddini (bib0007) 2016; 32 Zhang, Cai, Wong (bib0032) 2001; 48 Mor, Shapira (bib0018) 2022; 44 Pruhs, Sgall, Torng (bib0021) 2004 Xu, Wang, Liu (bib0028) 2022; 108 Wang, Yan, Cui, Yan (bib0026) 2019; 51 Fan, Ng, Cheng, Shi (bib0003) 2020 Potts, Kovalyov (bib0020) 2000; 120 Fowler, Mönch (bib0004) 2022; 298 Li, Yuan (bib0009) 2011; 111 Mönch, Fowler, Dauzère-Pérès, Mason, Rose (bib0016) 2011; 14 Cheng, Ying, Chen, Lin (bib0001) 2018; 117 Yang, Davari, Wei, Hermans, Leus (bib0029) 2022; 303 Ma, Chu, Zuo (bib0015) 2010; 58 Wu, Hayashi, Haruyasu, Tang (bib0027) 2022; 307 Lin, Wang, Oulamara (bib0011) 2023; 116 Mosheiov, Sarig, Strusevich, Mosheiff (bib0019) 2018; 271 Graham, Lawler, Lenstra, Kan (bib0005) 1979; 5 Mor, Mosheiov (bib0017) 2014; 153 Tian, Cheng, Ng, Yuan (bib0022) 2009; 109 Fan, Wang, Liu (bib0002) 2023; 61 Zhang, Cai, Wong (bib0033) 2003; 35 Lin, Ying (bib0012) 2021; 59 Liu, Lu, Fang (bib0014) 2012; 15 Lee, Uzsoy, Martin-Vega (bib0008) 1992; 40 Wang, Fan, Liu (bib0023) 2020; 23 Wang, Fan, Zhang, Zhang, Leung (bib0024) 2017; 258 Lee (10.1016/j.ejor.2023.01.027_bib0008) 1992; 40 Liu (10.1016/j.ejor.2023.01.027_bib0013) 2015; 29 Graham (10.1016/j.ejor.2023.01.027_bib0005) 1979; 5 Mor (10.1016/j.ejor.2023.01.027_bib0017) 2014; 153 Potts (10.1016/j.ejor.2023.01.027_bib0020) 2000; 120 Li (10.1016/j.ejor.2023.01.027_bib0009) 2011; 111 Tian (10.1016/j.ejor.2023.01.027_bib0022) 2009; 109 Wang (10.1016/j.ejor.2023.01.027_bib0025) 2014; 156 Lin (10.1016/j.ejor.2023.01.027_bib0012) 2021; 59 Pruhs (10.1016/j.ejor.2023.01.027_bib0021) 2004 Mor (10.1016/j.ejor.2023.01.027_bib0018) 2022; 44 Wang (10.1016/j.ejor.2023.01.027_bib0023) 2020; 23 Wang (10.1016/j.ejor.2023.01.027_bib0026) 2019; 51 Mönch (10.1016/j.ejor.2023.01.027_bib0016) 2011; 14 Yin (10.1016/j.ejor.2023.01.027_bib0030) 2017; 69 Kacem (10.1016/j.ejor.2023.01.027_bib0007) 2016; 32 Cheng (10.1016/j.ejor.2023.01.027_bib0001) 2018; 117 Ma (10.1016/j.ejor.2023.01.027_bib0015) 2010; 58 Wang (10.1016/j.ejor.2023.01.027_bib0024) 2017; 258 Fowler (10.1016/j.ejor.2023.01.027_bib0004) 2022; 298 Xu (10.1016/j.ejor.2023.01.027_bib0028) 2022; 108 Yuan (10.1016/j.ejor.2023.01.027_bib0031) 2008; 186 Fan (10.1016/j.ejor.2023.01.027_bib0003) 2020 Yang (10.1016/j.ejor.2023.01.027_sbref0029) 2022; 303 Zhang (10.1016/j.ejor.2023.01.027_bib0033) 2003; 35 Lin (10.1016/j.ejor.2023.01.027_bib0011) 2023; 116 Fan (10.1016/j.ejor.2023.01.027_bib0002) 2023; 61 Zhang (10.1016/j.ejor.2023.01.027_bib0032) 2001; 48 Lin (10.1016/j.ejor.2023.01.027_bib0010) 2021; 72 Mosheiov (10.1016/j.ejor.2023.01.027_bib0019) 2018; 271 Wu (10.1016/j.ejor.2023.01.027_sbref0027) 2022; 307 Huo (10.1016/j.ejor.2023.01.027_bib0006) 2015; 243 Liu (10.1016/j.ejor.2023.01.027_bib0014) 2012; 15 |
| References_xml | – volume: 44 start-page: 480 year: 2022 end-page: 497 ident: bib0018 article-title: Single machine scheduling with non-availability interval and optional job rejection publication-title: Journal of Combinatorial Optimization – volume: 72 start-page: 1754 year: 2021 end-page: 1761 ident: bib0010 article-title: On-line scheduling with equal-length jobs on parallel-batch machines to minimise maximum flow-time with delivery times publication-title: Journal of the Operational Research Society – volume: 15 start-page: 77 year: 2012 end-page: 81 ident: bib0014 article-title: A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines publication-title: Journal of Scheduling – volume: 5 start-page: 287 year: 1979 end-page: 326. ident: bib0005 article-title: Optimization and approximation in deterministic sequencing and scheduling: A survey publication-title: Annals of Discrete Mathematics – volume: 29 start-page: 228 year: 2015 end-page: 236 ident: bib0013 article-title: Online unbounded batch scheduling on parallel machines with delivery times publication-title: Journal of Combinatorial Optimization – volume: 116 start-page: 102804 year: 2023 ident: bib0011 article-title: Online scheduling on parallel-batch machines with periodic availability constraints and job delivery publication-title: Omega – volume: 156 start-page: 325 year: 2014 end-page: 331 ident: bib0025 article-title: Scheduling jobs with equal-processing-time on parallel machines with non-identical capacities to minimize makespan publication-title: International Journal of Production Economics – volume: 307 start-page: 82 year: 2022 end-page: 102 ident: bib0027 article-title: Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems publication-title: European Journal of Operational Research – volume: 298 start-page: 1 year: 2022 end-page: 24 ident: bib0004 article-title: A survey of scheduling with parallel batch ( publication-title: European Journal of Operational Research – volume: 23 start-page: 487 year: 2020 end-page: 496 ident: bib0023 article-title: Mixed batch scheduling on identical machines publication-title: Journal of Scheduling – volume: 303 start-page: 602 year: 2022 end-page: 615 ident: bib0029 article-title: Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families publication-title: European Journal of Operational Research – volume: 48 start-page: 241 year: 2001 end-page: 258 ident: bib0032 article-title: On-line algorithms for minimizing makespan on batch processing machines publication-title: Naval Research Logistics – volume: 117 start-page: 164 year: 2018 end-page: 170 ident: bib0001 article-title: Optimization algorithms for proportionate flowshop scheduling problems with variable maintenance activities publication-title: Computers and Industrial Engineering – volume: 111 start-page: 907 year: 2011 end-page: 911 ident: bib0009 article-title: Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time publication-title: Information Processing Letters – volume: 243 start-page: 547 year: 2015 end-page: 554 ident: bib0006 article-title: Total completion time minimization on multiple machines subject to machine availability and makespan constraints publication-title: European Journal of Operational Research – year: 2004 ident: bib0021 article-title: Online scheduling publication-title: Handbook of scheduling-algorithms, models, and performance analysis – volume: 58 start-page: 199 year: 2010 end-page: 211 ident: bib0015 article-title: A survey of scheduling with deterministic machine availability constraints publication-title: Computers and Industrial Engineering – start-page: 525 year: 2020 end-page: 536 ident: bib0003 article-title: Single bounded parallel-batch machine scheduling with an unavailability constraint and job delivery publication-title: International conference on algorithmic applications in management – volume: 120 start-page: 228 year: 2000 end-page: 249 ident: bib0020 article-title: Scheduling with batching: A review publication-title: European Journal of Operational Research – volume: 14 start-page: 583 year: 2011 end-page: 599 ident: bib0016 article-title: A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations publication-title: Journal of Scheduling – volume: 61 start-page: 238 year: 2023 end-page: 257 ident: bib0002 article-title: Two-agent scheduling on mixed batch machines to minimise the total weighted makespan publication-title: International Journal of Production Research – volume: 69 start-page: 17 year: 2017 end-page: 28 ident: bib0030 article-title: Parallel-machine scheduling of deteriorating jobs with potential machine disruptions publication-title: Omega – volume: 32 start-page: 970 year: 2016 end-page: 981 ident: bib0007 article-title: Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval publication-title: Journal of Combinatorial Optimization – volume: 153 start-page: 238 year: 2014 end-page: 242 ident: bib0017 article-title: Batch scheduling with a rate-modifying maintenance activity to minimize total flowtime publication-title: International Journal of Production Economics – volume: 186 start-page: 1212 year: 2008 end-page: 1217 ident: bib0031 article-title: Single machine unbounded parallel-batch scheduling with forbidden intervals publication-title: European Journal of Operational Research – volume: 109 start-page: 1211 year: 2009 end-page: 1215 ident: bib0022 article-title: Online scheduling on unbounded parallel-batch machines to minimize the makespan publication-title: Information Processing Letters – volume: 258 start-page: 478 year: 2017 end-page: 490 ident: bib0024 article-title: Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes publication-title: European Journal of Operational Research – volume: 40 start-page: 764 year: 1992 end-page: 775 ident: bib0008 article-title: Efficient algorithms for scheduling semiconductor burn-in operations publication-title: Operations Research – volume: 35 start-page: 175 year: 2003 end-page: 181 ident: bib0033 article-title: Optimal on-line algorithms for scheduling on parallel batch processing machines publication-title: IIE Transactions – volume: 59 start-page: 4403 year: 2021 end-page: 4415 ident: bib0012 article-title: Minimising makespan in job-shops with deterministic machine availability constraints publication-title: International Journal of Production Research – volume: 271 start-page: 388 year: 2018 end-page: 400 ident: bib0019 article-title: Two-machine flow shop and open shop scheduling problems with a single maintenance window publication-title: European Journal of Operational Research – volume: 108 start-page: 102567 year: 2022 ident: bib0028 article-title: Parallel batch scheduling: Impact of increasing machine capacity publication-title: Omega – volume: 51 start-page: 729 year: 2019 end-page: 743 ident: bib0026 article-title: Bernoulli serial lines with batching machines: Performance analysis and system-theoretic properties publication-title: IISE Transactions – volume: 40 start-page: 764 issue: 4 year: 1992 ident: 10.1016/j.ejor.2023.01.027_bib0008 article-title: Efficient algorithms for scheduling semiconductor burn-in operations publication-title: Operations Research doi: 10.1287/opre.40.4.764 – year: 2004 ident: 10.1016/j.ejor.2023.01.027_bib0021 article-title: Online scheduling – volume: 153 start-page: 238 year: 2014 ident: 10.1016/j.ejor.2023.01.027_bib0017 article-title: Batch scheduling with a rate-modifying maintenance activity to minimize total flowtime publication-title: International Journal of Production Economics doi: 10.1016/j.ijpe.2014.03.004 – volume: 298 start-page: 1 issue: 1 year: 2022 ident: 10.1016/j.ejor.2023.01.027_bib0004 article-title: A survey of scheduling with parallel batch (p-batch) processing publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2021.06.012 – volume: 111 start-page: 907 issue: 18 year: 2011 ident: 10.1016/j.ejor.2023.01.027_bib0009 article-title: Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time publication-title: Information Processing Letters doi: 10.1016/j.ipl.2011.06.008 – volume: 59 start-page: 4403 issue: 14 year: 2021 ident: 10.1016/j.ejor.2023.01.027_bib0012 article-title: Minimising makespan in job-shops with deterministic machine availability constraints publication-title: International Journal of Production Research doi: 10.1080/00207543.2020.1764125 – volume: 108 start-page: 102567 year: 2022 ident: 10.1016/j.ejor.2023.01.027_bib0028 article-title: Parallel batch scheduling: Impact of increasing machine capacity publication-title: Omega doi: 10.1016/j.omega.2021.102567 – volume: 58 start-page: 199 issue: 2 year: 2010 ident: 10.1016/j.ejor.2023.01.027_bib0015 article-title: A survey of scheduling with deterministic machine availability constraints publication-title: Computers and Industrial Engineering doi: 10.1016/j.cie.2009.04.014 – volume: 258 start-page: 478 issue: 2 year: 2017 ident: 10.1016/j.ejor.2023.01.027_bib0024 article-title: Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2016.10.024 – volume: 15 start-page: 77 issue: 1 year: 2012 ident: 10.1016/j.ejor.2023.01.027_bib0014 article-title: A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines publication-title: Journal of Scheduling doi: 10.1007/s10951-009-0154-4 – volume: 120 start-page: 228 issue: 2 year: 2000 ident: 10.1016/j.ejor.2023.01.027_bib0020 article-title: Scheduling with batching: A review publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(99)00153-8 – volume: 109 start-page: 1211 issue: 21–22 year: 2009 ident: 10.1016/j.ejor.2023.01.027_bib0022 article-title: Online scheduling on unbounded parallel-batch machines to minimize the makespan publication-title: Information Processing Letters doi: 10.1016/j.ipl.2009.08.008 – volume: 14 start-page: 583 issue: 6 year: 2011 ident: 10.1016/j.ejor.2023.01.027_bib0016 article-title: A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations publication-title: Journal of Scheduling doi: 10.1007/s10951-010-0222-9 – volume: 303 start-page: 602 issue: 2 year: 2022 ident: 10.1016/j.ejor.2023.01.027_sbref0029 article-title: Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2022.03.027 – volume: 51 start-page: 729 issue: 7 year: 2019 ident: 10.1016/j.ejor.2023.01.027_bib0026 article-title: Bernoulli serial lines with batching machines: Performance analysis and system-theoretic properties publication-title: IISE Transactions doi: 10.1080/24725854.2018.1519745 – volume: 61 start-page: 238 issue: 1 year: 2023 ident: 10.1016/j.ejor.2023.01.027_bib0002 article-title: Two-agent scheduling on mixed batch machines to minimise the total weighted makespan publication-title: International Journal of Production Research doi: 10.1080/00207543.2020.1820095 – volume: 29 start-page: 228 issue: 1 year: 2015 ident: 10.1016/j.ejor.2023.01.027_bib0013 article-title: Online unbounded batch scheduling on parallel machines with delivery times publication-title: Journal of Combinatorial Optimization doi: 10.1007/s10878-014-9706-4 – volume: 116 start-page: 102804 year: 2023 ident: 10.1016/j.ejor.2023.01.027_bib0011 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: 5 start-page: 287 year: 1979 ident: 10.1016/j.ejor.2023.01.027_bib0005 article-title: Optimization and approximation in deterministic sequencing and scheduling: A survey publication-title: Annals of Discrete Mathematics doi: 10.1016/S0167-5060(08)70356-X – volume: 307 start-page: 82 issue: 1 year: 2022 ident: 10.1016/j.ejor.2023.01.027_sbref0027 article-title: Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2022.09.032 – volume: 156 start-page: 325 year: 2014 ident: 10.1016/j.ejor.2023.01.027_bib0025 article-title: Scheduling jobs with equal-processing-time on parallel machines with non-identical capacities to minimize makespan publication-title: International Journal of Production Economics doi: 10.1016/j.ijpe.2014.06.019 – volume: 72 start-page: 1754 issue: 8 year: 2021 ident: 10.1016/j.ejor.2023.01.027_bib0010 article-title: On-line scheduling with equal-length jobs on parallel-batch machines to minimise maximum flow-time with delivery times publication-title: Journal of the Operational Research Society doi: 10.1080/01605682.2019.1578626 – volume: 117 start-page: 164 year: 2018 ident: 10.1016/j.ejor.2023.01.027_bib0001 article-title: Optimization algorithms for proportionate flowshop scheduling problems with variable maintenance activities publication-title: Computers and Industrial Engineering doi: 10.1016/j.cie.2018.01.027 – volume: 23 start-page: 487 issue: 4 year: 2020 ident: 10.1016/j.ejor.2023.01.027_bib0023 article-title: Mixed batch scheduling on identical machines publication-title: Journal of Scheduling doi: 10.1007/s10951-019-00623-9 – volume: 69 start-page: 17 year: 2017 ident: 10.1016/j.ejor.2023.01.027_bib0030 article-title: Parallel-machine scheduling of deteriorating jobs with potential machine disruptions publication-title: Omega doi: 10.1016/j.omega.2016.07.006 – volume: 32 start-page: 970 issue: 3 year: 2016 ident: 10.1016/j.ejor.2023.01.027_bib0007 article-title: Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval publication-title: Journal of Combinatorial Optimization doi: 10.1007/s10878-015-9924-4 – volume: 243 start-page: 547 issue: 2 year: 2015 ident: 10.1016/j.ejor.2023.01.027_bib0006 article-title: Total completion time minimization on multiple machines subject to machine availability and makespan constraints publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2014.12.012 – volume: 48 start-page: 241 issue: 3 year: 2001 ident: 10.1016/j.ejor.2023.01.027_bib0032 article-title: On-line algorithms for minimizing makespan on batch processing machines publication-title: Naval Research Logistics doi: 10.1002/nav.5 – volume: 44 start-page: 480 issue: 1 year: 2022 ident: 10.1016/j.ejor.2023.01.027_bib0018 article-title: Single machine scheduling with non-availability interval and optional job rejection publication-title: Journal of Combinatorial Optimization doi: 10.1007/s10878-022-00845-2 – volume: 35 start-page: 175 issue: 2 year: 2003 ident: 10.1016/j.ejor.2023.01.027_bib0033 article-title: Optimal on-line algorithms for scheduling on parallel batch processing machines publication-title: IIE Transactions doi: 10.1080/07408170304378 – volume: 186 start-page: 1212 issue: 3 year: 2008 ident: 10.1016/j.ejor.2023.01.027_bib0031 article-title: Single machine unbounded parallel-batch scheduling with forbidden intervals publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2007.02.051 – volume: 271 start-page: 388 issue: 2 year: 2018 ident: 10.1016/j.ejor.2023.01.027_bib0019 article-title: Two-machine flow shop and open shop scheduling problems with a single maintenance window publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2018.04.019 – start-page: 525 year: 2020 ident: 10.1016/j.ejor.2023.01.027_bib0003 article-title: Single bounded parallel-batch machine scheduling with an unavailability constraint and job delivery |
| SSID | ssj0001515 |
| Score | 2.4698076 |
| Snippet | •Propose an online batch scheduling problem with periodic pulse interruptions.•Analyze the lower bounds on competitive ratios for the online problem.•Design... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 53 |
| SubjectTerms | Competitive ratio Identical batch machines Online algorithm Periodic pulse interruption Scheduling |
| Title | Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions |
| URI | https://dx.doi.org/10.1016/j.ejor.2023.01.027 |
| Volume | 309 |
| WOSCitedRecordID | wos000968901900001&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 customDbUrl: eissn: 1872-6860 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: AIEXJ dateStart: 19950105 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1db9MwFLVKhxA88FFAG1_yA29RUGM3cfI40BBM0wSogr5FTmyvrUISZc3U38Mv5Tq2k7KNiT3wErWW47S9p77X1_ccI_SWkmSqJI_9iDDlzwTPfM5F5ItIbwLpILpjeH8_Yaen8WKRfBmNfjkuzEXByjLebpP6v5oa2sDYmjp7C3P3g0IDvAajwxXMDtd_Mvx7mOe9utJYL6THi7MK1v9Lo7vgGWEMD5a04GI6JroudezIutpYGUzMS-9nV2ApLfFNSyFXYpV7dQtutNOXaJq2HhJ91-X1bYwLDY3LNlpZoT79fGLUC74N8Pxhc9fHbel_BdieDV3bbhNludqu-t6L1vbdTVwQqjOxhlfpCFuM-YQY6qabjOk0uYI6M7UaTWHrpI3y-ZXp32Qi1u_kutJar4QaSVY2ODu3wX_JB_aVia7obZ3qMVI9RjoNUhjjDtojLEziMdo7_Hy0OO79vQ4Ju70q-3UsNctUEV7-JNeHPzshzfwxemjXIvjQYOgJGslygu45KsQEPXJHfmDrASbowY5-5VNUaKxhhzU8YA0D1rDBGh6wBi24xxrusIYd1rDGGnZYwx3W8B9Ye4bmH4_mHz759vgOP6eUbnwV0VkI8brKAjGVVAnJ8kgwMpO5DKXigV6Lq0AoLhWJJdPHV0nBQqFYljNOn6NxWZVyH-GcZxyWBhCpx8lMJgTeUpUTEqtMiiyLDlDgftQ0t9L2-oSVIv27OQ-Q199TG2GXG3uHzlapDU1NyJkC9G6478WtnvIS3R_-KK_QeNO08jW6m19sVufNG4u731TNt1g |
| 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=Best+possible+algorithms+for+online+scheduling+on+identical+batch+machines+with+periodic+pulse+interruptions&rft.jtitle=European+journal+of+operational+research&rft.au=Lin%2C+Ran&rft.au=Wang%2C+Jun-Qiang&rft.au=Liu%2C+Zhixin&rft.au=Xu%2C+Jun&rft.date=2023-08-16&rft.issn=0377-2217&rft.volume=309&rft.issue=1&rft.spage=53&rft.epage=64&rft_id=info:doi/10.1016%2Fj.ejor.2023.01.027&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_ejor_2023_01_027 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon |