Filtered beam search in scheduling

Beam search is a technique for searching decision trees, particularly where the solution space is vast. The technique involves systematically developing a small number of solutions in parallel so as to attempt to maximize the probability of finding a good solution with minimal search effort. In this...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	International journal of production research 1988-01, Vol.26 (1), p.35-62
Hauptverfasser:	OW, PENG SI, MORTON, THOMAS E.
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Exact sciences and technology Operational research and scientific management Operational research. Management science Scheduling, sequencing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	62
container_issue	1
container_start_page	35
container_title	International journal of production research
container_volume	26
creator	OW, PENG SI MORTON, THOMAS E.
description	Beam search is a technique for searching decision trees, particularly where the solution space is vast. The technique involves systematically developing a small number of solutions in parallel so as to attempt to maximize the probability of finding a good solution with minimal search effort. In this paper, we systematically study the performance behaviour of beam search with other heuristic methods for scheduling, and the effects of using different evaluation functions to guide the search. We also develop a new variation of beam search, called filtered beam search which is computationally simple yet produces high quality solutions.
doi_str_mv	10.1080/00207548808947840
format	Article
fullrecord	<record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_7794472</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>24880321</sourcerecordid><originalsourceid>FETCH-LOGICAL-c356t-ed78247342f45c294b0085bdeb5a61b2070d18b806434b6990d50450c98db2623</originalsourceid><addsrcrecordid>eNp1kE1Lw0AQhhdRsFZ_gLcg4i06-5XdgBcpVoWCFwVvYb9iVzZJ3U2R_nsTUr2Ic5nDPO_MOy9C5xiuMUi4ASAgOJMSZMmEZHCAZpgWRc6lfDtEs3GeDwA9RicpfcBQXLIZulj60LvobKadarLkVDTrzLdZMmtnt8G376foqFYhubN9n6PX5f3L4jFfPT88Le5WuaG86HNnhSRMUEZqxg0pmQaQXFunuSqwHuyBxVJLKBhluihLsBwYB1NKq0lB6BxdTXs3sfvcutRXjU_GhaBa121TRcbvKMEDiCfQxC6l6OpqE32j4q7CUI1pVH_SGDSX--UqGRXqqFrj069QiJIxMXq4nTDf1l1s1FcXg616tQtd_NHQ_698A4CEbn8</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>24880321</pqid></control><display><type>article</type><title>Filtered beam search in scheduling</title><source>Business Source Complete</source><source>Taylor & Francis:Master (3349 titles)</source><creator>OW, PENG SI ; MORTON, THOMAS E.</creator><creatorcontrib>OW, PENG SI ; MORTON, THOMAS E.</creatorcontrib><description>Beam search is a technique for searching decision trees, particularly where the solution space is vast. The technique involves systematically developing a small number of solutions in parallel so as to attempt to maximize the probability of finding a good solution with minimal search effort. In this paper, we systematically study the performance behaviour of beam search with other heuristic methods for scheduling, and the effects of using different evaluation functions to guide the search. We also develop a new variation of beam search, called filtered beam search which is computationally simple yet produces high quality solutions.</description><identifier>ISSN: 0020-7543</identifier><identifier>EISSN: 1366-588X</identifier><identifier>DOI: 10.1080/00207548808947840</identifier><identifier>CODEN: IJPRB8</identifier><language>eng</language><publisher>London: Taylor & Francis Group</publisher><subject>Applied sciences ; Exact sciences and technology ; Operational research and scientific management ; Operational research. Management science ; Scheduling, sequencing</subject><ispartof>International journal of production research, 1988-01, Vol.26 (1), p.35-62</ispartof><rights>Copyright Taylor & Francis Group, LLC 1988</rights><rights>1988 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c356t-ed78247342f45c294b0085bdeb5a61b2070d18b806434b6990d50450c98db2623</citedby><cites>FETCH-LOGICAL-c356t-ed78247342f45c294b0085bdeb5a61b2070d18b806434b6990d50450c98db2623</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.tandfonline.com/doi/pdf/10.1080/00207548808947840$$EPDF$$P50$$Ginformaworld$$H</linktopdf><linktohtml>$$Uhttps://www.tandfonline.com/doi/full/10.1080/00207548808947840$$EHTML$$P50$$Ginformaworld$$H</linktohtml><link.rule.ids>315,782,786,4026,27930,27931,27932,59654,60443</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=7794472$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>OW, PENG SI</creatorcontrib><creatorcontrib>MORTON, THOMAS E.</creatorcontrib><title>Filtered beam search in scheduling</title><title>International journal of production research</title><description>Beam search is a technique for searching decision trees, particularly where the solution space is vast. The technique involves systematically developing a small number of solutions in parallel so as to attempt to maximize the probability of finding a good solution with minimal search effort. In this paper, we systematically study the performance behaviour of beam search with other heuristic methods for scheduling, and the effects of using different evaluation functions to guide the search. We also develop a new variation of beam search, called filtered beam search which is computationally simple yet produces high quality solutions.</description><subject>Applied sciences</subject><subject>Exact sciences and technology</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Scheduling, sequencing</subject><issn>0020-7543</issn><issn>1366-588X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1988</creationdate><recordtype>article</recordtype><recordid>eNp1kE1Lw0AQhhdRsFZ_gLcg4i06-5XdgBcpVoWCFwVvYb9iVzZJ3U2R_nsTUr2Ic5nDPO_MOy9C5xiuMUi4ASAgOJMSZMmEZHCAZpgWRc6lfDtEs3GeDwA9RicpfcBQXLIZulj60LvobKadarLkVDTrzLdZMmtnt8G376foqFYhubN9n6PX5f3L4jFfPT88Le5WuaG86HNnhSRMUEZqxg0pmQaQXFunuSqwHuyBxVJLKBhluihLsBwYB1NKq0lB6BxdTXs3sfvcutRXjU_GhaBa121TRcbvKMEDiCfQxC6l6OpqE32j4q7CUI1pVH_SGDSX--UqGRXqqFrj069QiJIxMXq4nTDf1l1s1FcXg616tQtd_NHQ_698A4CEbn8</recordid><startdate>19880101</startdate><enddate>19880101</enddate><creator>OW, PENG SI</creator><creator>MORTON, THOMAS E.</creator><general>Taylor & Francis Group</general><general>Taylor & Francis</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>8FD</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>19880101</creationdate><title>Filtered beam search in scheduling</title><author>OW, PENG SI ; MORTON, THOMAS E.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c356t-ed78247342f45c294b0085bdeb5a61b2070d18b806434b6990d50450c98db2623</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1988</creationdate><topic>Applied sciences</topic><topic>Exact sciences and technology</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Scheduling, sequencing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>OW, PENG SI</creatorcontrib><creatorcontrib>MORTON, THOMAS E.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Technology Research Database</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>International journal of production research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>OW, PENG SI</au><au>MORTON, THOMAS E.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Filtered beam search in scheduling</atitle><jtitle>International journal of production research</jtitle><date>1988-01-01</date><risdate>1988</risdate><volume>26</volume><issue>1</issue><spage>35</spage><epage>62</epage><pages>35-62</pages><issn>0020-7543</issn><eissn>1366-588X</eissn><coden>IJPRB8</coden><abstract>Beam search is a technique for searching decision trees, particularly where the solution space is vast. The technique involves systematically developing a small number of solutions in parallel so as to attempt to maximize the probability of finding a good solution with minimal search effort. In this paper, we systematically study the performance behaviour of beam search with other heuristic methods for scheduling, and the effects of using different evaluation functions to guide the search. We also develop a new variation of beam search, called filtered beam search which is computationally simple yet produces high quality solutions.</abstract><cop>London</cop><cop>Washington, DC</cop><pub>Taylor & Francis Group</pub><doi>10.1080/00207548808947840</doi><tpages>28</tpages></addata></record>
fulltext	fulltext
identifier	ISSN: 0020-7543
ispartof	International journal of production research, 1988-01, Vol.26 (1), p.35-62
issn	0020-7543 1366-588X
language	eng
recordid	cdi_pascalfrancis_primary_7794472
source	Business Source Complete; Taylor & Francis:Master (3349 titles)
subjects	Applied sciences Exact sciences and technology Operational research and scientific management Operational research. Management science Scheduling, sequencing
title	Filtered beam search in 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-05T03%3A53%3A56IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Filtered%20beam%20search%20in%20scheduling&rft.jtitle=International%20journal%20of%20production%20research&rft.au=OW,%20PENG%20SI&rft.date=1988-01-01&rft.volume=26&rft.issue=1&rft.spage=35&rft.epage=62&rft.pages=35-62&rft.issn=0020-7543&rft.eissn=1366-588X&rft.coden=IJPRB8&rft_id=info:doi/10.1080/00207548808947840&rft_dat=%3Cproquest_pasca%3E24880321%3C/proquest_pasca%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=24880321&rft_id=info:pmid/&rfr_iscdi=true