Graph approach for optimal design of transfer machine with rotary table
| Autor: | Genrikh Levin, Nikolay Guschinsky, Alexandre Dolgui |
|---|---|
| Přispěvatelé: | Laboratoire en Sciences et Technologies de l'Information, Département Méthodes Scientifiques pour la Gestion Industrielle (MSGI-ENSMSE), École des Mines de Saint-Étienne (Mines Saint-Étienne MSE), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Centre G2I-École des Mines de Saint-Étienne (Mines Saint-Étienne MSE), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Centre G2I, Six, Grégory |
| Jazyk: | angličtina |
| Rok vydání: | 2009 |
| Předmět: |
Optimal design
0209 industrial biotechnology Mathematical optimization 021103 operations research Computer science Strategy and Management 0211 other engineering and technologies 02 engineering and technology Management Science and Operations Research Industrial and Manufacturing Engineering 020901 industrial engineering & automation Shortest path problem Line balancing Graph (abstract data type) Algorithm ComputingMilieux_MISCELLANEOUS |
| Zdroj: | International Journal of Production Research International Journal of Production Research, Taylor & Francis, 2009, 47 (2), pp.321-341 |
| ISSN: | 0020-7543 1366-588X |
| Popis: | A line balancing problem for transfer machines with rotary tables is considered. This type of machine is used in mass production. A part is sequentially machined on m working positions and is moved from one position to the next using a rotary table. The operations are grouped into blocks, where the operations of the same block are simultaneously performed by one piece of equipment with several tools (a multi-spindle head). All multi-spindle heads of a machine are simultaneously activated. Therefore, all operations of the machine are executed in parallel on m parts mounted on the rotary table. The line balancing problem consists of partitioning the set of all operations into sub-sets in order to minimize the number of working positions and the total number of spindle heads while satisfying all the constraints (precedence, compatibility for spindle heads, etc.). The method proposed in this paper is based on transforming this line balancing problem into a search for a constrained shortest path. An algorithm ... |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|