IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v86y1999i0p559-56810.1023-a1018943910798.html
   My bibliography  Save this article

An exact algorithm for a milk tanker scheduling and sequencing problem

Author

Listed:
  • C. Basnet
  • L.R. Foulds
  • J.M. Wilson

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

Suggested Citation

  • C. Basnet & L.R. Foulds & J.M. Wilson, 1999. "An exact algorithm for a milk tanker scheduling and sequencing problem," Annals of Operations Research, Springer, vol. 86(0), pages 559-568, January.
    • Handle: RePEc:spr:annopr:v:86:y:1999:i:0:p:559-568:10.1023/a:1018943910798
    DOI: 10.1023/A:1018943910798
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018943910798
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018943910798?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Bilge Bilgen & Yelda Çelebi, 2013. "Integrated production scheduling and distribution planning in dairy supply chain by hybrid modelling," Annals of Operations Research, Springer, vol. 211(1), pages 55-82, December.
    2. Paredes-Belmar, Germán & Montero, Elizabeth & Lüer-Villagra, Armin & Marianov, Vladimir & Araya-Sassi, Claudio, 2022. "Vehicle routing for milk collection with gradual blending: A case arising in Chile," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1403-1416.
    3. Massimiliano Caramia & Francesca Guerriero, 2010. "A Milk Collection Problem with Incompatibility Constraints," Interfaces, INFORMS, vol. 40(2), pages 130-143, April.
    4. Masson, Renaud & Lahrichi, Nadia & Rousseau, Louis-Martin, 2016. "A two-stage solution method for the annual dairy transportation problem," European Journal of Operational Research, Elsevier, vol. 251(1), pages 36-43.
    5. M Caramia & F Guerriero, 2010. "A heuristic approach for the truck and trailer routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(7), pages 1168-1180, July.
    6. Paredes-Belmar, Germán & Marianov, Vladimir & Bronfman, Andrés & Obreque, Carlos & Lüer-Villagra, Armin, 2016. "A milk collection problem with blending," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 94(C), pages 26-43.
    7. Olcay Polat & Duygu Topaloğlu, 2022. "Collection of different types of milk with multi-tank tankers under uncertainty: a real case study," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(1), pages 1-33, April.
    8. Olcay Polat & Duygu Topaloğlu, 2019. "Milk Collection Network Design In A Fuzzy Environment," Economy & Business Journal, International Scientific Publications, Bulgaria, vol. 13(1), pages 376-384.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:86:y:1999:i:0:p:559-568:10.1023/a:1018943910798. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.