On the routing open shop problem with two machines on a two-vertex network
The open shop problem is under study with two machines and routing on a two-vertex network. This problem is NP-hard. We introduce an exact pseudopolynomial algorithm, propose a fully polynomial time approximation scheme for solving this problem, and consider some particular polynomially solvable cas...
Gespeichert in:
| Veröffentlicht in: | Journal of applied and industrial mathematics 2012-07, Vol.6 (3), p.318-331 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 331 |
|---|---|
| container_issue | 3 |
| container_start_page | 318 |
| container_title | Journal of applied and industrial mathematics |
| container_volume | 6 |
| creator | Kononov, A. V. |
| description | The open shop problem is under study with two machines and routing on a two-vertex network. This problem is NP-hard. We introduce an exact pseudopolynomial algorithm, propose a fully polynomial time approximation scheme for solving this problem, and consider some particular polynomially solvable cases. |
| doi_str_mv | 10.1134/S1990478912030064 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1136368859</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1136368859</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2644-c957fe718b9244c13f93b01ff22d3f1a93147837c35b31f42a4385ac87c2d0703</originalsourceid><addsrcrecordid>eNp1kEtLxDAUhYMoOIzzA9wF3LipJrlp0yxl8MnALNR1STPJtNomNen4-PdmGBFRXN0H3zmcexE6puSMUuDn91RKwkUpKSNASMH30GS7yriQYv-7L-UhmsXY1gQoK6Ao2ATdLR0eG4OD34ytW2M_GIdj4wc8BF93psdv7djg8c3jXummdSZi77DabrJXE0bzjp1JQ3g-QgdWddHMvuoUPV5dPsxvssXy-nZ-scg0KzjPtMyFNYKWtWScawpWQk2otYytwFIlgaaoIDTkNVDLmeJQ5kqXQrMVEQSm6HTnmxK-bEwcq76N2nSdcsZvYpVeko4ry1wm9OQX-uQ3waV0FSUgmACWF4miO0oHH2MwthpC26vwkaCtG6_-PDhp2E4TE-vWJvx0_k_0CT0kenI</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1037273256</pqid></control><display><type>article</type><title>On the routing open shop problem with two machines on a two-vertex network</title><source>SpringerLink Journals - AutoHoldings</source><creator>Kononov, A. V.</creator><creatorcontrib>Kononov, A. V.</creatorcontrib><description>The open shop problem is under study with two machines and routing on a two-vertex network. This problem is NP-hard. We introduce an exact pseudopolynomial algorithm, propose a fully polynomial time approximation scheme for solving this problem, and consider some particular polynomially solvable cases.</description><identifier>ISSN: 1990-4789</identifier><identifier>EISSN: 1990-4797</identifier><identifier>DOI: 10.1134/S1990478912030064</identifier><language>eng</language><publisher>Dordrecht: SP MAIK Nauka/Interperiodica</publisher><subject>Algorithms ; Applied mathematics ; Approximation ; Computer networks ; Critical path ; Job shops ; Machine shops ; Mathematical analysis ; Mathematical models ; Mathematics ; Mathematics and Statistics ; Networks ; Operations research ; Polynomials ; Routing ; Routing (machining) ; Routing (telecommunications) ; Studies</subject><ispartof>Journal of applied and industrial mathematics, 2012-07, Vol.6 (3), p.318-331</ispartof><rights>Pleiades Publishing, Ltd. 2012</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c2644-c957fe718b9244c13f93b01ff22d3f1a93147837c35b31f42a4385ac87c2d0703</citedby><cites>FETCH-LOGICAL-c2644-c957fe718b9244c13f93b01ff22d3f1a93147837c35b31f42a4385ac87c2d0703</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1134/S1990478912030064$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1134/S1990478912030064$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,27923,27924,41487,42556,51318</link.rule.ids></links><search><creatorcontrib>Kononov, A. V.</creatorcontrib><title>On the routing open shop problem with two machines on a two-vertex network</title><title>Journal of applied and industrial mathematics</title><addtitle>J. Appl. Ind. Math</addtitle><description>The open shop problem is under study with two machines and routing on a two-vertex network. This problem is NP-hard. We introduce an exact pseudopolynomial algorithm, propose a fully polynomial time approximation scheme for solving this problem, and consider some particular polynomially solvable cases.</description><subject>Algorithms</subject><subject>Applied mathematics</subject><subject>Approximation</subject><subject>Computer networks</subject><subject>Critical path</subject><subject>Job shops</subject><subject>Machine shops</subject><subject>Mathematical analysis</subject><subject>Mathematical models</subject><subject>Mathematics</subject><subject>Mathematics and Statistics</subject><subject>Networks</subject><subject>Operations research</subject><subject>Polynomials</subject><subject>Routing</subject><subject>Routing (machining)</subject><subject>Routing (telecommunications)</subject><subject>Studies</subject><issn>1990-4789</issn><issn>1990-4797</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp1kEtLxDAUhYMoOIzzA9wF3LipJrlp0yxl8MnALNR1STPJtNomNen4-PdmGBFRXN0H3zmcexE6puSMUuDn91RKwkUpKSNASMH30GS7yriQYv-7L-UhmsXY1gQoK6Ao2ATdLR0eG4OD34ytW2M_GIdj4wc8BF93psdv7djg8c3jXummdSZi77DabrJXE0bzjp1JQ3g-QgdWddHMvuoUPV5dPsxvssXy-nZ-scg0KzjPtMyFNYKWtWScawpWQk2otYytwFIlgaaoIDTkNVDLmeJQ5kqXQrMVEQSm6HTnmxK-bEwcq76N2nSdcsZvYpVeko4ry1wm9OQX-uQ3waV0FSUgmACWF4miO0oHH2MwthpC26vwkaCtG6_-PDhp2E4TE-vWJvx0_k_0CT0kenI</recordid><startdate>201207</startdate><enddate>201207</enddate><creator>Kononov, A. V.</creator><general>SP MAIK Nauka/Interperiodica</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7TB</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>88I</scope><scope>8AL</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FR3</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>KR7</scope><scope>L.-</scope><scope>L6V</scope><scope>M0C</scope><scope>M0N</scope><scope>M2P</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>PYYUZ</scope><scope>Q9U</scope></search><sort><creationdate>201207</creationdate><title>On the routing open shop problem with two machines on a two-vertex network</title><author>Kononov, A. V.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2644-c957fe718b9244c13f93b01ff22d3f1a93147837c35b31f42a4385ac87c2d0703</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Algorithms</topic><topic>Applied mathematics</topic><topic>Approximation</topic><topic>Computer networks</topic><topic>Critical path</topic><topic>Job shops</topic><topic>Machine shops</topic><topic>Mathematical analysis</topic><topic>Mathematical models</topic><topic>Mathematics</topic><topic>Mathematics and Statistics</topic><topic>Networks</topic><topic>Operations research</topic><topic>Polynomials</topic><topic>Routing</topic><topic>Routing (machining)</topic><topic>Routing (telecommunications)</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kononov, A. V.</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>Civil Engineering Abstracts</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Science Database</collection><collection>Engineering Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>ABI/INFORM Collection China</collection><collection>ProQuest Central Basic</collection><jtitle>Journal of applied and industrial mathematics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Kononov, A. V.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On the routing open shop problem with two machines on a two-vertex network</atitle><jtitle>Journal of applied and industrial mathematics</jtitle><stitle>J. Appl. Ind. Math</stitle><date>2012-07</date><risdate>2012</risdate><volume>6</volume><issue>3</issue><spage>318</spage><epage>331</epage><pages>318-331</pages><issn>1990-4789</issn><eissn>1990-4797</eissn><abstract>The open shop problem is under study with two machines and routing on a two-vertex network. This problem is NP-hard. We introduce an exact pseudopolynomial algorithm, propose a fully polynomial time approximation scheme for solving this problem, and consider some particular polynomially solvable cases.</abstract><cop>Dordrecht</cop><pub>SP MAIK Nauka/Interperiodica</pub><doi>10.1134/S1990478912030064</doi><tpages>14</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1990-4789 |
| ispartof | Journal of applied and industrial mathematics, 2012-07, Vol.6 (3), p.318-331 |
| issn | 1990-4789 1990-4797 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1136368859 |
| source | SpringerLink Journals - AutoHoldings |
| subjects | Algorithms Applied mathematics Approximation Computer networks Critical path Job shops Machine shops Mathematical analysis Mathematical models Mathematics Mathematics and Statistics Networks Operations research Polynomials Routing Routing (machining) Routing (telecommunications) Studies |
| title | On the routing open shop problem with two machines on a two-vertex network |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-13T00%3A42%3A58IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20the%20routing%20open%20shop%20problem%20with%20two%20machines%20on%20a%20two-vertex%20network&rft.jtitle=Journal%20of%20applied%20and%20industrial%20mathematics&rft.au=Kononov,%20A.%20V.&rft.date=2012-07&rft.volume=6&rft.issue=3&rft.spage=318&rft.epage=331&rft.pages=318-331&rft.issn=1990-4789&rft.eissn=1990-4797&rft_id=info:doi/10.1134/S1990478912030064&rft_dat=%3Cproquest_cross%3E1136368859%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1037273256&rft_id=info:pmid/&rfr_iscdi=true |