Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
Ordering of jobs with three different processing times in the Mxn Bellman-Johnson problem
Authors: Ion Bolun
– 0.24 Mb
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.Ion Bolun
Academy of Economic Studies from Moldova,
Cybernetics, Statistics and Economic Informatics School
E-mail:
Academy of Economic Studies from Moldova,
Cybernetics, Statistics and Economic Informatics School
E-mail:
Fulltext
– 0.24 Mb
Contents
- An Example of Π30-complete Infinitary Rational Relation
- Machine Intelligence Quotient as a Complex Fuzzy Numeral
- Aspect oriented programming and component assembly
- The Pico's formula Generalization
- On Soundness for Time Workflow Nets
- Ordering of jobs with three different processing times in the Mxn Bellman-Johnson problem
- Abstracts of Dr. Hab. Thesis
