| Abstract: | This paper presents direct noniterative methods for solving such known problems as shoploading and aggregate scheduling. There is given a simple optimal rule for the shop-loading problem which is quite surprising. The crucial point in solving this problem is what not to assign rather than what to assign. The development of those methods was possible since the discussed problems can be converted into a special transportation model where the given cost coefficients cij assume a form cij = ui + uj. |
