Balancing large-scale machining lines with multi-spindle heads using decomposition

Autor: Genrikh Levin, B. Finel, François B. Vernadat, Alexandre Dolgui, Nikolay Guschinsky, Olga Guschinskaya
Přispěvatelé: Laboratoire en Sciences et Technologies de l'Information, Division for Indl Engineering and Computer Sciences, École des Mines de Saint-Étienne (Mines Saint-Étienne MSE), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-École des Mines de Saint-Étienne (Mines Saint-Étienne MSE), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Laboratoire de Génie Industriel et de Production Mécanique (LGIPM), Université Paul Verlaine - Metz (UPVM), Operational Research, Academy of Science, 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-É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, Operational Research Laboratory, United Institute of Informatics Problems, National Academy of Sciences
Jazyk: angličtina
Rok vydání: 2006
Předmět:
Zdroj: International Journal of Production Research
International Journal of Production Research, Taylor & Francis, 2006, 44 (18-19), pp.4105-4120. ⟨10.1080/00207540600632232⟩
ISSN: 0020-7543
1366-588X
DOI: 10.1080/00207540600632232⟩
Popis: International audience; The paper deals with optimal logical layout design for a type of machining lines. Such lines are made of many machine-tools (workstations) located in sequence. On each workstation there are several multi-spindle heads. A spindle-head does not execute one operation but a block of machining operations simultaneously. The problem studied in this paper consists in finding the best partition of the set of all operations to be executed on the line into blocks and workstations. The objective is to minimize the number of blocks and workstations. An optimal decision must satisfy a desired productivity rate (cycle time) and precedence and compatibility constraints for machining operations. A heuristic approach based on decomposition of a Mixed Integer Programming (MIP) model is developed. Two ways of forming sub-problems are proposed. One of them treats the obtained subsets independently. The second one aggregates the solution of the previous sub-problems. Results of their computational evaluation are reported.
Databáze: OpenAIRE