An alternative to Strong and Wolanowski's (1976) formulation of the sugar harvest-milling scheduling problem is suggested. The problem is formulated as a transport problem, which has several interesting features. For example: efficient computing routines are available; fewer constraints are placed on the yield function; and re-scheduling could be easier when circumstances dictate.
Stringer, J., 1960, “Operational Research and Management”, British Transport Review, 5, 475–92.
2.
Stringer, J. and K.B. Haley, 1958, “The Application of Linear Programming to a Large-Scale Transportation Problem”, in: Proc. First International Conference on Operational Research, Oxford, September 1957 (English Universities Press, London).
3.
Strong, S. and M.A. Wolanowski, 1976, “Optimal Harvest-Milling Scheduling in the Sugar Industry”, Australian Journal of Management, 1(2), 99–105.
4.
Wolanowski, M.A. and S. Strong, 1977, “A Simplified Cane Harvest-Milling Model”, Australian Journal of Management, 2, 89–94.
