Maximising the patient flows throughout the emergency care patient pathway is one of the most important objectives in the healthcare system. The emergency department (ED) is the critical point of this pathway in most hospitals, as the potential delays reduce the number of patients seen in the recommended time. One of the key delays in the ED is the waiting time of a patient prior to treatment, which can be reduced by optimising the patient treatment schedules with priorities. In this paper, a novel blocking patient flow (BPF) algorithm is developed and tested using the real data from a hospital in Brisbane, Australia. Initially, a simulation model of real-life ED operations is developed by characterising patient interarrival and treatment times according to different disease categories. Subsequently, a BPF heuristic algorithm is designed and benchmarked via computational experiments using two dominance rules: first come first served (FCFS) and shortest processing time (SPT). The computational results show that the proposed approach leads to a reduction of the total waiting time by more than 8 % in comparison to the current hospital practice, which implies that more patients will be served in a specified time window.