Implementation of the scheduling algorithm for a 15-story building with three elevators. Every time a person requests a floor, the desired floor will be added to the queue and the elevator will start moving according to the order of the floors in the queue. The request can be internal or external. Also, the following points are observed in the algorithm:
- Minimum change of elevator direction
- Starvation
- Acceptable response time