“…Then, the problem can be seen as a mixed integer linear programming problem [Adams et al 1984, Adams, Laughton, 1974, Afuso et al 1982, Aoki et al 1990, El-Kadi 1984, Fawzi et al 1983, Gönen, Foote 1981, Gönen, Foote 1982, Gönen 1986, Hindi, Brameller 1977, Masud 1974, Masud 1978, Nara et al 1991, Ramírez-Rosado., Gönen 1991, Sun et al 1982, Thompson, Wall 1981, Wall et al 1979, and solved using the available procedures based on the simplex method. The references [Adams et al 1984, Adams, Laughton, 1973, Afuso et al 1982] use a dynamic programming model and [Crawford, Holt Jr 1975, Holt Jr, Crawford 1976] use graph theory related models, and solve the problem combining shortest path algorithms and transportation algorithms.…”