An exact algorithm for a milk tanker scheduling and sequencing problem

C. Basnet, L.R. Foulds and J.M. Wilson

Annals of Operations Research, 1999, vol. 86, issue 0, 559-568

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. Copyright Kluwer Academic Publishers 1999

Date: 1999
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018943910798 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:86:y:1999:i:0:p:559-568:10.1023/a:1018943910798

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018943910798

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().