A method of finding the shortest concurrent path on a graph for p concurrent players, p/spl ges/1, is presented. Real-time applications, the routing of aircraft and the scheduling of collections of tasks are then discussed and a parallel Bellman shortest path algorithm is described which finds the shortest path from node r to node s on a graph G. Using this algorithm and the proper configuration of processors the shortest path on a graph with k nodes can be found in O(log n) time for 2(m/sup -1/)+1


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Concurrent path selection and real-time applications: aircraft routing and task scheduling


    Contributors:


    Publication date :

    1998-01-01


    Size :

    682295 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    CONCURRENT AIRCRAFT ROUTING AND MAINTENANCE SCHEDULING

    İlkay Orhan / Muzaffer Kapanoğlu / T.Hikmet Karakoç | DOAJ | 2011

    Free access

    COMBINED AIRCRAFT MAINTENANCE ROUTING AND MAINTENANCE TASK SCHEDULING

    SAFAEI NIMA | European Patent Office | 2016

    Free access

    Real-time adaptive aircraft scheduling

    Kolitz, Stephan E. / Terrab, Mostafa | NTRS | 1990


    Real-Time Adaptive Aircraft Scheduling

    S. E. Kolitz / M. Terrab | NTIS | 1990


    Daily aircraft routing and scheduling

    Desaulniers, G. / Desrosiers, J. / Dumas, Y. et al. | Tema Archive | 1997