A variation of the generalized assignment problem arising in the New Zealand dairy industry

L.R. Foulds and J.M. Wilson

Annals of Operations Research, 1997, vol. 69, issue 0, 105-114

Abstract: Within the New Zealand dairy industry, milk is collected from farms by road tanker vehicles and delivered to the factories of a dairy company for processing. Before the tankers can be scheduled to pick up the milk, each company must decide to which factory the output of each of its client farms is to be sent. We present a mathematical model of this allocation problem and solution procedures for it. The model is a variation on the generalized assignment problem. The problem is NP-hard, which reinforces the search for efficient heuristics for it. We present heuristics which yield solutions close to optimality in a reasonable amount of computing time for problems of the size commonly encountered in the dairy industry. Copyright Kluwer Academic Publishers 1997

Date: 1997
References: Add references at CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018968625626 (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:69:y:1997:i:0:p:105-114:10.1023/a:1018968625626

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

DOI: 10.1023/A:1018968625626

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 ().