Deciding the feasibility of a given throughput rate in 2-cyclic robotic scheduling
We highlight in this article the relevance of a decision problem in k-cyclic robotic scheduling: deciding whether a certain throughput is feasible or not. Research until now has been focused mainly on the optimization problem (finding the maximum possible throughput). We provide an algorithm for thi...
Uloženo v:
| Vydáno v: | Theoretical computer science Ročník 1042; s. 115233 |
|---|---|
| Hlavní autor: | |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
19.07.2025
|
| Témata: | |
| ISSN: | 0304-3975 |
| 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 | We highlight in this article the relevance of a decision problem in k-cyclic robotic scheduling: deciding whether a certain throughput is feasible or not. Research until now has been focused mainly on the optimization problem (finding the maximum possible throughput). We provide an algorithm for this decision problem in 2-cyclic robotic scheduling that runs in O(n3) time, where n is the number of machines in the production line, and we outline possibilities for further work in this direction. |
|---|---|
| AbstractList | We highlight in this article the relevance of a decision problem in k-cyclic robotic scheduling: deciding whether a certain throughput is feasible or not. Research until now has been focused mainly on the optimization problem (finding the maximum possible throughput). We provide an algorithm for this decision problem in 2-cyclic robotic scheduling that runs in O(n3) time, where n is the number of machines in the production line, and we outline possibilities for further work in this direction. |
| ArticleNumber | 115233 |
| Author | Sáez, Pablo |
| Author_xml | – sequence: 1 givenname: Pablo surname: Sáez fullname: Sáez, Pablo email: pablosaezphd@gmail.com |
| BookMark | eNp9kM1OwzAQhH0oEm3hAbj5BRL8k9hEnFD5lSohIThbzmbdugpxZbuV-vYYlTN7mcPuzI6-BZlNYUJCbjirOePqdldnSLVgoq05b4WUMzJnkjWV7HR7SRYp7ViZVqs5-XhE8IOfNjRvkTq0yfd-9PlEg6OWbvwRp7KK4bDZ7g-ZRpuR-omKCk4weqAx9CEXTbDF4TCWpCty4eyY8PpPl-Tr-elz9Vqt31_eVg_rCrjuctUze8eHAQTYTlrdALAeulY55gbHeq0bqZQGHBpQlgvoFW_6cqOZFtioRi4JP-dCDClFdGYf_beNJ8OZ-QVhdqaAML8gzBlE8dyfPViKHT1Gk8DjVL74iJDNEPw_7h-Hwmr6 |
| Cites_doi | 10.1016/S0377-2217(96)00272-X 10.1109/70.988976 10.1016/j.tcs.2009.08.002 10.1016/j.tcs.2008.11.016 10.1016/S0167-6377(97)00036-9 10.1002/nav.20435 10.1016/j.dam.2008.03.025 |
| ContentType | Journal Article |
| Copyright | 2025 Elsevier B.V. |
| Copyright_xml | – notice: 2025 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.tcs.2025.115233 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| ExternalDocumentID | 10_1016_j_tcs_2025_115233 S0304397525001719 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 4.4 457 4G. 5VS 7-5 71M 8P~ 9JN AABNK AAEDW AAIKJ AAKOC AALRI AAOAW AAQFI AATTM AAXKI AAXUO AAYFN AAYWO ABAOU ABBOA ABJNI ABMAC ACDAQ ACGFS ACRLP ACVFH ACZNC ADBBV ADCNI ADEZE AEBSH AEIPS AEKER AENEX AEUPX AFJKZ AFPUW AFTJW AFXIZ AGCQF AGRNS AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGII AIIUN AIKHN AITUG AKBMS AKRWK AKYEP ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU AOUOD APXCP ARUGR AXJTR BKOJK BLXMC BNPGV CS3 DU5 EBS EFJIC EO8 EO9 EP2 EP3 F5P FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 ROL RPZ SCC SDF SDG SES SEW SPC SPCBC SSH SSV SSW T5K TN5 WH7 YNT ZMT ~G- 29Q 9DU AAEDT AAQXK AAYXX ABDPE ABEFU ABFNM ABWVN ABXDB ACLOT ACNNM ACRPL ADMUD ADNMO ADVLN AEXQZ AGHFR AGQPQ ASPBG AVWKF AZFZN CITATION EFKBS EFLBG EJD FGOYB G-2 HZ~ R2- SSZ TAE WUQ ZY4 ~HD |
| ID | FETCH-LOGICAL-c179t-b0a81ddc2ca93a74cc0bc956f0fdf0b7743667ced4c6a12cb614bc0b7072e4643 |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001469597400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0304-3975 |
| IngestDate | Sat Nov 29 08:01:40 EST 2025 Sat Jun 07 17:02:01 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Manufacturing line Polynomial algorithm Cyclic scheduling |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c179t-b0a81ddc2ca93a74cc0bc956f0fdf0b7743667ced4c6a12cb614bc0b7072e4643 |
| ParticipantIDs | crossref_primary_10_1016_j_tcs_2025_115233 elsevier_sciencedirect_doi_10_1016_j_tcs_2025_115233 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-07-19 |
| PublicationDateYYYYMMDD | 2025-07-19 |
| PublicationDate_xml | – month: 07 year: 2025 text: 2025-07-19 day: 19 |
| PublicationDecade | 2020 |
| PublicationTitle | Theoretical computer science |
| PublicationYear | 2025 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Sáez (br0070) 2009; 410 Che, Chu, Chu (br0010) 2002; 18 Kats, Levner (br0050) 2009; 157 Kats, Levner (br0040) 1997; 21 Levner, Kats, Levit (br0060) 1997; 97 Sáez (br0080) 2009 Che, Kats, Levner (br0030) 2009; 410 Che, Kats, Levner (br0020) 2011; 58 Sáez (10.1016/j.tcs.2025.115233_br0080) 2009 Kats (10.1016/j.tcs.2025.115233_br0050) 2009; 157 Levner (10.1016/j.tcs.2025.115233_br0060) 1997; 97 Sáez (10.1016/j.tcs.2025.115233_br0070) 2009; 410 Che (10.1016/j.tcs.2025.115233_br0010) 2002; 18 Che (10.1016/j.tcs.2025.115233_br0020) 2011; 58 Che (10.1016/j.tcs.2025.115233_br0030) 2009; 410 Kats (10.1016/j.tcs.2025.115233_br0040) 1997; 21 |
| References_xml | – volume: 21 start-page: 171 year: 1997 end-page: 179 ident: br0040 article-title: A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling publication-title: Oper. Res. Lett. – volume: 58 year: 2011 ident: br0020 article-title: Cyclic scheduling in robotic flowshops with bounded work-in-process publication-title: Nav. Res. Logist. – volume: 410 start-page: 973 year: 2009 end-page: 976 ident: br0070 article-title: A quadratic algorithm for the 2-cyclic robotic scheduling problem publication-title: Theor. Comput. Sci. – volume: 410 start-page: 5188 year: 2009 end-page: 5190 ident: br0030 article-title: A note on a quadratic algorithm for the 2-cyclic robotic scheduling problem publication-title: Theor. Comput. Sci. – volume: 97 start-page: 500 year: 1997 end-page: 508 ident: br0060 article-title: An improved algorithm for cyclic flowshop scheduling in a robotic cell publication-title: Eur. J. Oper. Res. – volume: 18 start-page: 69 year: 2002 end-page: 80 ident: br0010 article-title: Multicyclic hoist scheduling with constant processing times publication-title: IEEE Trans. Robot. Autom. – volume: 157 start-page: 339 year: 2009 end-page: 355 ident: br0050 article-title: A polynomial algorithm for 2-cyclic robotic scheduling: a non-Euclidean case publication-title: Discrete Appl. Math. – start-page: 149 year: 2009 end-page: 152 ident: br0080 article-title: Studies on 2-cyclic robotic scheduling publication-title: Proceedings of the 39th International Conference on Computers and Industrial Engineering – volume: 97 start-page: 500 year: 1997 ident: 10.1016/j.tcs.2025.115233_br0060 article-title: An improved algorithm for cyclic flowshop scheduling in a robotic cell publication-title: Eur. J. Oper. Res. doi: 10.1016/S0377-2217(96)00272-X – volume: 18 start-page: 69 issue: 1 year: 2002 ident: 10.1016/j.tcs.2025.115233_br0010 article-title: Multicyclic hoist scheduling with constant processing times publication-title: IEEE Trans. Robot. Autom. doi: 10.1109/70.988976 – volume: 410 start-page: 5188 issue: 47–49 year: 2009 ident: 10.1016/j.tcs.2025.115233_br0030 article-title: A note on a quadratic algorithm for the 2-cyclic robotic scheduling problem publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2009.08.002 – volume: 410 start-page: 973 issue: 8–10 year: 2009 ident: 10.1016/j.tcs.2025.115233_br0070 article-title: A quadratic algorithm for the 2-cyclic robotic scheduling problem publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2008.11.016 – volume: 21 start-page: 171 issue: 4 year: 1997 ident: 10.1016/j.tcs.2025.115233_br0040 article-title: A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling publication-title: Oper. Res. Lett. doi: 10.1016/S0167-6377(97)00036-9 – start-page: 149 year: 2009 ident: 10.1016/j.tcs.2025.115233_br0080 article-title: Studies on 2-cyclic robotic scheduling – volume: 58 year: 2011 ident: 10.1016/j.tcs.2025.115233_br0020 article-title: Cyclic scheduling in robotic flowshops with bounded work-in-process publication-title: Nav. Res. Logist. doi: 10.1002/nav.20435 – volume: 157 start-page: 339 issue: 2 year: 2009 ident: 10.1016/j.tcs.2025.115233_br0050 article-title: A polynomial algorithm for 2-cyclic robotic scheduling: a non-Euclidean case publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2008.03.025 |
| SSID | ssj0000576 |
| Score | 2.4475675 |
| Snippet | We highlight in this article the relevance of a decision problem in k-cyclic robotic scheduling: deciding whether a certain throughput is feasible or not.... |
| SourceID | crossref elsevier |
| SourceType | Index Database Publisher |
| StartPage | 115233 |
| SubjectTerms | Cyclic scheduling Manufacturing line Polynomial algorithm |
| Title | Deciding the feasibility of a given throughput rate in 2-cyclic robotic scheduling |
| URI | https://dx.doi.org/10.1016/j.tcs.2025.115233 |
| Volume | 1042 |
| WOSCitedRecordID | wos001469597400001&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: ScienceDirect Freedom Collection issn: 0304-3975 databaseCode: AIEXJ dateStart: 20211207 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0000576 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3fT9swELZG4YE9jA2Yxq_JD3sCBRk3qZNHNEAwjQoNkPoW2RcHtUJJ1YaJ_vecYzupVpAAaS9RZDVOdZ9z993Zd0fID5l0wSQ1BoDMLQilwk-KMx1odCViVncUqavr_xb9fjwYJFeu1eG0bicgiiJ-fEzG_xVqHEOwTersG-BuJsUBvEfQ8Yqw4_VVwJ9oGGY-CSrX0p1_ndlMyDuj3Xx3nvFDdWBKRZigBw9gBqbi9aRUpaniim4vmqF7b9pGzbJqEh_BdYQ4cGa0idbUu-9HLjYt1X05H1vgkQlazmmwxaQXm2hlNlMS2_CkUaLMFsla0Mg2ODA6rMAUR-cR6mj0fbut-WkOBV6bic28yMpMFZ9kiSxzESWoq5aPL04Hv1oLGwm7B-3-iN-trs_t_fOi5_nGHIe4-Uw-OfJPjy1oX8gHXayTNd9Ygzo9u04-XjbFdKcb5I9HlOIgnUOUljmVtEaUtohSgygdFtQjSh2itEV0k9yend78PA9cK4wAUGNWgWISHYsMOODHJUUIwBSga5uzPMuZQg7f7fUE6CyEnjzioJB1KfyNYILrEFnnV9IpykJ_IzSGLOKyp7RiOuQsl3GUxxmLkAqGWSjFFtn3AkvHtuJJ6o8CjlKUbmqkm1rpbpHQizR1a81SsRTxf_mx7fc9tkNW21W6SzrV5EHvkRX4Ww2nk-9ulTwB-rpkBw |
| 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=Deciding+the+feasibility+of+a+given+throughput+rate+in+2-cyclic+robotic+scheduling&rft.jtitle=Theoretical+computer+science&rft.au=S%C3%A1ez%2C+Pablo&rft.date=2025-07-19&rft.pub=Elsevier+B.V&rft.issn=0304-3975&rft.volume=1042&rft_id=info:doi/10.1016%2Fj.tcs.2025.115233&rft.externalDocID=S0304397525001719 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon |