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.
An exact algorithm for a milk tanker scheduling and sequencing problem
Annals of Operations Research ; 86 , 0 ; 559-568
1999-01-01
10 pages
Article (Journal)
Electronic Resource
English
TIBKAT | 1963
|Further Extensions of the Tanker Scheduling Problem
NTIS | 1969
|Air Refueling Tanker Scheduling
NTIS | 1987
|Engineering Index Backfile | 1956
|