# US 2024/0202026 A1 · Virtual queue > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2024/0202026 A1 - Document ID: US20240202026A1 - Status: Published application - Kind: A1 - Application number: 18/592,722 - Filed: 2024-03-01 - Published: 2024-06-20 - Earliest claimed: 2020-08-07 - Assignees: Micron Technology, Inc. - Applicants: Micron Technology, Inc. - Inventors: Bhumika Chhabra; Zahra Hosseinimakarem; Carla L. Christensen; Radhika Viswanathan - Web page: https://patentgrep.com/patent/US20240202026A1 ## CPC - G06F 9/4881: {Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues} - G06F 9/45558: {Hypervisor-specific management and integration aspects} - G06F 9/546: {Message passing systems or structures, e.g. queues} - G06F 2009/4557: {Distribution of virtual machine instances; Migration and load balancing} - G06F 2009/45595: {Network integration; Enabling network access in virtual machine instances} - G06F 2209/548: Queue - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) ## Abstract Methods and non-transitory machine-readable media associated with a virtual queue are described. A method can include receiving, by a processing resource, a request from a user to join a virtual queue, adding, by the processing resource, the user to the virtual queue, determining, by the processing resource, a queue optimization based on an estimated wait time for the user in the virtual queue, and providing to the user, by the processing resource, the queue optimization including the estimated wait time for the user in the virtual queue. The virtual queue can be updated in an example. ## Claims ### Claim 1 A non-transitory machine-readable medium comprising a processing resource in communication with a memory resource having instructions executed by the processing resource to: receive a request from a user to join a plurality of virtual queues of physical locations; determine an estimated wait time for the user in each one of the plurality of virtual queues; and create an itinerary for visiting a physical location associated with each one of the plurality of virtual queues to the user based on the estimated wait times. ### Claim 2 (depends on 1) The medium of claim 1, further comprising instructions executed by the processing resource to update the itinerary upon completion of one of the plurality of virtual queues. ### Claim 3 (depends on 1) The medium of claim 1, further comprising instructions executed by the processing resource to provide a notification to the user of the user's position in one of the plurality of virtual queues. ### Claim 4 (depends on 1) The medium of claim 1, further comprising instructions executed by the processing resource to remove the user from one of the plurality of virtual queues responsive to: the user reaching the front of the one of the plurality of virtual queues; and a threshold period of time passing before the user arrives at a physical location associated with the one of the plurality of virtual queues. ### Claim 5 (depends on 1) The medium of claim 1, comprising instructions executed by the processing resource to update the itinerary based on changes associated with a different user to one of the plurality of virtual queues. ### Claim 6 (depends on 1) The medium of claim 1, comprising instructions executed by the processing resource to provide one of the plurality of virtual queues to a computing device at an associated one of the physical locations. ### Claim 7 (depends on 1) The medium of claim 1, comprising instructions executed by the processing resource to add the user to each one of the plurality of virtual queues responsive to receipt of the request. ### Claim 8 (depends on 1) The medium of claim 1, comprising instructions executed by the processing resource to determine a queue optimization by selecting a physical location for each event from a plurality of physical locations for each event based on an estimated wait time for the user in a virtual queue for each event. ### Claim 9 (depends on 8) The medium of claim 8, comprising instructions executed by the processing resource to add the user to each one of the plurality of virtual queues based on the queue optimization. ### Claim 10 A non-transitory machine-readable medium comprising a processing resource in communication with a memory resource having instructions executed by the processing resource to: receive a request from a user to join a plurality of virtual queues of physical locations; add the user to each one of the plurality of virtual queues; determine an estimated wait time for the user in each one of the plurality of virtual queues; determine a queue optimization by selecting virtual queues of the plurality of virtual queues with a shortest estimated wait time; create an itinerary for visiting each one of the plurality of selected virtual queues to the user based on the estimated wait times; provide a notification to the user regarding the itinerary; and automatically remove the user from each virtual queue except the selected virtual queues based on the queue optimization, wherein the notification comprises a notification of a change in the estimated wait time of one of the plurality of selected virtual queues. ### Claim 11 (depends on 10) The medium of claim 10, comprising instructions executed by the processing resource to suggest an additional physical location to add to the itinerary based on the physical locations in the plurality of selected virtual queues, the created itinerary, and a location of the user. ### Claim 12 (depends on 10) The medium of claim 10, wherein the notification comprises a notification of a change in the itinerary. ### Claim 13 (depends on 10) The medium of claim 10, wherein the notification comprises a notification of a position of the user in one of the plurality of selected virtual queues. ### Claim 14 (depends on 10) The medium of claim 10, wherein the notification comprises a notification of a window of time before the user is removed from the queue. ### Claim 15 (depends on 10) The medium of claim 10, further comprising instructions executed by the processing resource to create and display a map of the itinerary. ### Claim 16 A method, comprising: receiving, by a processing resource, a request from a user to join a plurality of virtual queues of physical locations; determining, by the processing resource, an estimated wait time for the user in each one of the plurality of virtual queues; creating, by the processing resource, an itinerary for visiting a physical location associated with each one of the plurality of virtual queues to the user based on the estimated wait times; and suggesting, by the processing resource, an additional physical location to add to the itinerary based on the physical locations in the plurality of selected virtual queues, the created itinerary, and a location of the user. ### Claim 17 (depends on 16) The method of claim 16, comprising providing a notification to the user regarding the itinerary. ### Claim 18 (depends on 17) The method of claim 17, comprising removing the user from each virtual queue except the selected virtual queues based on the queue optimization, wherein the notification comprises a notification of a change in the estimated wait time of one of the plurality of selected virtual queues. ### Claim 19 (depends on 17) The method of claim 17, comprising determining a queue optimization by selecting virtual queues of the plurality of virtual queues with a shortest estimated wait time. ### Claim 20 (depends on 16) The method of claim 16, comprising receiving the request to join the plurality of virtual queues for each physical location having a physical queue, wherein each of the plurality of physical queues and each of the plurality of virtual queues are different queues.