Team 2056 Page 1l of 50 nd is seated Idle. If there is no passenger in the processor(and the queue is empty) the processor will do nothing The processors run sequentially in order from back to front.(If th processors ran from front to back, during one time cycle, a passenger could be processed in the first processor, move to the second, be rocessed there, and continue in a similar manner the entire distance to his seat. )They continue to run until every passenger has found his seat The implementation of our algorithm can be seen in figure 2 Assumptions made in Section 3.1 The initial configuration of the system is that all passengers are queued at the first row. In actuality, the situation is slightly dif- ferent. All passengers are initially queued at the ticket counter where their boarding passes are scanned and they walk a short distance to the plane. Hence, a more realistic alternative to our process is a poisson arrival process from the ticket counter to the queue for the first row. However, we feel that this addi- tional process is unnecessary. It is not needed because of the high speed at which the tickets are taken. This process closely approximates the speed of normal walking. Hence, the passen- gers will reach the queue at a much higher rate than they are moved forward through the plane. Hence, the queue at proces- or 1 will form instantly, at the point that the first passengers walk into the plane There is no idle time between the first passenger entering queue I and the last. This assumption is also involved in our decision to queue all passengers at the first processor. In some cases the airline could wait until there is no queue left before inviting dditional passengers to board. For example, if calling pa gers by zone, the airline could wait until all passengers in one zone are seated before the next zone is invited onto the aircraft However, this is never to the airline' s advantage. We assume that the airline desires maximum efficiency, and hence ensures that there is no dead-time between passengersTeam 2056 Page 11 of 50 and is seated. • Idle. If there is no passenger in the processor (and the queue is empty) the processor will do nothing. The processors run sequentially in order from back to front. (If the processors ran from front to back, during one time cycle, a passenger could be processed in the first processor, move to the second, be processed there, and continue in a similar manner the entire distance to his seat.) They continue to run until every passenger has found his seat. The implementation of our algorithm can be seen in figure 2. Assumptions made in Section 3.1 • The initial configuration of the system is that all passengers are queued at the first row. In actuality, the situation is slightly dif￾ferent. All passengers are initially queued at the ticket counter, where their boarding passes are scanned and they walk a short distance to the plane. Hence, a more realistic alternative to our process is a poisson arrival process from the ticket counter to the queue for the first row. However, we feel that this addi￾tional process is unnecessary. It is not needed because of the high speed at which the tickets are taken. This process closely approximates the speed of normal walking. Hence, the passen￾gers will reach the queue at a much higher rate than they are moved forward through the plane. Hence, the queue at proces￾sor 1 will form instantly, at the point that the first passengers walk into the plane. • There is no idle time between the first passenger entering queue 1 and the last. This assumption is also involved in our decision to queue all passengers at the first processor. In some cases, the airline could wait until there is no queue left before inviting additional passengers to board. For example, if calling passen￾gers by zone, the airline could wait until all passengers in one zone are seated before the next zone is invited onto the aircraft. However, this is never to the airline’s advantage. We assume that the airline desires maximum efficiency, and hence ensures that there is no dead-time between passengers