Online Combinatorial Optimization with Multiple Projections and Its Application to Scheduling Problem
We consider combinatorial online prediction problems and propose a new construction method of efficient algorithms for the problems. One of the previous approaches to the problem is to apply online prediction method, in which two external procedures the projection and the metarounding are assumed to...
Gespeichert in:
| Veröffentlicht in: | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Communications and Computer Sciences, 2018/09/01, Vol.E101.A(9), pp.1334-1343 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1343 |
|---|---|
| container_issue | 9 |
| container_start_page | 1334 |
| container_title | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |
| container_volume | E101.A |
| creator | FUJITA, Takahiro HATANO, Kohei KIJIMA, Shuji TAKIMOTO, Eiji |
| description | We consider combinatorial online prediction problems and propose a new construction method of efficient algorithms for the problems. One of the previous approaches to the problem is to apply online prediction method, in which two external procedures the projection and the metarounding are assumed to be implemented. In this work, we generalize the projection to multiple projections. As an application of our framework, we show an algorithm for an online job scheduling problem with a single machine with precedence constraints. |
| doi_str_mv | 10.1587/transfun.E101.A.1334 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2301830066</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2301830066</sourcerecordid><originalsourceid>FETCH-LOGICAL-c413t-a6240c36231c79a617f5791be05532b676578613b3d3dd2dec4765a03d3185a3</originalsourceid><addsrcrecordid>eNplkNFKwzAUhoMoOKdv4EXA69akadP2soypw8kEdx_SNN1S0rQmKaJPb0t1CF4lOfm-czg_ALcYhTjJ0ntvuXH1YMI1RjgsQkxIfAYWOI2TYLyn52CBckyDLEHZJbhyrkEIZxGOF0DujFZGwlXXlspw31nFNdz1XrXqi3vVGfih_BG-DNqrXkv4artGiunDQW4quPEOFn2vlZhp38E3cZTVMLY9THSpZXsNLmqunbz5OZdg_7Der56C7e5xsyq2gYgx8QGnUYwEoRHBIs05xWmdpDkuJUoSEpU0pUmaUUxKUpGqiiop4rHE0fjEWcLJEtzNbXvbvQ_SedZ0gzXjRBaRcWOCEKUjFc-UsJ1zVtast6rl9pNhxKY82W-ebMqTFWzKc9SeZ61xnh_kSeLWK6HlPyn_a58oceSWSUO-ARxOhyo</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2301830066</pqid></control><display><type>article</type><title>Online Combinatorial Optimization with Multiple Projections and Its Application to Scheduling Problem</title><source>J-STAGE Free</source><creator>FUJITA, Takahiro ; HATANO, Kohei ; KIJIMA, Shuji ; TAKIMOTO, Eiji</creator><creatorcontrib>FUJITA, Takahiro ; HATANO, Kohei ; KIJIMA, Shuji ; TAKIMOTO, Eiji</creatorcontrib><description>We consider combinatorial online prediction problems and propose a new construction method of efficient algorithms for the problems. One of the previous approaches to the problem is to apply online prediction method, in which two external procedures the projection and the metarounding are assumed to be implemented. In this work, we generalize the projection to multiple projections. As an application of our framework, we show an algorithm for an online job scheduling problem with a single machine with precedence constraints.</description><identifier>ISSN: 0916-8508</identifier><identifier>EISSN: 1745-1337</identifier><identifier>DOI: 10.1587/transfun.E101.A.1334</identifier><language>eng</language><publisher>Tokyo: The Institute of Electronics, Information and Communication Engineers</publisher><subject>Algorithms ; Combinatorial analysis ; combinatorial optimization ; Forecasting ; online learning ; Optimization ; permutation ; Precedence constraints ; Production scheduling ; Scheduling</subject><ispartof>IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2018/09/01, Vol.E101.A(9), pp.1334-1343</ispartof><rights>2018 The Institute of Electronics, Information and Communication Engineers</rights><rights>Copyright Japan Science and Technology Agency 2018</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c413t-a6240c36231c79a617f5791be05532b676578613b3d3dd2dec4765a03d3185a3</citedby><cites>FETCH-LOGICAL-c413t-a6240c36231c79a617f5791be05532b676578613b3d3dd2dec4765a03d3185a3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,1877,27901,27902</link.rule.ids></links><search><creatorcontrib>FUJITA, Takahiro</creatorcontrib><creatorcontrib>HATANO, Kohei</creatorcontrib><creatorcontrib>KIJIMA, Shuji</creatorcontrib><creatorcontrib>TAKIMOTO, Eiji</creatorcontrib><title>Online Combinatorial Optimization with Multiple Projections and Its Application to Scheduling Problem</title><title>IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences</title><addtitle>IEICE Trans. Fundamentals</addtitle><description>We consider combinatorial online prediction problems and propose a new construction method of efficient algorithms for the problems. One of the previous approaches to the problem is to apply online prediction method, in which two external procedures the projection and the metarounding are assumed to be implemented. In this work, we generalize the projection to multiple projections. As an application of our framework, we show an algorithm for an online job scheduling problem with a single machine with precedence constraints.</description><subject>Algorithms</subject><subject>Combinatorial analysis</subject><subject>combinatorial optimization</subject><subject>Forecasting</subject><subject>online learning</subject><subject>Optimization</subject><subject>permutation</subject><subject>Precedence constraints</subject><subject>Production scheduling</subject><subject>Scheduling</subject><issn>0916-8508</issn><issn>1745-1337</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><recordid>eNplkNFKwzAUhoMoOKdv4EXA69akadP2soypw8kEdx_SNN1S0rQmKaJPb0t1CF4lOfm-czg_ALcYhTjJ0ntvuXH1YMI1RjgsQkxIfAYWOI2TYLyn52CBckyDLEHZJbhyrkEIZxGOF0DujFZGwlXXlspw31nFNdz1XrXqi3vVGfih_BG-DNqrXkv4artGiunDQW4quPEOFn2vlZhp38E3cZTVMLY9THSpZXsNLmqunbz5OZdg_7Der56C7e5xsyq2gYgx8QGnUYwEoRHBIs05xWmdpDkuJUoSEpU0pUmaUUxKUpGqiiop4rHE0fjEWcLJEtzNbXvbvQ_SedZ0gzXjRBaRcWOCEKUjFc-UsJ1zVtast6rl9pNhxKY82W-ebMqTFWzKc9SeZ61xnh_kSeLWK6HlPyn_a58oceSWSUO-ARxOhyo</recordid><startdate>20180901</startdate><enddate>20180901</enddate><creator>FUJITA, Takahiro</creator><creator>HATANO, Kohei</creator><creator>KIJIMA, Shuji</creator><creator>TAKIMOTO, Eiji</creator><general>The Institute of Electronics, Information and Communication Engineers</general><general>Japan Science and Technology Agency</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20180901</creationdate><title>Online Combinatorial Optimization with Multiple Projections and Its Application to Scheduling Problem</title><author>FUJITA, Takahiro ; HATANO, Kohei ; KIJIMA, Shuji ; TAKIMOTO, Eiji</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c413t-a6240c36231c79a617f5791be05532b676578613b3d3dd2dec4765a03d3185a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Algorithms</topic><topic>Combinatorial analysis</topic><topic>combinatorial optimization</topic><topic>Forecasting</topic><topic>online learning</topic><topic>Optimization</topic><topic>permutation</topic><topic>Precedence constraints</topic><topic>Production scheduling</topic><topic>Scheduling</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>FUJITA, Takahiro</creatorcontrib><creatorcontrib>HATANO, Kohei</creatorcontrib><creatorcontrib>KIJIMA, Shuji</creatorcontrib><creatorcontrib>TAKIMOTO, Eiji</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>FUJITA, Takahiro</au><au>HATANO, Kohei</au><au>KIJIMA, Shuji</au><au>TAKIMOTO, Eiji</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Online Combinatorial Optimization with Multiple Projections and Its Application to Scheduling Problem</atitle><jtitle>IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences</jtitle><addtitle>IEICE Trans. Fundamentals</addtitle><date>2018-09-01</date><risdate>2018</risdate><volume>E101.A</volume><issue>9</issue><spage>1334</spage><epage>1343</epage><pages>1334-1343</pages><issn>0916-8508</issn><eissn>1745-1337</eissn><abstract>We consider combinatorial online prediction problems and propose a new construction method of efficient algorithms for the problems. One of the previous approaches to the problem is to apply online prediction method, in which two external procedures the projection and the metarounding are assumed to be implemented. In this work, we generalize the projection to multiple projections. As an application of our framework, we show an algorithm for an online job scheduling problem with a single machine with precedence constraints.</abstract><cop>Tokyo</cop><pub>The Institute of Electronics, Information and Communication Engineers</pub><doi>10.1587/transfun.E101.A.1334</doi><tpages>10</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0916-8508 |
| ispartof | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2018/09/01, Vol.E101.A(9), pp.1334-1343 |
| issn | 0916-8508 1745-1337 |
| language | eng |
| recordid | cdi_proquest_journals_2301830066 |
| source | J-STAGE Free |
| subjects | Algorithms Combinatorial analysis combinatorial optimization Forecasting online learning Optimization permutation Precedence constraints Production scheduling Scheduling |
| title | Online Combinatorial Optimization with Multiple Projections and Its Application to Scheduling Problem |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-03T22%3A37%3A40IST&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=Online%20Combinatorial%20Optimization%20with%20Multiple%20Projections%20and%20Its%20Application%20to%20Scheduling%20Problem&rft.jtitle=IEICE%20Transactions%20on%20Fundamentals%20of%20Electronics,%20Communications%20and%20Computer%20Sciences&rft.au=FUJITA,%20Takahiro&rft.date=2018-09-01&rft.volume=E101.A&rft.issue=9&rft.spage=1334&rft.epage=1343&rft.pages=1334-1343&rft.issn=0916-8508&rft.eissn=1745-1337&rft_id=info:doi/10.1587/transfun.E101.A.1334&rft_dat=%3Cproquest_cross%3E2301830066%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=2301830066&rft_id=info:pmid/&rfr_iscdi=true |