In this paper it is shown that the combinatorial problem of scheduling jobs of equal duration with tardiness costs and resource limitations can be solved by formulating the problem as a classical ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results