The paper presents the problem of job scheduling and schedule optimization in order to minimize unnecessary downtime of machines and equipment used. The branch and bound method, on which the Brown-Lomnicki algorithm developed in the mid-twentieth century is based, can be applied for this purpose. The authors present an attempt to program the algorithm, as well as a concept for minimizing the necessary iterations leading to the optimal result. The paper presents the software, its operation, and a practical example.Integer programming, also known as discrete optimization, helps in solving problems where all or some of the variables can only take integer values. In construction practice, such situations occur very often, for example in the case of optimizing the use of indivisible means of production.
Such means can include, for example, (…)
The article contains 16441 characters.
Source: Logistyka Magazine
Brown-Lomnicki algorithm – a proposal for computer software – PDF file for download








