One task of routing jobs in high radiation conditions

The problem of sequential bypass of megalopolises is investigated, focused on the problem of dismantling a system of radiation hazardous objects under constraints in the form of precedence conditions. The radiation impact on the performers is assessed by the doses received during movements and during the performance of dismantling works. The route problem of minimizing the dose load of workers carrying out dismantling in one or another sequence of operations is considered. The procedure for constructing an optimal solution using a variant of dynamic programming is investigated. On this basis, an algorithm is built, implemented on a PC. Examples of the numerical solution of a model problem for the minimum dose load are given.

On sequential traversal of sets

The problem of sequential traversal of megapolises with precedence conditions is investigated; this problem is oriented to mechanical engineering — CNC metal cutting machines. There is the following setting singularity: the terminal component of additive criterion contains the dependence on the starting point. This singularity leads to the fact that the natural solution procedure based on dynamic programming must be applied individually for every starting point. The investigation goal consists in the construction of an optimizing algorithm for determining a complex including a route (a variant of megapolis numbering), a trajectory, and a starting point. The proposed algorithm realizes an idea of directed enumeration of starting points. This algorithm is realized as a program for PC; computations for model examples are made.

A NEW MODEL OF RESOURCE PLANNING FOR OPTIMAL PROJECT SCHEDULING

It is well known that not only the classical model of PERT/CPM but its later improvements treat a resource planning in the project scheduling in a very limited way. Using them it is possible to calculate the optimum amount of resources taken from outside or financial expenses for separate operations but it is quite impossible to share internal resources between parallel operations. Instead of these models a new one is introduced. It combines relationships concerning sharing resources‐capacities and works dynamics and perhaps other ones that express the use of materials and funds, inventory control and so on. Non‐strict work precedence conditions may be used as well. The model as a whole slightly differs from the model of resource planning in complex industrial systems proposed by the author and retains its general properties, notably the form of optimality conditions. A decomposition method of the project optimum fulfillment is proposed.

A proposed lexicalised linearisation grammar: A monostratal alternative

This paper presents an overview of a proposed linearisation grammar, which relies solely upon information residing in lexical heads to constrain word order. Word order information, which encompasses discontinuity as well as linear precedence conditions, is explicitly encoded as part of the feature structure of lexical heads, thus dispensing with a separate LP specification or ˋphenogrammatical' layer standardly posited for linearisation. Instead, such lexicon-originated word order constraints are enforced in projections, propagated upwards and accumulated in the compound PHON feature, which represents phonological yields in an underspecified manner. Though limited somewhat in generative capacity, this approach covers the key phenomena that motivated linearisation grammars and offers a simpler alternative to the standard DOM-oriented theory.

Computer Aided Assembly Process Planning

A method allowing a systematic generation of assembly plans for mechanical products is presented. It involves a product modelling that includes non-assembly relevant features like labelling, checking, etc. Assembly plans are represented by assembly trees and are produced through interactive software written in PROLOG. An analysis of assembly constraints is also presented with a distinction between operative constraints dealing with the feasibility of the operations involved in the different assembly plans and the strategic constraints dealing with the global structure of the plans. An automatic transformation of the resulting assembly plans into one or several precedence graphs is given as well as a generalization of the classic precedence graphs in precedence hypergraphs able to represent disjunctive precedence conditions.