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

Annals of Operations Research

Volumn 69, Issue , 1997, Pages 105-114

  Foulds, L R ^a   Wilson, J M ^b  

^a UNIVERSITY OF WAIKATO   (New Zealand)

^b LOUGHBOROUGH UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031539789     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/a:1018968625626     Document Type: Article

References (8)

1. M. M. Amini and M. Racer, A rigorous computational comparison of alternative solution methods for the generalized assignment problem, Management Science 40(1994)868-890.
2. M.L. Fisher and R. Jaikumar, A generalized assignment heuristic for vehicle routing, Networks 11 (1981)109-124.
3. L.R. Foulds, An information system for milk tanker scheduling, Proceedings 28th Annual Conference of the Operational Research Society of New Zealand, University of Canterbury, Christchurch, New Zealand, August 1992, pp. 199-206.
4. A.M. Frieze and M.R.B. Clarke, Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses, European Journal of Operational Research 15 (1984)100-109.
5. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1978.
6. S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Codes, Wiley, New York, 1990.
7. G.T. Ross and R.M. Soland, A branch and bound approach for the generalized assignment problem, Mathematical Programming 8(1975)91-105.
8. Sciconic/VM, EDS-Scicon, Milton Keynes, England.