Sentence examples for machine assignment and from inspiring English sources

In the framework of estimation of distribution algorithm, two sub-populations are used to adjust the machine assignment and operation sequence respectively with a splitting criterion and a combination criterion.

The novelty of our method is that it is able to handle multiple objectives including efficiency and stability simultaneously, adapt to the new environment quickly by incorporating heuristic dynamic optimization strategies, and deal with two scheduling policies of machine assignment and operation sequencing together.

The clustered matrix before machine assignment and operation flexibility, and final clustered matrix is shown in Tables 14 and 15, respectively.

The extended machine cell formation problem to be described involves the specification of which individual machines should be modified to enable them to process additional part types, part-machine assignment, and the grouping of individual machines for cell formation.

We present a cooperative co-evolutionary invasive weed optimization (CCIWO) algorithm which iterates with two coupled colonies, one of which addresses the machine assignment problem and the other deals with the operation sequence problem.

The flexible job shop problem is composed by two sub-problems: the machine assignment problem and the operation scheduling problem; that is why, the chromosome representation is encoded in two parts: machine assignment part (MA) and operation sequence part (OS).

In the proposed algorithm, first, each solution is represented by two vectors: the machine assignment priority vector and the scheduling vector.

Considerable efforts are devoted to the design of parts and machine assignment procedures to direct SACF to converge to solutions with good values of grouping efficacy.

The solution is encoded as a two-part representation including a permutation vector and a machine assignment matrix.

Since one characteristic of this problem is that multiple machines can handle one operation at a time, the solution is encoded as a two-part representation including a permutation vector and a machine assignment matrix.

The distance is calculated first by measuring the difference between the machine assignment vectors ({rm{MA}}_{1}) and ({rm{MA}}_{2}) which is in order of O(n), then by verifying the execution order difference of the operation sequence vectors ({rm{OS}}_{1}) and ({rm{OS}}_{2}) which is in order of O(1).