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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    An Appointment Scheduling Method for China’s Driving License Exam Using Network Flow Modelling


    Beteiligte:
    Bao, Yongqiang (Autor:in) / Xu, Huiying (Autor:in) / Qiu, Chenlu (Autor:in)


    Erscheinungsdatum :

    2016-11-25


    Format / Umfang :

    7 pages





    Medientyp :

    Aufsatz/Kapitel (Buch)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch





    Power MosFet: ESA Driving License

    Crausaz, A. / Gasquet, E. / Sanchis-Kilders, E. et al. | British Library Conference Proceedings | 1995


    Power MosFet: ESA Driving License

    Crausaz, A. / Gasquet, E. / Sanchis-Kilders, E. | British Library Online Contents | 1995


    Taxi appointment management method and taxi appointment management system

    WANG ZHIQIANG / XIAO KE / ZHAO XIONG et al. | Europäisches Patentamt | 2015

    Freier Zugriff

    PE Exam

    Online Contents | 2000