A modification to the Dantzig and Fulkerson tanker scheduling problem is described. An insufficient number of vehicles and a utility associated with each vehicle delivery are assumed. The new problem is shown to be equivalent to a transshipment problem, the solution of which is the same as the maximal utility solution of the modified tanker scheduling problem. An example is given. (Author)


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    A Maximum Utility Solution to a Vehicle Constrained Tanker Scheduling Problem


    Contributors:
    M. Bellmore (author) / G. Bennington (author) / S. Lubore (author)

    Publication date :

    1968


    Size :

    24 pages


    Type of media :

    Report


    Type of material :

    No indication


    Language :

    English




    A Maximum Utility Solution to a Vehicle Constrained Tanker Scheduling Problem

    M. Bellmore / C. Bennington / S. Lubore | NTIS | 1968


    Tanker scheduling

    Briskin, Lawrenc | TIBKAT | 1963


    Further Extensions of the Tanker Scheduling Problem

    M. Bellmore / G. Bennington / S. Lubore | NTIS | 1969


    Air Refueling Tanker Scheduling

    H. C. Hostler | NTIS | 1987


    Super tanker problem

    Hale, J.W. / O'Connel, H. | Engineering Index Backfile | 1956