Efficient approximation algorithms for the routing open shop problem
We consider the routing open shop problem being a generalization of two classical discrete optimization problems: the open shop scheduling problem and the metric traveling salesman problem. The jobs are located at nodes of some transportation network, and the machines travel on the network to execut...
Gespeichert in:
| Veröffentlicht in: | Computers & operations research Jg. 40; H. 3; S. 841 - 847 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
New York
Elsevier Ltd
01.03.2013
Elsevier Pergamon Press Inc |
| Schlagworte: | |
| ISSN: | 0305-0548, 1873-765X, 0305-0548 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | We consider the routing open shop problem being a generalization of two classical discrete optimization problems: the open shop scheduling problem and the metric traveling salesman problem. The jobs are located at nodes of some transportation network, and the machines travel on the network to execute the jobs in the open shop environment. The machines are initially located at the same node (depot) and must return to the depot after completing all the jobs. It is required to find a non-preemptive schedule with the minimum makespan. The problem is NP-hard even on the two-node network with two machines. We present new polynomial-time approximation algorithms with worst-case performance guarantees. |
|---|---|
| AbstractList | We consider the routing open shop problem being a generalization of two classical discrete optimization problems: the open shop scheduling problem and the metric traveling salesman problem. The jobs are located at nodes of some transportation network, and the machines travel on the network to execute the jobs in the open shop environment. The machines are initially located at the same node (depot) and must return to the depot after completing all the jobs. It is required to find a non-preemptive schedule with the minimum makespan. The problem is NP-hard even on the two-node network with two machines. We present new polynomial-time approximation algorithms with worst-case performance guarantees. We consider the routing open shop problem being a generalization of two classical discrete optimization problems: the open shop scheduling problem and the metric traveling salesman problem. The jobs are located at nodes of some transportation network, and the machines travel on the network to execute the jobs in the open shop environment. The machines are initially located at the same node (depot) and must return to the depot after completing all the jobs. It is required to find a non-preemptive schedule with the minimum makespan. The problem is NP-hard even on the two-node network with two machines. We present new polynomial-time approximation algorithms with worst-case performance guarantees. [PUBLICATION ABSTRACT] |
| Author | Chernykh, Ilya Kononov, Alexander Sevastyanov, Sergey |
| Author_xml | – sequence: 1 givenname: Ilya surname: Chernykh fullname: Chernykh, Ilya email: idchern@math.nsc.ru organization: Sobolev Institute of Mathematics, Acad. Koptyug pr. 4, 630090 Novosibirsk, Russia – sequence: 2 givenname: Alexander surname: Kononov fullname: Kononov, Alexander email: alvenko@math.nsc.ru organization: Sobolev Institute of Mathematics, Acad. Koptyug pr. 4, 630090 Novosibirsk, Russia – sequence: 3 givenname: Sergey surname: Sevastyanov fullname: Sevastyanov, Sergey email: seva@math.nsc.ru organization: Sobolev Institute of Mathematics, Acad. Koptyug pr. 4, 630090 Novosibirsk, Russia |
| BackLink | http://www.econis.eu/PPNSET?PPN=73655551X$$DView this record in ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften |
| BookMark | eNp9kbFu2zAQhonCAWoneYBOFdCli5Q7UqQkdCrcpA0QIEsCZCNomoxpyKRK0kH79qXjdMngW275_rvjxwWZ-eANIZ8QGgQUV9tGh9hQQNoANgDiA5lj37G6E_xpRubAgNfA2_4jWaS0hVIdxTn5cW2t0874XKlpiuGP26nsgq_U-Byiy5tdqmyIVd6YKoZ9dv65CpPxVdqEqSqB1Wh2F-TMqjGZy7d-Th5vrh-Wv-q7-5-3y-93tW6R5dqqXoPmg9LA7QAKmFh3_drSQaw4H6hVatC6VUixw1VPGVOKIjVCi3ZgPbBz8vU4t-z9vTcpy51L2oyj8ibsk0TaMyGYaGlBv7xDt2EffblOIg6CMkF7XqjPR8ro4F2SUyzPj39lxwQvhU-F6I6EjiGlaKzULr8aylG5USLIg3-5lcW_PPiXgLL4L0l8l_w__VTm29s9xeKLM1Gmw99os3bR6CzXwZ1I_wOqkJ4K |
| CODEN | CMORAP |
| CitedBy_id | crossref_primary_10_1016_j_ejor_2023_10_013 crossref_primary_10_1007_s43684_021_00017_9 crossref_primary_10_1007_s10951_025_00840_5 crossref_primary_10_1016_j_ejor_2021_03_026 crossref_primary_10_1016_j_cor_2022_105732 crossref_primary_10_1016_j_robot_2023_104604 crossref_primary_10_1007_s10472_021_09759_x crossref_primary_10_1007_s10951_021_00694_7 crossref_primary_10_1016_j_cie_2018_09_023 crossref_primary_10_1016_j_robot_2020_103560 crossref_primary_10_1016_j_cie_2021_107261 crossref_primary_10_1057_s41278_019_00122_w |
| Cites_doi | 10.1002/nav.20323 10.1016/j.ejor.2003.06.050 10.1016/S0166-218X(99)00115-8 10.1287/opre.47.1.165 10.1080/07408170590918290 10.1287/opre.31.3.507 10.1287/opre.41.6.1055 10.1145/321978.321985 10.1016/j.eswa.2009.05.003 10.1016/j.ejor.2005.01.034 10.1016/S0927-0507(05)80189-6 10.1287/opre.45.2.288 10.1287/trsc.30.4.303 10.1023/A:1018928911513 10.1016/j.ejor.2004.06.038 10.1016/S0927-0507(05)80106-9 |
| ContentType | Journal Article |
| Copyright | 2012 Elsevier Ltd Copyright Pergamon Press Inc. Mar 2013 |
| Copyright_xml | – notice: 2012 Elsevier Ltd – notice: Copyright Pergamon Press Inc. Mar 2013 |
| DBID | AAYXX CITATION OQ6 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.cor.2012.01.006 |
| DatabaseName | CrossRef ECONIS Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1873-765X 0305-0548 |
| EndPage | 847 |
| ExternalDocumentID | 2823592491 73655551X 10_1016_j_cor_2012_01_006 S0305054812000184 |
| Genre | Feature |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 186 1B1 1OL 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 6J9 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAFJI AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN AAYOK ABAOU ABBOA ABEFU ABFNM ABFRF ABJNI ABMAC ABMMH ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADJOM ADMUD AEBSH AEFWE AEHXG AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV AKYCK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOMHK AOUOD APLSM ARUGR ASPBG AVARZ AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HAMUX HVGLF HZ~ H~9 IHE J1W KOM LY1 M41 MHUIS MO0 MS~ O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ PRBVW Q38 R2- RIG ROL RPZ RXW SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSO SSV SSW SSZ T5K TAE TN5 U5U UAO UPT VH1 WUQ XFK XPP ZMT ~02 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD OQ6 7SC 8FD AFXIZ AGCQF AGRNS JQ2 L7M L~C L~D SSH |
| ID | FETCH-LOGICAL-c413t-fa8c0c59ac05f90a036d78df296b5592faa9cc4a12171b8233aa212e6c6493803 |
| ISICitedReferencesCount | 20 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000312420100017&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0305-0548 |
| IngestDate | Sun Nov 09 14:03:38 EST 2025 Mon Jul 14 08:58:28 EDT 2025 Sat Mar 08 16:21:47 EST 2025 Tue Nov 18 21:43:31 EST 2025 Sat Nov 29 03:23:36 EST 2025 Fri Feb 23 02:33:29 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Keywords | Approximation algorithm Worst-case analysis Routing open shop |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c413t-fa8c0c59ac05f90a036d78df296b5592faa9cc4a12171b8233aa212e6c6493803 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
| PQID | 1196236285 |
| PQPubID | 45870 |
| PageCount | 7 |
| ParticipantIDs | proquest_miscellaneous_1283663642 proquest_journals_1196236285 econis_primary_73655551X crossref_citationtrail_10_1016_j_cor_2012_01_006 crossref_primary_10_1016_j_cor_2012_01_006 elsevier_sciencedirect_doi_10_1016_j_cor_2012_01_006 |
| PublicationCentury | 2000 |
| PublicationDate | 2013-03-01 |
| PublicationDateYYYYMMDD | 2013-03-01 |
| PublicationDate_xml | – month: 03 year: 2013 text: 2013-03-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Computers & operations research |
| PublicationYear | 2013 |
| Publisher | Elsevier Ltd Elsevier Pergamon Press Inc |
| Publisher_xml | – name: Elsevier Ltd – name: Elsevier – name: Pergamon Press Inc |
| References | Averbakh, Berman (bib2) 1999; 47 Averbakh, Berman, Chernykh (bib4) 2006; 173 Desrosiers J, Dumas Y, Solomon M, Soumis F. Time constrained routing and scheduling. In: Ball MO, Magnanti TL, Monma CL, Nemhauser GL, editors. Handbooks in operations research and management science. Network Routing, vol. 8. North-Holland; 1995. p. 35–139. Bárány, Fiala (bib5) 1982; 15 Christofides N. Worst-case analysis of a new heuristic for the travelling salesman problem. Report 388. Pittsburgh, PA: Graduate School of Industrial Administration, Carnegie-Mellon University; 1976. Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB. Sequencing and scheduling: algorithms and complexity. In: Handbooks in operations research and management science. Logistics of production and inventory, vol. 4. North Holland, Amsterdam; 1993. p. 445–522. Monien, Sudborough (bib18) 1981 Ruiz, Maroto (bib22) 2006; 169 Strusevich (bib24) 1999; 93 Fischetti, Laporte, Martello (bib9) 1993; 41 Demidenko (bib7) 1979; 1 Montoya-Torres, Soto-Ferrari, Gonzalez-Solano, Alfonso-Lizarazo (bib19) 2009 Lee, Strusevich (bib15) 2005; 37 Karuno, Nagamochi, Ibaraki (bib14) 1997; 69 Roshanaei, Seyyed Esfehani, Zandieh (bib21) 2010; 37 Gabow HN. Data structures for weighted matching and nearest common ancestor with linking. In: Proceedings of the 1st annual ACM-SIAM symposium on discrete algorithms; 1990. Lushchakova, Soper, Strusevich (bib16) 2009; 56 Averbakh, Berman (bib1) 1996; 30 Gonzalez, Sahni (bib13) 1976; 23 Garey, Johnson (bib11) 1979 Williamson, Hall, Hoogeveen, Hurkens, Lenstra, Sevastianov (bib25) 1997; 45 Gilmore, Lawler, Shmoys (bib12) 1985 Serdyukov (bib23) 1978; 17 Averbakh, Berman, Chernykh (bib3) 2005; 166 Ratliff, Rosentahl (bib20) 1983; 31 Monien (10.1016/j.cor.2012.01.006_bib18) 1981 Lushchakova (10.1016/j.cor.2012.01.006_bib16) 2009; 56 10.1016/j.cor.2012.01.006_bib10 Karuno (10.1016/j.cor.2012.01.006_bib14) 1997; 69 Averbakh (10.1016/j.cor.2012.01.006_bib4) 2006; 173 10.1016/j.cor.2012.01.006_bib8 10.1016/j.cor.2012.01.006_bib17 10.1016/j.cor.2012.01.006_bib6 Gonzalez (10.1016/j.cor.2012.01.006_bib13) 1976; 23 Strusevich (10.1016/j.cor.2012.01.006_bib24) 1999; 93 Montoya-Torres (10.1016/j.cor.2012.01.006_bib19) 2009 Demidenko (10.1016/j.cor.2012.01.006_bib7) 1979; 1 Ratliff (10.1016/j.cor.2012.01.006_bib20) 1983; 31 Roshanaei (10.1016/j.cor.2012.01.006_bib21) 2010; 37 Averbakh (10.1016/j.cor.2012.01.006_bib3) 2005; 166 Lee (10.1016/j.cor.2012.01.006_bib15) 2005; 37 Garey (10.1016/j.cor.2012.01.006_bib11) 1979 Bárány (10.1016/j.cor.2012.01.006_bib5) 1982; 15 Averbakh (10.1016/j.cor.2012.01.006_bib1) 1996; 30 Fischetti (10.1016/j.cor.2012.01.006_bib9) 1993; 41 Gilmore (10.1016/j.cor.2012.01.006_bib12) 1985 Averbakh (10.1016/j.cor.2012.01.006_bib2) 1999; 47 Serdyukov (10.1016/j.cor.2012.01.006_bib23) 1978; 17 Ruiz (10.1016/j.cor.2012.01.006_bib22) 2006; 169 Williamson (10.1016/j.cor.2012.01.006_bib25) 1997; 45 |
| References_xml | – reference: Gabow HN. Data structures for weighted matching and nearest common ancestor with linking. In: Proceedings of the 1st annual ACM-SIAM symposium on discrete algorithms; 1990. – volume: 47 start-page: 165 year: 1999 end-page: 170 ident: bib2 article-title: A simple heuristic for publication-title: Operations Research – volume: 37 start-page: 725 year: 2005 end-page: 736 ident: bib15 article-title: Two-machine shop scheduling with an uncapacitated interstage transporter publication-title: IIE Transactions – volume: 15 start-page: 177 year: 1982 end-page: 191 ident: bib5 article-title: Többgépes ütemezési problémàk közel optimális megoldása publication-title: Szigma-Mat—Közgazdasági Folyóirat – year: 1985 ident: bib12 article-title: Well-solved special cases publication-title: The traveling salesman problem – year: 1979 ident: bib11 article-title: Computers and intractability, a guide to the theory of NP-completeness – volume: 69 start-page: 193 year: 1997 end-page: 207 ident: bib14 article-title: Vehicle scheduling on a tree with release and handling times publication-title: Annals of Operations Research – volume: 17 start-page: 76 year: 1978 end-page: 79 ident: bib23 article-title: On some extremal routes in graphs publication-title: Upravlyaemye Sistemy – volume: 41 start-page: 1055 year: 1993 end-page: 1064 ident: bib9 article-title: The delivery man problem and cumulative matroids publication-title: Operations Research – reference: Christofides N. Worst-case analysis of a new heuristic for the travelling salesman problem. Report 388. Pittsburgh, PA: Graduate School of Industrial Administration, Carnegie-Mellon University; 1976. – volume: 23 start-page: 665 year: 1976 end-page: 679 ident: bib13 article-title: Open shop scheduling to minimize finish time publication-title: Journal of the ACM – volume: 93 start-page: 287 year: 1999 end-page: 304 ident: bib24 article-title: A heuristic for the two-machine open shop scheduling problem with transportation times publication-title: Discrete Applied Mathematics – volume: 1 start-page: 29 year: 1979 end-page: 35 ident: bib7 article-title: The traveling salesman problem with asymmetric matrices publication-title: Vestsi Akademii Navuk BSSR Seryya Fizika—Matematychnykh Navuk – volume: 56 start-page: 1 year: 2009 end-page: 18 ident: bib16 article-title: Transporting jobs through a two-machine open shop publication-title: Naval Research Logistics – volume: 31 start-page: 507 year: 1983 end-page: 521 ident: bib20 article-title: Order picking in a rectangular warehouse: a solvable case of the traveling salesman problem publication-title: Operations Research – volume: 45 start-page: 288 year: 1997 end-page: 294 ident: bib25 article-title: Short shop schedules publication-title: Operations Research – start-page: 207 year: 1981 end-page: 217 ident: bib18 article-title: Bandwidth constrained NP-complete problems publication-title: Proceedings of the 13-th annual ACM symposium on theory of computing – volume: 169 start-page: 781 year: 2006 end-page: 800 ident: bib22 article-title: A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility publication-title: European Journal of Operational Research – volume: 173 start-page: 521 year: 2006 end-page: 539 ident: bib4 article-title: The routing open-shop problem on a network: complexity and approximation publication-title: European Journal of Operational Research – volume: 166 start-page: 3 year: 2005 end-page: 24 ident: bib3 article-title: A publication-title: European Journal of Operational Research – reference: Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB. Sequencing and scheduling: algorithms and complexity. In: Handbooks in operations research and management science. Logistics of production and inventory, vol. 4. North Holland, Amsterdam; 1993. p. 445–522. – start-page: 28 year: 2009 end-page: 33 ident: bib19 article-title: Machine scheduling with sequence-dependent setup times using a randomized search heuristic publication-title: Computers Industrial Engineering, CIE – volume: 30 start-page: 303 year: 1996 end-page: 314 ident: bib1 article-title: Routing two-machine flowshop problems on networks with special structure publication-title: Transportation Science – reference: Desrosiers J, Dumas Y, Solomon M, Soumis F. Time constrained routing and scheduling. In: Ball MO, Magnanti TL, Monma CL, Nemhauser GL, editors. Handbooks in operations research and management science. Network Routing, vol. 8. North-Holland; 1995. p. 35–139. – volume: 37 start-page: 259 year: 2010 end-page: 266 ident: bib21 article-title: Integrating non-preemptive open shops scheduling with sequence-dependent setup times using advanced metaheuristics publication-title: Expert Systems with Applications – volume: 56 start-page: 1 year: 2009 ident: 10.1016/j.cor.2012.01.006_bib16 article-title: Transporting jobs through a two-machine open shop publication-title: Naval Research Logistics doi: 10.1002/nav.20323 – ident: 10.1016/j.cor.2012.01.006_bib10 – volume: 15 start-page: 177 year: 1982 ident: 10.1016/j.cor.2012.01.006_bib5 article-title: Többgépes ütemezési problémàk közel optimális megoldása publication-title: Szigma-Mat—Közgazdasági Folyóirat – ident: 10.1016/j.cor.2012.01.006_bib6 – volume: 166 start-page: 3 issue: 1 year: 2005 ident: 10.1016/j.cor.2012.01.006_bib3 article-title: A 65-approximation algorithm for the two-machine routing open shop problem on a 2-node network publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2003.06.050 – year: 1979 ident: 10.1016/j.cor.2012.01.006_bib11 – start-page: 207 year: 1981 ident: 10.1016/j.cor.2012.01.006_bib18 article-title: Bandwidth constrained NP-complete problems – volume: 17 start-page: 76 year: 1978 ident: 10.1016/j.cor.2012.01.006_bib23 article-title: On some extremal routes in graphs publication-title: Upravlyaemye Sistemy – volume: 93 start-page: 287 year: 1999 ident: 10.1016/j.cor.2012.01.006_bib24 article-title: A heuristic for the two-machine open shop scheduling problem with transportation times publication-title: Discrete Applied Mathematics doi: 10.1016/S0166-218X(99)00115-8 – volume: 47 start-page: 165 issue: 1 year: 1999 ident: 10.1016/j.cor.2012.01.006_bib2 article-title: A simple heuristic for m-machine flow-shop and its applications in routing-scheduling problems publication-title: Operations Research doi: 10.1287/opre.47.1.165 – volume: 37 start-page: 725 year: 2005 ident: 10.1016/j.cor.2012.01.006_bib15 article-title: Two-machine shop scheduling with an uncapacitated interstage transporter publication-title: IIE Transactions doi: 10.1080/07408170590918290 – volume: 31 start-page: 507 year: 1983 ident: 10.1016/j.cor.2012.01.006_bib20 article-title: Order picking in a rectangular warehouse: a solvable case of the traveling salesman problem publication-title: Operations Research doi: 10.1287/opre.31.3.507 – volume: 41 start-page: 1055 issue: 6 year: 1993 ident: 10.1016/j.cor.2012.01.006_bib9 article-title: The delivery man problem and cumulative matroids publication-title: Operations Research doi: 10.1287/opre.41.6.1055 – volume: 1 start-page: 29 year: 1979 ident: 10.1016/j.cor.2012.01.006_bib7 article-title: The traveling salesman problem with asymmetric matrices publication-title: Vestsi Akademii Navuk BSSR Seryya Fizika—Matematychnykh Navuk – volume: 23 start-page: 665 year: 1976 ident: 10.1016/j.cor.2012.01.006_bib13 article-title: Open shop scheduling to minimize finish time publication-title: Journal of the ACM doi: 10.1145/321978.321985 – year: 1985 ident: 10.1016/j.cor.2012.01.006_bib12 article-title: Well-solved special cases – volume: 37 start-page: 259 issue: 1 year: 2010 ident: 10.1016/j.cor.2012.01.006_bib21 article-title: Integrating non-preemptive open shops scheduling with sequence-dependent setup times using advanced metaheuristics publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2009.05.003 – volume: 173 start-page: 521 issue: 2 year: 2006 ident: 10.1016/j.cor.2012.01.006_bib4 article-title: The routing open-shop problem on a network: complexity and approximation publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2005.01.034 – start-page: 28 year: 2009 ident: 10.1016/j.cor.2012.01.006_bib19 article-title: Machine scheduling with sequence-dependent setup times using a randomized search heuristic publication-title: Computers Industrial Engineering, CIE – ident: 10.1016/j.cor.2012.01.006_bib17 doi: 10.1016/S0927-0507(05)80189-6 – volume: 45 start-page: 288 issue: 2 year: 1997 ident: 10.1016/j.cor.2012.01.006_bib25 article-title: Short shop schedules publication-title: Operations Research doi: 10.1287/opre.45.2.288 – volume: 30 start-page: 303 issue: 4 year: 1996 ident: 10.1016/j.cor.2012.01.006_bib1 article-title: Routing two-machine flowshop problems on networks with special structure publication-title: Transportation Science doi: 10.1287/trsc.30.4.303 – volume: 69 start-page: 193 year: 1997 ident: 10.1016/j.cor.2012.01.006_bib14 article-title: Vehicle scheduling on a tree with release and handling times publication-title: Annals of Operations Research doi: 10.1023/A:1018928911513 – volume: 169 start-page: 781 issue: 3 year: 2006 ident: 10.1016/j.cor.2012.01.006_bib22 article-title: A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2004.06.038 – ident: 10.1016/j.cor.2012.01.006_bib8 doi: 10.1016/S0927-0507(05)80106-9 |
| SSID | ssj0000721 |
| Score | 2.1572762 |
| Snippet | We consider the routing open shop problem being a generalization of two classical discrete optimization problems: the open shop scheduling problem and the... |
| SourceID | proquest econis crossref elsevier |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 841 |
| SubjectTerms | Algorithms Approximation Approximation algorithm Computer networks Job shops Machine shops Mathematical analysis Mathematical problems Networks Optimization algorithms Route optimization Routing (machining) Routing (telecommunications) Routing open shop Studies Traveling salesman problem Worst-case analysis |
| Title | Efficient approximation algorithms for the routing open shop problem |
| URI | https://dx.doi.org/10.1016/j.cor.2012.01.006 http://www.econis.eu/PPNSET?PPN=73655551X https://www.proquest.com/docview/1196236285 https://www.proquest.com/docview/1283663642 |
| Volume | 40 |
| WOSCitedRecordID | wos000312420100017&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: 1873-765X dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000721 issn: 0305-0548 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3fi9NAEF5q7xB98EdVrnrKCj5ZIkk2ySaPx1nxVA7hTshb2OxuvJ4lLU1aWvCPdza72aQnHCrYQijJNkl3vs7OTGa-QeiNm0tBheCOz13hBFwWTk6EdILQE5FCFOENiesXen4ep2nydTD42dbCbOa0LOPtNln-V1HDPhC2Kp39C3Hbk8IO-AxChy2IHbZ_JPhpQwrRpI4rvvDtTBcnTtj8-2I1q680A4NJLVzrrOelLCfV1WI5Mf1l-iZr2_ehalACQ1cme87wBNl48imIv9z9aOI0Z_Od1fefFyW8N3vlNDawIzesqnfMHL9QtaC7fiRCdYUg_UiELZHp8pGasiyVHRhqOs13UmvZmBKHRmHaV8OatcnAjfR0aqyZsdrlWRN0_qb5dRDiGgSnWF5VhNdTOXvdMmeTDy_ULak78lSZEni4d9CBT8GxGqKDk7Np-qlbyWlTt2d_QvtUvMkPvHGhPbvmUAUzZtWegXNjqW_sl8tH6IFxPPCJBsxjNJDlCN1t6x5G6GErZ2zU_Qjd75FVPkHvLbDwHrBwBywMwMIALGyAhRWwsAIWNsB6ir59mF6efnRMDw6Hg3lTOwWLucvDhHE3LBKXgcEjaCwKP4lycEb9grGE84B54Np6eewTwhhYQzLiUZCQ2CXP0BBAJo8QzrmIooKCPhA0CCLCRBHmQQH-MmckYe4Yue0MZtwQ1Ks-KfOszUS8zmDSMzXpmetlMOlj9NZ-ZanZWW4bfKTFYodSEoXw8tIxClpBZcby1BZlBvC67YzHrVAzowEqcKkTcClUZfIYvbaHQWmrJ3GslIs1jAGjHkx98P2f_9uVX6B73T_wGA3r1Vq-RId8U8-q1SuD41_AtL8E |
| 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=Efficient+approximation+algorithms+for+the+routing+open+shop+problem&rft.jtitle=Computers+%26+operations+research&rft.au=Chernykh%2C+Ilya&rft.au=Kononov%2C+Alexander&rft.au=Sevastyanov%2C+Sergey&rft.date=2013-03-01&rft.pub=Elsevier+Ltd&rft.issn=0305-0548&rft.eissn=1873-765X&rft.volume=40&rft.issue=3&rft.spage=841&rft.epage=847&rft_id=info:doi/10.1016%2Fj.cor.2012.01.006&rft.externalDocID=S0305054812000184 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0548&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0548&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0548&client=summon |