4 ms·
To save you some reading time, the algorithm appears to be: Load the first 10 or so people in alternating rows only (not the same row and not adjacent rows) fro
by thorax 19y ago
To save you some reading time, the algorithm appears to be:
Load the first 10 or so people in alternating rows only (not the same row and not adjacent rows) from rear to front. After they are done, load the next 10 people in alternating rows only from rear to front. Repeat.
This assumes that loading luggage into overhead bins is the biggest time sink for most loading. It maximizes the number of individuals who can be loading overhead compartments at any one time, rather than everyone waiting for the person at the front of the line to load their baggage 1-2 at a time or so.
- thorax 19y agoThey go on to state that doing it by blocks rather than strictly alternating may work better for cases of families that cannot be split up.
- mattmaroon 19y agoHa, you'd lose more time coordinating that than you'd gain. People are really dumb.