Abstract In rural areas, milk tankers collect milk from farms for processing at a central base.Collection runs are assigned to tankers, each tanker performing a series of runs. After eachrun, the tankers need to be emptied by pumps, which are limited in number. A schedulingsystem has been devised to allocate runs to tankers, despatch the tankers and determinewhen the tanker may be emptied on its return in order to minimise the total time taken(makespan) for all runs to be completed. The joint problem of scheduling and sequencing isposed as a linear integer programming (IP) problem with additional nonlinear constraints.The problem is then solved by embedding an IP algorithm within an overall branch andbound approach. The results of testing this algorithm will be discussed and compared to aproposed heuristic approach.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    An exact algorithm for a milk tanker scheduling and sequencing problem


    Contributors:
    Basnet, C. (author) / Foulds, L.R. (author) / Wilson, J.M. (author)

    Published in:

    Publication date :

    1999-01-01


    Size :

    10 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    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


    A Maximum Utility Solution to a Vehicle Constrained Tanker Scheduling Problem

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