The m-machine problem with parts-sequencing constraints (Q1092804)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4020827
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The m-machine problem with parts-sequencing constraints |
scientific article; zbMATH DE number 4020827 |
Statements
The m-machine problem with parts-sequencing constraints (English)
0 references
1987
0 references
The problem of time-optimal processing of n parts by m machines is generalized by introducing sequencing constraints on the parts. A method of solution of the generalized problem is proposed, based on the apparatus of infinite-valued logic and logical determinants, which reflect various characteristics of the processing time matrix.
0 references
time-optimal processing
0 references
sequencing constraints
0 references
infinite-valued logic
0 references
0.7812984585762024
0 references
0.7783603072166443
0 references
0.7582016587257385
0 references
0.7577892541885376
0 references
