An Agent-based Scheduling Method Enabling Rescheduling with Trial-and-Error Approach
Scheduling optimization is known as an extremely difficult problem; therefore, many scheduling methods such as linear programming methods or stochastic searching algorithms have been researched to get a better solution closest to the optimum one. After obtaining a certain solution, scheduling manage...
Gespeichert in:
Veröffentlicht in: | Denki Gakkai ronbunshi. C, Erekutoronikusu, joho kogaku, shisutemu Erekutoronikusu, joho kogaku, shisutemu, 2005-11, Vol.125 (11), p.1674-1683 |
---|---|
Hauptverfasser: | , , , , |
Format: | Artikel |
Sprache: | eng |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 1683 |
---|---|
container_issue | 11 |
container_start_page | 1674 |
container_title | Denki Gakkai ronbunshi. C, Erekutoronikusu, joho kogaku, shisutemu |
container_volume | 125 |
creator | Mitsui, Hiroyasu Sugihara, Hiroaki Koizumi, Hisao Sawamoto, Jun Tsuji, Hidekazu |
description | Scheduling optimization is known as an extremely difficult problem; therefore, many scheduling methods such as linear programming methods or stochastic searching algorithms have been researched to get a better solution closest to the optimum one. After obtaining a certain solution, scheduling managers might have to reschedule another solution that corresponds to changes in requirements or resources. However, rescheduling problems become more difficult as they become larger in their scale. In this paper, we propose an agent-based rescheduling system using linear programming approach. In our system, agents can autonomously conduct rescheduling on behalf of managers by repeating trial-and-error in balancing load or changing priority of resource allocation until it can reach a better solution for the requirement. In addition, managers can make trial-and-error with the help of agents to search another better solution by changing constraint conditions. |
doi_str_mv | 10.1541/ieejeiss.125.1674 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_1433888495</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3076357261</sourcerecordid><originalsourceid>FETCH-LOGICAL-c1134-de0d52d0b6dc3901b7102e7852c9d077470c70636403002b464bb7e2982954b53</originalsourceid><addsrcrecordid>eNpFkN1LwzAUxYMoOKd_gG8FnzPvzUeTPpYxP2Ai6HwOSZOtHbOdSYv439s5xafL4R7OOfwIuUaYoRR424SwDU1KM2RyhrkSJ2SCXGiqUcpTMgGuJRWM4Tm5SGkLwLkUYkJWZZuVm9D21NkUfPZa1cEPu6bdZE-hrzufLVrrfvRLSP_Pz6avs1Vs7I7a1tNFjF3Myv0-draqL8nZ2u5SuPq9U_J2t1jNH-jy-f5xXi5pheM26gN4yTy43Fe8AHQKgQWlJasKD0oJBZWCnOcCOABzIhfOqcAKzQopnORTcnPMHWs_hpB6s-2G2I6VBgXnWmtRHFx4dFWxSymGtdnH5t3GL4NgDvDMHzwzwjMHePwbbNNiiw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1433888495</pqid></control><display><type>article</type><title>An Agent-based Scheduling Method Enabling Rescheduling with Trial-and-Error Approach</title><source>EZB-FREE-00999 freely available EZB journals</source><creator>Mitsui, Hiroyasu ; Sugihara, Hiroaki ; Koizumi, Hisao ; Sawamoto, Jun ; Tsuji, Hidekazu</creator><creatorcontrib>Mitsui, Hiroyasu ; Sugihara, Hiroaki ; Koizumi, Hisao ; Sawamoto, Jun ; Tsuji, Hidekazu</creatorcontrib><description>Scheduling optimization is known as an extremely difficult problem; therefore, many scheduling methods such as linear programming methods or stochastic searching algorithms have been researched to get a better solution closest to the optimum one. After obtaining a certain solution, scheduling managers might have to reschedule another solution that corresponds to changes in requirements or resources. However, rescheduling problems become more difficult as they become larger in their scale. In this paper, we propose an agent-based rescheduling system using linear programming approach. In our system, agents can autonomously conduct rescheduling on behalf of managers by repeating trial-and-error in balancing load or changing priority of resource allocation until it can reach a better solution for the requirement. In addition, managers can make trial-and-error with the help of agents to search another better solution by changing constraint conditions.</description><identifier>ISSN: 0385-4221</identifier><identifier>EISSN: 1348-8155</identifier><identifier>DOI: 10.1541/ieejeiss.125.1674</identifier><language>eng</language><publisher>Tokyo: Japan Science and Technology Agency</publisher><ispartof>Denki Gakkai ronbunshi. C, Erekutoronikusu, joho kogaku, shisutemu, 2005-11, Vol.125 (11), p.1674-1683</ispartof><rights>Copyright Japan Science and Technology Agency 2005</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c1134-de0d52d0b6dc3901b7102e7852c9d077470c70636403002b464bb7e2982954b53</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Mitsui, Hiroyasu</creatorcontrib><creatorcontrib>Sugihara, Hiroaki</creatorcontrib><creatorcontrib>Koizumi, Hisao</creatorcontrib><creatorcontrib>Sawamoto, Jun</creatorcontrib><creatorcontrib>Tsuji, Hidekazu</creatorcontrib><title>An Agent-based Scheduling Method Enabling Rescheduling with Trial-and-Error Approach</title><title>Denki Gakkai ronbunshi. C, Erekutoronikusu, joho kogaku, shisutemu</title><description>Scheduling optimization is known as an extremely difficult problem; therefore, many scheduling methods such as linear programming methods or stochastic searching algorithms have been researched to get a better solution closest to the optimum one. After obtaining a certain solution, scheduling managers might have to reschedule another solution that corresponds to changes in requirements or resources. However, rescheduling problems become more difficult as they become larger in their scale. In this paper, we propose an agent-based rescheduling system using linear programming approach. In our system, agents can autonomously conduct rescheduling on behalf of managers by repeating trial-and-error in balancing load or changing priority of resource allocation until it can reach a better solution for the requirement. In addition, managers can make trial-and-error with the help of agents to search another better solution by changing constraint conditions.</description><issn>0385-4221</issn><issn>1348-8155</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2005</creationdate><recordtype>article</recordtype><recordid>eNpFkN1LwzAUxYMoOKd_gG8FnzPvzUeTPpYxP2Ai6HwOSZOtHbOdSYv439s5xafL4R7OOfwIuUaYoRR424SwDU1KM2RyhrkSJ2SCXGiqUcpTMgGuJRWM4Tm5SGkLwLkUYkJWZZuVm9D21NkUfPZa1cEPu6bdZE-hrzufLVrrfvRLSP_Pz6avs1Vs7I7a1tNFjF3Myv0-draqL8nZ2u5SuPq9U_J2t1jNH-jy-f5xXi5pheM26gN4yTy43Fe8AHQKgQWlJasKD0oJBZWCnOcCOABzIhfOqcAKzQopnORTcnPMHWs_hpB6s-2G2I6VBgXnWmtRHFx4dFWxSymGtdnH5t3GL4NgDvDMHzwzwjMHePwbbNNiiw</recordid><startdate>20051101</startdate><enddate>20051101</enddate><creator>Mitsui, Hiroyasu</creator><creator>Sugihara, Hiroaki</creator><creator>Koizumi, Hisao</creator><creator>Sawamoto, Jun</creator><creator>Tsuji, Hidekazu</creator><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>20051101</creationdate><title>An Agent-based Scheduling Method Enabling Rescheduling with Trial-and-Error Approach</title><author>Mitsui, Hiroyasu ; Sugihara, Hiroaki ; Koizumi, Hisao ; Sawamoto, Jun ; Tsuji, Hidekazu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c1134-de0d52d0b6dc3901b7102e7852c9d077470c70636403002b464bb7e2982954b53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2005</creationdate><toplevel>online_resources</toplevel><creatorcontrib>Mitsui, Hiroyasu</creatorcontrib><creatorcontrib>Sugihara, Hiroaki</creatorcontrib><creatorcontrib>Koizumi, Hisao</creatorcontrib><creatorcontrib>Sawamoto, Jun</creatorcontrib><creatorcontrib>Tsuji, Hidekazu</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>Denki Gakkai ronbunshi. C, Erekutoronikusu, joho kogaku, shisutemu</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Mitsui, Hiroyasu</au><au>Sugihara, Hiroaki</au><au>Koizumi, Hisao</au><au>Sawamoto, Jun</au><au>Tsuji, Hidekazu</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An Agent-based Scheduling Method Enabling Rescheduling with Trial-and-Error Approach</atitle><jtitle>Denki Gakkai ronbunshi. C, Erekutoronikusu, joho kogaku, shisutemu</jtitle><date>2005-11-01</date><risdate>2005</risdate><volume>125</volume><issue>11</issue><spage>1674</spage><epage>1683</epage><pages>1674-1683</pages><issn>0385-4221</issn><eissn>1348-8155</eissn><abstract>Scheduling optimization is known as an extremely difficult problem; therefore, many scheduling methods such as linear programming methods or stochastic searching algorithms have been researched to get a better solution closest to the optimum one. After obtaining a certain solution, scheduling managers might have to reschedule another solution that corresponds to changes in requirements or resources. However, rescheduling problems become more difficult as they become larger in their scale. In this paper, we propose an agent-based rescheduling system using linear programming approach. In our system, agents can autonomously conduct rescheduling on behalf of managers by repeating trial-and-error in balancing load or changing priority of resource allocation until it can reach a better solution for the requirement. In addition, managers can make trial-and-error with the help of agents to search another better solution by changing constraint conditions.</abstract><cop>Tokyo</cop><pub>Japan Science and Technology Agency</pub><doi>10.1541/ieejeiss.125.1674</doi><tpages>10</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0385-4221 |
ispartof | Denki Gakkai ronbunshi. C, Erekutoronikusu, joho kogaku, shisutemu, 2005-11, Vol.125 (11), p.1674-1683 |
issn | 0385-4221 1348-8155 |
language | eng |
recordid | cdi_proquest_journals_1433888495 |
source | EZB-FREE-00999 freely available EZB journals |
title | An Agent-based Scheduling Method Enabling Rescheduling with Trial-and-Error Approach |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-30T21%3A43%3A56IST&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=An%20Agent-based%20Scheduling%20Method%20Enabling%20Rescheduling%20with%20Trial-and-Error%20Approach&rft.jtitle=Denki%20Gakkai%20ronbunshi.%20C,%20Erekutoronikusu,%20joho%20kogaku,%20shisutemu&rft.au=Mitsui,%20Hiroyasu&rft.date=2005-11-01&rft.volume=125&rft.issue=11&rft.spage=1674&rft.epage=1683&rft.pages=1674-1683&rft.issn=0385-4221&rft.eissn=1348-8155&rft_id=info:doi/10.1541/ieejeiss.125.1674&rft_dat=%3Cproquest_cross%3E3076357261%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=1433888495&rft_id=info:pmid/&rfr_iscdi=true |