Auto-Sequential Scheduling
You can't afford to miss out. 
It is time for change today!

This is computer scheduling, but operates sequentialy. Parents are processed in turn, with schedules determined efficiently – but only on a parent-by-parent basis; sequentially. The sequence is often determined by the alphabetic sort ranking of the parents surname, but can equally be sorted by any other criteria.
An example of this type of system is TimeChart:
(Why provide links to competitors? We know we are the best! Do your own research. We are also slightly more research focused than other commercial entities)
Generally all parent requests are sequentially processed together at one time, though a slight variation to this approach is where times are issued sequentially and automatically by the system on request. This allows instant feedback of schedule times. Edval supports this approach as an option.

  • Efficient parent schedules.
    • Parents have less waiting time. More efficient than student-led.
  • Less Administration.
    • Scheduling Software will also prepare and manage schedules, provide printed output and assist in other administrative tasks.
  • Facilitates reporting.
    • Electronic schedules easily show which parents fail to request interviews, or who perhaps request too many interviews.

  • Unfair.
    • In exactly the same manner as discriminating on submission time, computerised sequential scheduling discriminates on alphabetic surname sort order.
    • This means Mr Aardvark gets all requested interviews and with no idle waiting time, while Mr Zulu is luck to get any interviews, or if so finds they are spaced out with very long waiting gaps.
  • Poor technology.
    • Existing sequential scheduling systems provide quite poor quality results, and often need to be significantly adjusted manually, to ensure suitable results are provided.
    • This is to correct sort bias, and to ensure fair balance in the allocation of interviews to all parents equally.