Abstract In this work, we consider the appointment scheduling problem for China’s driver licenses exam with session capacity constraints. It is modelled as a maximum flow problem solved by Edmonds-Karp algorithm. A more general case with appointment priorities is also considered as a minimum cost flow problem solved by Busacker-Gowan algorithm. Experimental comparison of proposed approaches with conventional used sorting and dispatch method is given, showing the improvement of resource utilization for proposed approaches.
An Appointment Scheduling Method for China’s Driving License Exam Using Network Flow Modelling
2016-11-25
7 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
Europäisches Patentamt | 2021
|Power MosFet: ESA Driving License
British Library Conference Proceedings | 1995
|Power MosFet: ESA Driving License
British Library Online Contents | 1995
|Taxi appointment management method and taxi appointment management system
Europäisches Patentamt | 2015
|Online Contents | 2000