Operations Research Letters, Vol. 9, No. 6, pp. 371-374, November 1990
4 Pages Posted: 8 Apr 2008 Last revised: 13 May 2017
The mean flow time problem and the mean absolute deviation problem for multiple uniform parallel machines are shown to be equivalent. For multiple unrelated parallel machines, a reduction of the mean absolute deviation problem into a transportation problem is presented.
Keywords: production, scheduling, parallel shop, deterministic, computational complexity
JEL Classification: M11, C0
Suggested Citation: Suggested Citation
Kubiak, Wieslaw and Lou, Sheldon and Sethi, Suresh, Equivalence of Mean Flow Time Problems and Mean Absolute Deviation Problems. Operations Research Letters, Vol. 9, No. 6, pp. 371-374, November 1990. Available at SSRN: https://ssrn.com/abstract=1117306