Scheduling algorithms lie at the heart of manufacturing systems optimisation by determining the order and allocation of tasks to resources. Their development is crucial for minimising production times ...

In this paper we introduce two general techniques for the design and analysis of approximation algorithms for NP-hard scheduling problems in which the objective is to minimize the weighted sum of the ...

The "branch-and-bound" algorithm for the exact solution of a three-machine scheduling problem proposed by Lomnicki has been generalized to the case of an arbitrary number of machines (under the ...