Developing Systems

A minimах problem in scheduling theory

O. G. Alekseev

Leningrad

Abstract: The paper is concerned with a minimax problem reducible to the minimax travelling salesman problem. A branch-and-bound algorithm is proposed for the solution. A numerical example and computer experiment results are given.

UDC: 65.012.1.122


Received: 09.03.1977

 English version: Automation and Remote Control, 1978, 39:1, 87–89

Bibliographic databases:

•