Balancing production lines composed by series of workstations with parallel operations blocks
| Autor: | Nikolay Guschinsky, Alexandre Dolgui, Genrikh Levin |
|---|---|
| Přispěvatelé: | Equipe : Recherche Opérationnelle pour le Génie Industriel (ROGI-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)-UR LSTI, Département Méthodes Scientifiques pour la Gestion Industrielle (MSGI-ENSMSE), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Centre G2I, Operational Research, Academy of Science, Operational Research Laboratory, United Institute of Informatics Problems, National Academy of Sciences |
| Jazyk: | angličtina |
| Rok vydání: | 2003 |
| Předmět: |
Production line
050208 finance Workstation Computer science Distributed computing 05 social sciences Directed graph [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation law.invention law 0502 economics and business Shortest path problem 050207 economics Computer Science::Distributed Parallel and Cluster Computing |
| Zdroj: | Proceedings of the IEEE International Symposium on Assembly and Task Planning, 2003 2003 IEEE International Symposium on Assembly and Task Planning (ISATP'03) 2003 IEEE International Symposium on Assembly and Task Planning (ISATP'03), Jul 2003, Besançon, France. pp. 122-127, ⟨10.1109/ISATP.2003.1217198⟩ |
| DOI: | 10.1109/ISATP.2003.1217198⟩ |
| Popis: | International audience; A balancing problem for paced production lines with workstations in series and blocks of parallel operations at the workstations is considered. The problem is to choose blocks from a given set and allocate them to workstations in such a way that all the operations are assigned, the precedence and compatibility constraints are satisfied, and the line cost is minimal. A method for solving the problem is based on its transformation to a constrained shortest path problem. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|