In PHP using no database

The business logic includes: Appointments can be any time from 9am to 6 pm. Possible appointment times are every quarter hour. Established patients' appointments should be for 30 minutes; new patient appointments for 90 minutes. Drive times are estimated from the map coordinates, ignoring freeways, mountains etc. The map coordinates are about 2 minutes apart, so that, for example, the estimated drive time from a location in square A2 to square A3 will be 2 minutes, and the estimated drive time from B4 to D7 will be 7.2 minutes ( = 2 * sqrt(2*2 + 3*3)). The order of appointments should be chosen to minimize driving time. Dead time (time not spend in appointments or driving) should be minimized. However dead time around noon is acceptable, since that enables the team to eat lunch. Minimal Core (20 points Enable the scheduler to enter the information for tomorrow's patients and get a draft schedule. She will need to enter the patients' names and whether or not each is new. The draft schedule should be list of patients, ordered by appointment times, indicating the name, address, and expected visit duration, interleaved with estimated drive times. (estimated to require 10 person-hours) Feature 1 [5 points) Enable the scheduler in addition to enter for each patient the start and end times of the desired window for the visit. The schedule that is output may fail to satisfy some constraints, but if so, the violated constraints should be visually highlighted, for example with a red asterisk. (2 hours) Feature 2 [5 points] Add "delete buttons to the schedule, one for each patient, so that the scheduler by a click can remove that patient from that day's schedule. (2 hours) Feature 3 [5 points] Add a way for the scheduler to modify the schedule. For example, display buttons for up and down next to each appointment, allowing the scheduler to move that person earlier or later in the day. (2 hours) Feature 4 [5 points) Add an "optimize" button that finds a sequence of visits that minimizes the total estimated driving time. Use of clever search algorithms is discouraged; as there will never be more than 8 patients per day, brute-force search is fine. (2 hours) Feature 5 [5 points] Output a schedule that ensures that all constraints are met, or if impossible, indicates this in some helpful way. (3 hours) The business logic includes: Appointments can be any time from 9am to 6 pm. Possible appointment times are every quarter hour. Established patients' appointments should be for 30 minutes; new patient appointments for 90 minutes. Drive times are estimated from the map coordinates, ignoring freeways, mountains etc. The map coordinates are about 2 minutes apart, so that, for example, the estimated drive time from a location in square A2 to square A3 will be 2 minutes, and the estimated drive time from B4 to D7 will be 7.2 minutes ( = 2 * sqrt(2*2 + 3*3)). The order of appointments should be chosen to minimize driving time. Dead time (time not spend in appointments or driving) should be minimized. However dead time around noon is acceptable, since that enables the team to eat lunch. Minimal Core (20 points Enable the scheduler to enter the information for tomorrow's patients and get a draft schedule. She will need to enter the patients' names and whether or not each is new. The draft schedule should be list of patients, ordered by appointment times, indicating the name, address, and expected visit duration, interleaved with estimated drive times. (estimated to require 10 person-hours) Feature 1 [5 points) Enable the scheduler in addition to enter for each patient the start and end times of the desired window for the visit. The schedule that is output may fail to satisfy some constraints, but if so, the violated constraints should be visually highlighted, for example with a red asterisk. (2 hours) Feature 2 [5 points] Add "delete buttons to the schedule, one for each patient, so that the scheduler by a click can remove that patient from that day's schedule. (2 hours) Feature 3 [5 points] Add a way for the scheduler to modify the schedule. For example, display buttons for up and down next to each appointment, allowing the scheduler to move that person earlier or later in the day. (2 hours) Feature 4 [5 points) Add an "optimize" button that finds a sequence of visits that minimizes the total estimated driving time. Use of clever search algorithms is discouraged; as there will never be more than 8 patients per day, brute-force search is fine. (2 hours) Feature 5 [5 points] Output a schedule that ensures that all constraints are met, or if impossible, indicates this in some helpful way. (3 hours)