ORDER QUEUE OPTIMIZATION
When a new order is received and is to be inserted into an unprepared order queue for order preparation. The new order's items and items' ingredients are obtained along with expected preparation/cook time for each ingredient. Items and ingredients for the orders that are already in the que...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Patent |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Morgan, Kip Oliver DeBardlebon, Zachary Christopher Lasater, Zachary Taylor |
| description | When a new order is received and is to be inserted into an unprepared order queue for order preparation. The new order's items and items' ingredients are obtained along with expected preparation/cook time for each ingredient. Items and ingredients for the orders that are already in the queue are also inspected along with the times that each order was placed in the queue. A machine-learning model is processed with the data associated with the orders and the new order. The model returns an optimized rearrangement of the queue with the new order inserted into the queue that levels out the expected order wait times, reduces variations in order wait times, and minimizes order preparation times based on the rearranged/modified queue. The optimized queue is presented on a display associated with staff responsible for preparing the orders of the queue. |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2023031816A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2023031816A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2023031816A13</originalsourceid><addsrcrecordid>eNrjZJDwD3JxDVIIDHUNdVXwDwjx9PWMcgzx9PfjYWBNS8wpTuWF0twMym6uIc4euqkF-fGpxQWJyal5qSXxocFGBkbGBsaGFoZmjobGxKkCAIa6IM8</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>ORDER QUEUE OPTIMIZATION</title><source>esp@cenet</source><creator>Morgan, Kip Oliver ; DeBardlebon, Zachary Christopher ; Lasater, Zachary Taylor</creator><creatorcontrib>Morgan, Kip Oliver ; DeBardlebon, Zachary Christopher ; Lasater, Zachary Taylor</creatorcontrib><description>When a new order is received and is to be inserted into an unprepared order queue for order preparation. The new order's items and items' ingredients are obtained along with expected preparation/cook time for each ingredient. Items and ingredients for the orders that are already in the queue are also inspected along with the times that each order was placed in the queue. A machine-learning model is processed with the data associated with the orders and the new order. The model returns an optimized rearrangement of the queue with the new order inserted into the queue that levels out the expected order wait times, reduces variations in order wait times, and minimizes order preparation times based on the rearranged/modified queue. The optimized queue is presented on a display associated with staff responsible for preparing the orders of the queue.</description><language>eng</language><subject>CALCULATING ; COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS ; COMPUTING ; COUNTING ; DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS ; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR</subject><creationdate>2023</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20230202&DB=EPODOC&CC=US&NR=2023031816A1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25563,76318</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20230202&DB=EPODOC&CC=US&NR=2023031816A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Morgan, Kip Oliver</creatorcontrib><creatorcontrib>DeBardlebon, Zachary Christopher</creatorcontrib><creatorcontrib>Lasater, Zachary Taylor</creatorcontrib><title>ORDER QUEUE OPTIMIZATION</title><description>When a new order is received and is to be inserted into an unprepared order queue for order preparation. The new order's items and items' ingredients are obtained along with expected preparation/cook time for each ingredient. Items and ingredients for the orders that are already in the queue are also inspected along with the times that each order was placed in the queue. A machine-learning model is processed with the data associated with the orders and the new order. The model returns an optimized rearrangement of the queue with the new order inserted into the queue that levels out the expected order wait times, reduces variations in order wait times, and minimizes order preparation times based on the rearranged/modified queue. The optimized queue is presented on a display associated with staff responsible for preparing the orders of the queue.</description><subject>CALCULATING</subject><subject>COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><subject>SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2023</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZJDwD3JxDVIIDHUNdVXwDwjx9PWMcgzx9PfjYWBNS8wpTuWF0twMym6uIc4euqkF-fGpxQWJyal5qSXxocFGBkbGBsaGFoZmjobGxKkCAIa6IM8</recordid><startdate>20230202</startdate><enddate>20230202</enddate><creator>Morgan, Kip Oliver</creator><creator>DeBardlebon, Zachary Christopher</creator><creator>Lasater, Zachary Taylor</creator><scope>EVB</scope></search><sort><creationdate>20230202</creationdate><title>ORDER QUEUE OPTIMIZATION</title><author>Morgan, Kip Oliver ; DeBardlebon, Zachary Christopher ; Lasater, Zachary Taylor</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2023031816A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2023</creationdate><topic>CALCULATING</topic><topic>COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><topic>SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR</topic><toplevel>online_resources</toplevel><creatorcontrib>Morgan, Kip Oliver</creatorcontrib><creatorcontrib>DeBardlebon, Zachary Christopher</creatorcontrib><creatorcontrib>Lasater, Zachary Taylor</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Morgan, Kip Oliver</au><au>DeBardlebon, Zachary Christopher</au><au>Lasater, Zachary Taylor</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>ORDER QUEUE OPTIMIZATION</title><date>2023-02-02</date><risdate>2023</risdate><abstract>When a new order is received and is to be inserted into an unprepared order queue for order preparation. The new order's items and items' ingredients are obtained along with expected preparation/cook time for each ingredient. Items and ingredients for the orders that are already in the queue are also inspected along with the times that each order was placed in the queue. A machine-learning model is processed with the data associated with the orders and the new order. The model returns an optimized rearrangement of the queue with the new order inserted into the queue that levels out the expected order wait times, reduces variations in order wait times, and minimizes order preparation times based on the rearranged/modified queue. The optimized queue is presented on a display associated with staff responsible for preparing the orders of the queue.</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_epo_espacenet_US2023031816A1 |
| source | esp@cenet |
| subjects | CALCULATING COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS COMPUTING COUNTING DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES ELECTRIC DIGITAL DATA PROCESSING PHYSICS SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR |
| title | ORDER QUEUE OPTIMIZATION |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-11T10%3A41%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=Morgan,%20Kip%20Oliver&rft.date=2023-02-02&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2023031816A1%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |