Ordering of jobs with tree different processing times in the MXN Bellman-Jonson problem

Abstract

Bellman-Johnson Mxn scheduling problem with monotone (no decreasing, constant or no increasing) jobs of three different processing times is investigated. Three different classes C3.1, C3.2 and C3.3 of such systems are considered. On the basis of earlier results, the solution for optimal ordering of adjacent or nonadjacent jobs in pairs for each of these classes of systems is obtained. In addition, examples of systems for which it is possible to obtain the optimal solution of ordering all n jobs are done, too.