Patents
Literature
2 results about "First-come, first-served" patented technology
Efficacy Topic
Property
Owner
Technical Advancement
Application Domain
Technology Topic
Technology Field Word
Patent Country/Region
Patent Type
Patent Status
Application Year
Inventor
First-come, first-served – sometimes first-in, first-served and first-come, first choice – is a service policy whereby the requests of customers or clients are attended to in the order that they arrived, without other biases or preferences. The policy can be employed when processing sales orders, in determining restaurant seating, on a taxi stand, etc. In Western society, it is the standard policy for the processing of most queues in which people wait for a service that was not prearranged or preplanned. Festival seating is seating done on an FCFS basis. The practice is also common among some airlines which do not permit seat reservations either in advance or at check-in. These airlines allow passengers to board in small groups based upon their order of check-in and sit in whatever seat on the aircraft they wish to. On the basis of first come, first served, the earlier they check in, the earlier they board the aircraft to get the seat they want. Passengers are sequentially assigned into one of several "boarding groups." The passengers are then boarded onto the plane in group order.
Outbound task scheduling method and device, equipment and storage medium
The invention provides an outbound task scheduling method and device, equipment and a storage medium, after service data sent by service parties are received through message middleware, the service data are written into different task queues according to the corresponding service parties, the service data of different service parties are stored in independent queues, and service data isolation is achieved, the more the task sets to which the task queues with the higher priorities belong are, so that the probability that the task queues with the higher priorities are extracted to the business data to execute the outbound tasks is higher when the business data are extracted from the task sets to execute the outbound tasks, namely, the outbound task execution rate of the outbound task queues with the higher priorities is higher; compared with an outbound task execution mode of first coming and first serving or rotation execution of different businesses, mutual influence among the businesses can be reduced, and resource waste caused by task idle running can be avoided, so that the execution efficiency of the outbound task is improved, and the timeliness of the outbound task is ensured.
Owner:KE COM (BEIJING) TECHNOLOGY CO LTD
Distributed hybrid flow shop dynamic scheduling method based on learnable iterative greedy algorithm
The application discloses a distributed hybrid flow shop dynamic scheduling method based on a learnable iterative greedy algorithm, relates to the flow shop scheduling technical field, and aims at a dynamic workpiece arrival and machine fault scene, takes minimizing the maximum completion time as a core target, is based on three coupled subproblems of a distributed hybrid flow shop, adopts a two-dimensional coding strategy to represent a factory distribution and a workpiece sequencing scheme, combines a first available machine rule and a first come first served rule to construct a decoding mechanism, designs a multi-level neighborhood operation set as an action space of an agent, deals with emergent events of the dynamic workpiece arrival and the machine fault, extracts state features as input by using a long short-term memory network, trains the agent by using a proximal policy optimization algorithm and an experience replay mechanism, dynamically adjusts a decision strategy, makes the agent self-adaptively select a rescheduling, a destruction reconstruction and a local search strategy, balances global exploration and local development, and finally improves scheduling quality.
Owner:NANJING NORMAL UNIVERSITY