Patents
Literature
Patsnap Eureka AI that helps you search prior art, draft patents, and assess FTO risks, powered by patent and scientific literature data.

1 results about "First-come, first-served" patented technology

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.

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