The described method is constructed for assembly plants. Each assembled product consists of a lot of parts. The assembly plants are the supply network elements. This method is used for simultaneous selection of suppliers, transport firms and the chosen transport. This method uses the linear mathematical model. There aren't integer variables in the mathematical formulations, and the problem is solved with the use of relaxation heuristic. The cost criterion is employed in the minimization function that regards the costs of marketing, transport, handling, storage, and fines. The schedules of transport tasks are constructed for selected transport means between the selected suppliers and the assembly plants. This paper presents the results of computational experiments with this proposed method, and compares the heuristic and optimal solutions.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.