Skip to main content
Log in

An exact algorithm for a milk tanker scheduling and sequencing problem

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. C. Basnet, D.N. Clark and L. R. Foulds, A decision support system approach to vehicle scheduling, Control and Cybernetics 22(1993)131-144.

    Google Scholar 

  2. C. Basnet and L.R. Foulds, Milk tanker scheduling in the dairy industry, in: Proceedings of the 31st Annual Conference of the Operational Research Society of New Zealand, Wellington, New Zealand, 1995, pp. 271-276.

  3. C. Basnet, L.R. Foulds and M. Igbaria, FleetManager: A microcomputer-based decision support system for vehicle scheduling (1996), to appear in Dec. Supp. Sys.

  4. C. Basnet, L.R. Foulds and J.M. Wilson, A decision aid for milk tanker pump scheduling, Research Report 96-1, School of Management Studies, University of Waikato, New Zealand, 1996, to appear in J. Opl. Res. Soc.

    Google Scholar 

  5. M. Butler and H.P. Williams, A problem of milk delivery: A variation of the travelling salesman problem, Research Report, Dept. of Mathematics, University of Southampton, England, 1995, to appear in Comp. Opt.

    Google Scholar 

  6. L.R. Foulds and J.M. Wilson, A variation of the generalised assignment problem arising in the New Zealand dairy industry, Ann. Oper. Res. 69(1997)105-114.

    Google Scholar 

  7. R.J. Willis, Critical path analysis and resource constrained project scheduling — theory and practice, Eur. J. Opl. Res. 21(1985)14-155.

    Google Scholar 

  8. J.K. Sankaran and R.R. Ubgabe, Routing tankers for dairy milk pickup, Interfaces 24:5(1994)59-66.

    Google Scholar 

  9. XPRESS-MP, Dash Associates, Blisworth, Northamptonshire, England, NN7 3BX.

Download references

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Basnet, C., Foulds, L. & Wilson, J. An exact algorithm for a milk tanker scheduling and sequencing problem. Annals of Operations Research 86, 559–568 (1999). https://doi.org/10.1023/A:1018943910798

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018943910798

Keywords

Navigation