Minimization of Job Waiting Time Variance on Identical Parallel Machines
We consider the problem of scheduling independent jobs on identical parallel machines so as to minimize the waiting time variance of the jobs ( Pm // WTV ). We show that the optimal value of( Pm // WTV ) is identical to the optimal value of the problem for minimizing the completion time variance of...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on human-machine systems 2007-09, Vol.37 (5), p.917-927 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 927 |
|---|---|
| container_issue | 5 |
| container_start_page | 917 |
| container_title | IEEE transactions on human-machine systems |
| container_volume | 37 |
| creator | Xu, Xiaoyun Ye, Nong |
| description | We consider the problem of scheduling independent jobs on identical parallel machines so as to minimize the waiting time variance of the jobs ( Pm // WTV ). We show that the optimal value of( Pm // WTV ) is identical to the optimal value of the problem for minimizing the completion time variance of jobs on identical parallel machines( Pm // WTV ). We prove that, given the same job set, any feasible schedule of ( Pm // WTV ) can be transformed into the feasible solution for ( Pm // WTV ) with the same job set by applying the polynomial algorithms proposed in this paper. Several other important properties of ( Pm // WTV ) are also proved. Heuristic algorithms are proposed to solve ( Pm // WTV ) problems. We present the testing results of these heuristic algorithms, which are applied to problems with both small and large job sets. |
| doi_str_mv | 10.1109/TSMCC.2007.900657 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_TSMCC_2007_900657</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4292268</ieee_id><sourcerecordid>2335188691</sourcerecordid><originalsourceid>FETCH-LOGICAL-c355t-a5e292a348a336a5d57f59f95cdea2bb61423c67ef39feb3c19dd9027e1403d73</originalsourceid><addsrcrecordid>eNpdkE1Lw0AQhoMoWKs_QLwEQfCSup_Z7FGK2kqLglWPy3Qz0S1pUnfTg_56t7YoeJqBed6X4UmSU0oGlBJ9NXuaDocDRogaaEJyqfaSHpWyyJgQbD_uRIss10odJkchLAihQmjeS0ZT17il-4LOtU3aVul9O09fwXWueUtnbonpC3gHjcU03sclNp2zUKeP4KGusU6nYN9dg-E4OaigDniym_3k-fZmNhxlk4e78fB6klkuZZeBRKYZcFEA5znIUqpK6kpLWyKw-TyngnGbK6y4rnDOLdVlqQlTSAXhpeL95HLbu_LtxxpDZ5YuWKxraLBdB0NzRTnnQm3Q83_ool37Jn5nilywQnDNIkS3kPVtCB4rs_JuCf7TUGI2as2PWrNRa7ZqY-ZiVwwhyqh89OPCX1ATqqmkkTvbcg4Rf88iCmB5wb8BntSAjA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>864284392</pqid></control><display><type>article</type><title>Minimization of Job Waiting Time Variance on Identical Parallel Machines</title><source>IEEE Electronic Library (IEL)</source><creator>Xu, Xiaoyun ; Ye, Nong</creator><creatorcontrib>Xu, Xiaoyun ; Ye, Nong</creatorcontrib><description>We consider the problem of scheduling independent jobs on identical parallel machines so as to minimize the waiting time variance of the jobs ( Pm // WTV ). We show that the optimal value of( Pm // WTV ) is identical to the optimal value of the problem for minimizing the completion time variance of jobs on identical parallel machines( Pm // WTV ). We prove that, given the same job set, any feasible schedule of ( Pm // WTV ) can be transformed into the feasible solution for ( Pm // WTV ) with the same job set by applying the polynomial algorithms proposed in this paper. Several other important properties of ( Pm // WTV ) are also proved. Heuristic algorithms are proposed to solve ( Pm // WTV ) problems. We present the testing results of these heuristic algorithms, which are applied to problems with both small and large job sets.</description><identifier>ISSN: 1094-6977</identifier><identifier>ISSN: 2168-2291</identifier><identifier>EISSN: 1558-2442</identifier><identifier>EISSN: 2168-2305</identifier><identifier>DOI: 10.1109/TSMCC.2007.900657</identifier><identifier>CODEN: ITCRFH</identifier><language>eng</language><publisher>New-York, NY: IEEE</publisher><subject>Algorithms ; Applied sciences ; Completion time ; Cybernetics ; Exact sciences and technology ; Government ; Heuristic algorithms ; Heuristic methods ; Identical parallel machine ; job scheduling ; Operational research and scientific management ; Operational research. Management science ; Optimal scheduling ; Optimization ; Parallel machines ; Polynomials ; Protection ; Schedules ; Scheduling ; Scheduling algorithm ; Scheduling, sequencing ; Testing ; Variance ; waiting time variance (WTV)</subject><ispartof>IEEE transactions on human-machine systems, 2007-09, Vol.37 (5), p.917-927</ispartof><rights>2007 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2007</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c355t-a5e292a348a336a5d57f59f95cdea2bb61423c67ef39feb3c19dd9027e1403d73</citedby><cites>FETCH-LOGICAL-c355t-a5e292a348a336a5d57f59f95cdea2bb61423c67ef39feb3c19dd9027e1403d73</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4292268$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4292268$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19019151$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Xu, Xiaoyun</creatorcontrib><creatorcontrib>Ye, Nong</creatorcontrib><title>Minimization of Job Waiting Time Variance on Identical Parallel Machines</title><title>IEEE transactions on human-machine systems</title><addtitle>TSMCC</addtitle><description>We consider the problem of scheduling independent jobs on identical parallel machines so as to minimize the waiting time variance of the jobs ( Pm // WTV ). We show that the optimal value of( Pm // WTV ) is identical to the optimal value of the problem for minimizing the completion time variance of jobs on identical parallel machines( Pm // WTV ). We prove that, given the same job set, any feasible schedule of ( Pm // WTV ) can be transformed into the feasible solution for ( Pm // WTV ) with the same job set by applying the polynomial algorithms proposed in this paper. Several other important properties of ( Pm // WTV ) are also proved. Heuristic algorithms are proposed to solve ( Pm // WTV ) problems. We present the testing results of these heuristic algorithms, which are applied to problems with both small and large job sets.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Completion time</subject><subject>Cybernetics</subject><subject>Exact sciences and technology</subject><subject>Government</subject><subject>Heuristic algorithms</subject><subject>Heuristic methods</subject><subject>Identical parallel machine</subject><subject>job scheduling</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Optimal scheduling</subject><subject>Optimization</subject><subject>Parallel machines</subject><subject>Polynomials</subject><subject>Protection</subject><subject>Schedules</subject><subject>Scheduling</subject><subject>Scheduling algorithm</subject><subject>Scheduling, sequencing</subject><subject>Testing</subject><subject>Variance</subject><subject>waiting time variance (WTV)</subject><issn>1094-6977</issn><issn>2168-2291</issn><issn>1558-2442</issn><issn>2168-2305</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpdkE1Lw0AQhoMoWKs_QLwEQfCSup_Z7FGK2kqLglWPy3Qz0S1pUnfTg_56t7YoeJqBed6X4UmSU0oGlBJ9NXuaDocDRogaaEJyqfaSHpWyyJgQbD_uRIss10odJkchLAihQmjeS0ZT17il-4LOtU3aVul9O09fwXWueUtnbonpC3gHjcU03sclNp2zUKeP4KGusU6nYN9dg-E4OaigDniym_3k-fZmNhxlk4e78fB6klkuZZeBRKYZcFEA5znIUqpK6kpLWyKw-TyngnGbK6y4rnDOLdVlqQlTSAXhpeL95HLbu_LtxxpDZ5YuWKxraLBdB0NzRTnnQm3Q83_ool37Jn5nilywQnDNIkS3kPVtCB4rs_JuCf7TUGI2as2PWrNRa7ZqY-ZiVwwhyqh89OPCX1ATqqmkkTvbcg4Rf88iCmB5wb8BntSAjA</recordid><startdate>20070901</startdate><enddate>20070901</enddate><creator>Xu, Xiaoyun</creator><creator>Ye, Nong</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope></search><sort><creationdate>20070901</creationdate><title>Minimization of Job Waiting Time Variance on Identical Parallel Machines</title><author>Xu, Xiaoyun ; Ye, Nong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c355t-a5e292a348a336a5d57f59f95cdea2bb61423c67ef39feb3c19dd9027e1403d73</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Completion time</topic><topic>Cybernetics</topic><topic>Exact sciences and technology</topic><topic>Government</topic><topic>Heuristic algorithms</topic><topic>Heuristic methods</topic><topic>Identical parallel machine</topic><topic>job scheduling</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Optimal scheduling</topic><topic>Optimization</topic><topic>Parallel machines</topic><topic>Polynomials</topic><topic>Protection</topic><topic>Schedules</topic><topic>Scheduling</topic><topic>Scheduling algorithm</topic><topic>Scheduling, sequencing</topic><topic>Testing</topic><topic>Variance</topic><topic>waiting time variance (WTV)</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Xu, Xiaoyun</creatorcontrib><creatorcontrib>Ye, Nong</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering 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><collection>ANTE: Abstracts in New Technology & Engineering</collection><jtitle>IEEE transactions on human-machine systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Xu, Xiaoyun</au><au>Ye, Nong</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Minimization of Job Waiting Time Variance on Identical Parallel Machines</atitle><jtitle>IEEE transactions on human-machine systems</jtitle><stitle>TSMCC</stitle><date>2007-09-01</date><risdate>2007</risdate><volume>37</volume><issue>5</issue><spage>917</spage><epage>927</epage><pages>917-927</pages><issn>1094-6977</issn><issn>2168-2291</issn><eissn>1558-2442</eissn><eissn>2168-2305</eissn><coden>ITCRFH</coden><abstract>We consider the problem of scheduling independent jobs on identical parallel machines so as to minimize the waiting time variance of the jobs ( Pm // WTV ). We show that the optimal value of( Pm // WTV ) is identical to the optimal value of the problem for minimizing the completion time variance of jobs on identical parallel machines( Pm // WTV ). We prove that, given the same job set, any feasible schedule of ( Pm // WTV ) can be transformed into the feasible solution for ( Pm // WTV ) with the same job set by applying the polynomial algorithms proposed in this paper. Several other important properties of ( Pm // WTV ) are also proved. Heuristic algorithms are proposed to solve ( Pm // WTV ) problems. We present the testing results of these heuristic algorithms, which are applied to problems with both small and large job sets.</abstract><cop>New-York, NY</cop><pub>IEEE</pub><doi>10.1109/TSMCC.2007.900657</doi><tpages>11</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1094-6977 |
| ispartof | IEEE transactions on human-machine systems, 2007-09, Vol.37 (5), p.917-927 |
| issn | 1094-6977 2168-2291 1558-2442 2168-2305 |
| language | eng |
| recordid | cdi_crossref_primary_10_1109_TSMCC_2007_900657 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algorithms Applied sciences Completion time Cybernetics Exact sciences and technology Government Heuristic algorithms Heuristic methods Identical parallel machine job scheduling Operational research and scientific management Operational research. Management science Optimal scheduling Optimization Parallel machines Polynomials Protection Schedules Scheduling Scheduling algorithm Scheduling, sequencing Testing Variance waiting time variance (WTV) |
| title | Minimization of Job Waiting Time Variance on Identical Parallel Machines |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-09T00%3A17%3A04IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Minimization%20of%20Job%20Waiting%20Time%20Variance%20on%20Identical%20Parallel%20Machines&rft.jtitle=IEEE%20transactions%20on%20human-machine%20systems&rft.au=Xu,%20Xiaoyun&rft.date=2007-09-01&rft.volume=37&rft.issue=5&rft.spage=917&rft.epage=927&rft.pages=917-927&rft.issn=1094-6977&rft.eissn=1558-2442&rft.coden=ITCRFH&rft_id=info:doi/10.1109/TSMCC.2007.900657&rft_dat=%3Cproquest_RIE%3E2335188691%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=864284392&rft_id=info:pmid/&rft_ieee_id=4292268&rfr_iscdi=true |