The Perrego algorithm: a flexible machine-component grouping algorithm based on group technology techniques (Q4399006): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/00207549508930238 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1967476057 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A method for finding minimal bottle-neck cells for grouping part-machine families† / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 12:25, 28 May 2024
scientific article; zbMATH DE number 1179700
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Perrego algorithm: a flexible machine-component grouping algorithm based on group technology techniques |
scientific article; zbMATH DE number 1179700 |
Statements
The Perrego algorithm: a flexible machine-component grouping algorithm based on group technology techniques (English)
0 references
2 May 1999
0 references
grouping
0 references
cell formation
0 references
Perrego algorithm
0 references
production flow analysis
0 references
