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


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

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


    Beteiligte:
    Lawson, D.I. (Autor:in)


    Erscheinungsdatum :

    01.01.1998


    Format / Umfang :

    682295 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    CONCURRENT AIRCRAFT ROUTING AND MAINTENANCE SCHEDULING

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

    Freier Zugriff

    COMBINED AIRCRAFT MAINTENANCE ROUTING AND MAINTENANCE TASK SCHEDULING

    SAFAEI NIMA | Europäisches Patentamt | 2016

    Freier Zugriff

    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 Archiv | 1997