Abstract
The transportation problems with impurities in goods are very important from practical point of view because of higher frequency. An extension of time transportation problem is considered when goods can have some impurities and the final mixture of goods arrived at destination have some specifications. This time transportation problem is in connection with linear lexicographical transportation problem with impurities. In this paper is also presented an algorithm to solve bottleneck transportation problem making a connection with linear lexicographical transportation problem with impurities. The algorithm optimality conditions are similar to those given by H. Issermann, but there are some modifications caused by impurities.
Cuvinte cheie
transportation
impurities
time minimization