Performance Guarantees of Local Search for Multiprocessor Scheduling
Increasing interest has recently been shown in analyzing the worst-case behavior of local search algorithms. In particular, the quality of local optima and the time needed to find the local optima by the simplest form of local search has been studied. This paper deals with worst-case performance of...
Gespeichert in:
| Veröffentlicht in: | INFORMS journal on computing 2007-12, Vol.19 (1), p.52-63 |
|---|---|
| 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 | 63 |
|---|---|
| container_issue | 1 |
| container_start_page | 52 |
| container_title | INFORMS journal on computing |
| container_volume | 19 |
| creator | Schuurman, Petra Vredeveld, Tjark |
| description | Increasing interest has recently been shown in analyzing the worst-case behavior of local search algorithms. In particular, the quality of local optima and the time needed to find the local optima by the simplest form of local search has been studied. This paper deals with worst-case performance of local search algorithms for makespan minimization on parallel machines. We analyze the quality of the local optima obtained by iterative improvement over the jump, swap, multi-exchange, and the newly defined push neighborhoods. Finally, for the jump neighborhood we provide bounds on the number of local search steps required to find a local optimum. |
| doi_str_mv | 10.1287/ijoc.1050.0152 |
| format | Article |
| fullrecord | <record><control><sourceid>gale_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1287_ijoc_1050_0152</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A161676192</galeid><sourcerecordid>A161676192</sourcerecordid><originalsourceid>FETCH-LOGICAL-c477t-df52b8876f7f737dc6bbd5f1a915331ccb4b9dd5a429d72bbfea3c8de71cf9923</originalsourceid><addsrcrecordid>eNqFkVFLwzAUhYsoOKevPhd97kzapmkex9QpTBSmzyFNbraMtplJi_jvTbeBCKIEbnLDd09OOFF0idEEpyW9MRsrJxgRNEGYpEfRKNQiISQtj8MZMZywkhSn0Zn3G4RQnuVsFN2-gNPWNaKVEM974UTbAfjY6nhhpajjJQgn13Fg4qe-7szWWQneh3Yp16D62rSr8-hEi9rDxWEfR2_3d6-zh2TxPH-cTReJzCntEqVJWpUlLTTVNKNKFlWliMaCYZJlWMoqr5hSROQpUzStKg0ik6UCiqVmLM3G0dVeN5h478F3fGN714YneYoQyWiZD9D1HlqJGrhpte2ckI3xkk9xgQta4J1U8gu1ghacqG0L2oTrH_zkFz4sBY2Rfw1IZ713oPnWmUa4T44RH_LiQ158yIsPeX07GsRd4__nD_9cm9X6w7i9q2FwxzGOeaC-AOcxous</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>200537842</pqid></control><display><type>article</type><title>Performance Guarantees of Local Search for Multiprocessor Scheduling</title><source>Informs</source><source>EBSCOhost Business Source Complete</source><creator>Schuurman, Petra ; Vredeveld, Tjark</creator><creatorcontrib>Schuurman, Petra ; Vredeveld, Tjark</creatorcontrib><description>Increasing interest has recently been shown in analyzing the worst-case behavior of local search algorithms. In particular, the quality of local optima and the time needed to find the local optima by the simplest form of local search has been studied. This paper deals with worst-case performance of local search algorithms for makespan minimization on parallel machines. We analyze the quality of the local optima obtained by iterative improvement over the jump, swap, multi-exchange, and the newly defined push neighborhoods. Finally, for the jump neighborhood we provide bounds on the number of local search steps required to find a local optimum.</description><identifier>ISSN: 1091-9856</identifier><identifier>EISSN: 1526-5528</identifier><identifier>EISSN: 1091-9856</identifier><identifier>DOI: 10.1287/ijoc.1050.0152</identifier><language>eng</language><publisher>Linthicum: INFORMS</publisher><subject>Algorithms ; Analysis ; analysis of algorithms ; Approximation ; approximation heuristics ; Heuristic programming ; local search ; multiple machine ; Optimization ; Production scheduling ; Scheduling (Management) ; Scheduling algorithms ; Studies</subject><ispartof>INFORMS journal on computing, 2007-12, Vol.19 (1), p.52-63</ispartof><rights>COPYRIGHT 2007 Institute for Operations Research and the Management Sciences</rights><rights>Copyright Institute for Operations Research and the Management Sciences Winter 2007</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c477t-df52b8876f7f737dc6bbd5f1a915331ccb4b9dd5a429d72bbfea3c8de71cf9923</citedby><cites>FETCH-LOGICAL-c477t-df52b8876f7f737dc6bbd5f1a915331ccb4b9dd5a429d72bbfea3c8de71cf9923</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://pubsonline.informs.org/doi/full/10.1287/ijoc.1050.0152$$EHTML$$P50$$Ginforms$$H</linktohtml><link.rule.ids>314,780,784,3692,27924,27925,62616</link.rule.ids></links><search><creatorcontrib>Schuurman, Petra</creatorcontrib><creatorcontrib>Vredeveld, Tjark</creatorcontrib><title>Performance Guarantees of Local Search for Multiprocessor Scheduling</title><title>INFORMS journal on computing</title><description>Increasing interest has recently been shown in analyzing the worst-case behavior of local search algorithms. In particular, the quality of local optima and the time needed to find the local optima by the simplest form of local search has been studied. This paper deals with worst-case performance of local search algorithms for makespan minimization on parallel machines. We analyze the quality of the local optima obtained by iterative improvement over the jump, swap, multi-exchange, and the newly defined push neighborhoods. Finally, for the jump neighborhood we provide bounds on the number of local search steps required to find a local optimum.</description><subject>Algorithms</subject><subject>Analysis</subject><subject>analysis of algorithms</subject><subject>Approximation</subject><subject>approximation heuristics</subject><subject>Heuristic programming</subject><subject>local search</subject><subject>multiple machine</subject><subject>Optimization</subject><subject>Production scheduling</subject><subject>Scheduling (Management)</subject><subject>Scheduling algorithms</subject><subject>Studies</subject><issn>1091-9856</issn><issn>1526-5528</issn><issn>1091-9856</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</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>eNqFkVFLwzAUhYsoOKevPhd97kzapmkex9QpTBSmzyFNbraMtplJi_jvTbeBCKIEbnLDd09OOFF0idEEpyW9MRsrJxgRNEGYpEfRKNQiISQtj8MZMZywkhSn0Zn3G4RQnuVsFN2-gNPWNaKVEM974UTbAfjY6nhhpajjJQgn13Fg4qe-7szWWQneh3Yp16D62rSr8-hEi9rDxWEfR2_3d6-zh2TxPH-cTReJzCntEqVJWpUlLTTVNKNKFlWliMaCYZJlWMoqr5hSROQpUzStKg0ik6UCiqVmLM3G0dVeN5h478F3fGN714YneYoQyWiZD9D1HlqJGrhpte2ckI3xkk9xgQta4J1U8gu1ghacqG0L2oTrH_zkFz4sBY2Rfw1IZ713oPnWmUa4T44RH_LiQ158yIsPeX07GsRd4__nD_9cm9X6w7i9q2FwxzGOeaC-AOcxous</recordid><startdate>20071222</startdate><enddate>20071222</enddate><creator>Schuurman, Petra</creator><creator>Vredeveld, Tjark</creator><general>INFORMS</general><general>Institute for Operations Research and the Management Sciences</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</scope><scope>8AO</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</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>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>L.-</scope><scope>M0C</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PYYUZ</scope><scope>Q9U</scope></search><sort><creationdate>20071222</creationdate><title>Performance Guarantees of Local Search for Multiprocessor Scheduling</title><author>Schuurman, Petra ; Vredeveld, Tjark</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c477t-df52b8876f7f737dc6bbd5f1a915331ccb4b9dd5a429d72bbfea3c8de71cf9923</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Algorithms</topic><topic>Analysis</topic><topic>analysis of algorithms</topic><topic>Approximation</topic><topic>approximation heuristics</topic><topic>Heuristic programming</topic><topic>local search</topic><topic>multiple machine</topic><topic>Optimization</topic><topic>Production scheduling</topic><topic>Scheduling (Management)</topic><topic>Scheduling algorithms</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Schuurman, Petra</creatorcontrib><creatorcontrib>Vredeveld, Tjark</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Access via ABI/INFORM (ProQuest)</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</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>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>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>ABI/INFORM Professional Advanced</collection><collection>ABI/INFORM Global</collection><collection>Computing 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>ABI/INFORM Collection China</collection><collection>ProQuest Central Basic</collection><jtitle>INFORMS journal on computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Schuurman, Petra</au><au>Vredeveld, Tjark</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Performance Guarantees of Local Search for Multiprocessor Scheduling</atitle><jtitle>INFORMS journal on computing</jtitle><date>2007-12-22</date><risdate>2007</risdate><volume>19</volume><issue>1</issue><spage>52</spage><epage>63</epage><pages>52-63</pages><issn>1091-9856</issn><eissn>1526-5528</eissn><eissn>1091-9856</eissn><abstract>Increasing interest has recently been shown in analyzing the worst-case behavior of local search algorithms. In particular, the quality of local optima and the time needed to find the local optima by the simplest form of local search has been studied. This paper deals with worst-case performance of local search algorithms for makespan minimization on parallel machines. We analyze the quality of the local optima obtained by iterative improvement over the jump, swap, multi-exchange, and the newly defined push neighborhoods. Finally, for the jump neighborhood we provide bounds on the number of local search steps required to find a local optimum.</abstract><cop>Linthicum</cop><pub>INFORMS</pub><doi>10.1287/ijoc.1050.0152</doi><tpages>12</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1091-9856 |
| ispartof | INFORMS journal on computing, 2007-12, Vol.19 (1), p.52-63 |
| issn | 1091-9856 1526-5528 1091-9856 |
| language | eng |
| recordid | cdi_crossref_primary_10_1287_ijoc_1050_0152 |
| source | Informs; EBSCOhost Business Source Complete |
| subjects | Algorithms Analysis analysis of algorithms Approximation approximation heuristics Heuristic programming local search multiple machine Optimization Production scheduling Scheduling (Management) Scheduling algorithms Studies |
| title | Performance Guarantees of Local Search for Multiprocessor Scheduling |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-20T07%3A53%3A16IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Performance%20Guarantees%20of%20Local%20Search%20for%20Multiprocessor%20Scheduling&rft.jtitle=INFORMS%20journal%20on%20computing&rft.au=Schuurman,%20Petra&rft.date=2007-12-22&rft.volume=19&rft.issue=1&rft.spage=52&rft.epage=63&rft.pages=52-63&rft.issn=1091-9856&rft.eissn=1526-5528&rft_id=info:doi/10.1287/ijoc.1050.0152&rft_dat=%3Cgale_cross%3EA161676192%3C/gale_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=200537842&rft_id=info:pmid/&rft_galeid=A161676192&rfr_iscdi=true |