Loading…
Balancing large-scale machining lines with multi-spindle heads using decomposition
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...
Saved in:
Published in: | International journal of production research 2006-09, Vol.44 (18-19), p.4105-4120 |
---|---|
Main Authors: | , , , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c511t-8b607ca079e8c8732a8882f57e73ce1e10b99aa4220589dc1360fda1f9c96a6e3 |
---|---|
cites | cdi_FETCH-LOGICAL-c511t-8b607ca079e8c8732a8882f57e73ce1e10b99aa4220589dc1360fda1f9c96a6e3 |
container_end_page | 4120 |
container_issue | 18-19 |
container_start_page | 4105 |
container_title | International journal of production research |
container_volume | 44 |
creator | Dolgui, A. Finel, B. Guschinskaya, O. Guschinsky, N. Levin, G. Vernadat, F. |
description | 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 of 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 treats the obtained subsets independently. The second aggregates the solution of the previous subproblems. Results of their computational evaluation are reported. |
doi_str_mv | 10.1080/00207540600632232 |
format | article |
fullrecord | <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_proquest_journals_218653112</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>29109066</sourcerecordid><originalsourceid>FETCH-LOGICAL-c511t-8b607ca079e8c8732a8882f57e73ce1e10b99aa4220589dc1360fda1f9c96a6e3</originalsourceid><addsrcrecordid>eNqFkV1LHTEQhkOp4Kn6A7xbCi14sTpJzmYT6I0Vv-CAUBS8C2M264lkN6fJbtV_b7ZHLSjUuRmYPO9M3hlCdinsU5BwAMCgruYgAARnjLNPZEa5EGUl5fVnMpveywzwTfIlpTvIUcn5jPz6iR574_rbwmO8tWUy6G3RoVm6_m_V9TYV925YFt3oB1emleubjCwtNqkY0wQ11oRuFZIbXOi3yUaLPtmd57xFrk6OL4_OysXF6fnR4aI0FaVDKW8E1AahVlYaWXOGUkrWVrWtubHUUrhRCnHOWP6pakx2A22DtFVGCRSWb5G9dd8ler2KrsP4qAM6fXa40FMNgMtazPkfmtnva3YVw-_RpkF3Lhnrs3cbxqSZoqBAiAx-fQPehTH22YdmVIqKU8oyRNeQiSGlaNvX8RT0dA797hxZ8-25MU4rbuO09fRPKEEyxWTmfqw517chdngfom_0gI8-xBcR_9-Y-kP5O5UeHgb-BMkOrYs</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>218653112</pqid></control><display><type>article</type><title>Balancing large-scale machining lines with multi-spindle heads using decomposition</title><source>EBSCOhost Business Source Ultimate</source><source>Taylor and Francis:Jisc Collections:Taylor and Francis Read and Publish Agreement 2024-2025:Science and Technology Collection (Reading list)</source><creator>Dolgui, A. ; Finel, B. ; Guschinskaya, O. ; Guschinsky, N. ; Levin, G. ; Vernadat, F.</creator><creatorcontrib>Dolgui, A. ; Finel, B. ; Guschinskaya, O. ; Guschinsky, N. ; Levin, G. ; Vernadat, F.</creatorcontrib><description>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 of 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 treats the obtained subsets independently. The second aggregates the solution of the previous subproblems. Results of their computational evaluation are reported.</description><identifier>ISSN: 0020-7543</identifier><identifier>EISSN: 1366-588X</identifier><identifier>DOI: 10.1080/00207540600632232</identifier><identifier>CODEN: IJPRB8</identifier><language>eng</language><publisher>London: Taylor & Francis Group</publisher><subject>Applied sciences ; Assembly lines ; Automatic ; Decomposition ; Engineering Sciences ; Exact sciences and technology ; Heuristic ; Heuristics ; Integer programming ; Inventory control, production control. Distribution ; Line balancing ; Machine shops ; Machining lines ; Mathematical programming ; Operational research and scientific management ; Operational research. Management science ; Optimization ; Studies ; Work stations</subject><ispartof>International journal of production research, 2006-09, Vol.44 (18-19), p.4105-4120</ispartof><rights>Copyright Taylor & Francis Group, LLC 2006</rights><rights>2006 INIST-CNRS</rights><rights>Copyright Taylor & Francis Group Sep 15, 2006</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c511t-8b607ca079e8c8732a8882f57e73ce1e10b99aa4220589dc1360fda1f9c96a6e3</citedby><cites>FETCH-LOGICAL-c511t-8b607ca079e8c8732a8882f57e73ce1e10b99aa4220589dc1360fda1f9c96a6e3</cites><orcidid>0000-0003-3596-1699 ; 0000-0003-0527-4716 ; 0000-0002-5367-7846</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>230,309,310,314,780,784,789,790,885,23928,23929,25138,27922,27923</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=18082928$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttps://hal.science/hal-00387643$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Dolgui, A.</creatorcontrib><creatorcontrib>Finel, B.</creatorcontrib><creatorcontrib>Guschinskaya, O.</creatorcontrib><creatorcontrib>Guschinsky, N.</creatorcontrib><creatorcontrib>Levin, G.</creatorcontrib><creatorcontrib>Vernadat, F.</creatorcontrib><title>Balancing large-scale machining lines with multi-spindle heads using decomposition</title><title>International journal of production research</title><description>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 of 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 treats the obtained subsets independently. The second aggregates the solution of the previous subproblems. Results of their computational evaluation are reported.</description><subject>Applied sciences</subject><subject>Assembly lines</subject><subject>Automatic</subject><subject>Decomposition</subject><subject>Engineering Sciences</subject><subject>Exact sciences and technology</subject><subject>Heuristic</subject><subject>Heuristics</subject><subject>Integer programming</subject><subject>Inventory control, production control. Distribution</subject><subject>Line balancing</subject><subject>Machine shops</subject><subject>Machining lines</subject><subject>Mathematical programming</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Optimization</subject><subject>Studies</subject><subject>Work stations</subject><issn>0020-7543</issn><issn>1366-588X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2006</creationdate><recordtype>article</recordtype><recordid>eNqFkV1LHTEQhkOp4Kn6A7xbCi14sTpJzmYT6I0Vv-CAUBS8C2M264lkN6fJbtV_b7ZHLSjUuRmYPO9M3hlCdinsU5BwAMCgruYgAARnjLNPZEa5EGUl5fVnMpveywzwTfIlpTvIUcn5jPz6iR574_rbwmO8tWUy6G3RoVm6_m_V9TYV925YFt3oB1emleubjCwtNqkY0wQ11oRuFZIbXOi3yUaLPtmd57xFrk6OL4_OysXF6fnR4aI0FaVDKW8E1AahVlYaWXOGUkrWVrWtubHUUrhRCnHOWP6pakx2A22DtFVGCRSWb5G9dd8ler2KrsP4qAM6fXa40FMNgMtazPkfmtnva3YVw-_RpkF3Lhnrs3cbxqSZoqBAiAx-fQPehTH22YdmVIqKU8oyRNeQiSGlaNvX8RT0dA797hxZ8-25MU4rbuO09fRPKEEyxWTmfqw517chdngfom_0gI8-xBcR_9-Y-kP5O5UeHgb-BMkOrYs</recordid><startdate>20060915</startdate><enddate>20060915</enddate><creator>Dolgui, A.</creator><creator>Finel, B.</creator><creator>Guschinskaya, O.</creator><creator>Guschinsky, N.</creator><creator>Levin, G.</creator><creator>Vernadat, F.</creator><general>Taylor & Francis Group</general><general>Taylor & Francis</general><general>Taylor & Francis LLC</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>F28</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>1XC</scope><orcidid>https://orcid.org/0000-0003-3596-1699</orcidid><orcidid>https://orcid.org/0000-0003-0527-4716</orcidid><orcidid>https://orcid.org/0000-0002-5367-7846</orcidid></search><sort><creationdate>20060915</creationdate><title>Balancing large-scale machining lines with multi-spindle heads using decomposition</title><author>Dolgui, A. ; Finel, B. ; Guschinskaya, O. ; Guschinsky, N. ; Levin, G. ; Vernadat, F.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c511t-8b607ca079e8c8732a8882f57e73ce1e10b99aa4220589dc1360fda1f9c96a6e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Applied sciences</topic><topic>Assembly lines</topic><topic>Automatic</topic><topic>Decomposition</topic><topic>Engineering Sciences</topic><topic>Exact sciences and technology</topic><topic>Heuristic</topic><topic>Heuristics</topic><topic>Integer programming</topic><topic>Inventory control, production control. Distribution</topic><topic>Line balancing</topic><topic>Machine shops</topic><topic>Machining lines</topic><topic>Mathematical programming</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Optimization</topic><topic>Studies</topic><topic>Work stations</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Dolgui, A.</creatorcontrib><creatorcontrib>Finel, B.</creatorcontrib><creatorcontrib>Guschinskaya, O.</creatorcontrib><creatorcontrib>Guschinsky, N.</creatorcontrib><creatorcontrib>Levin, G.</creatorcontrib><creatorcontrib>Vernadat, F.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Hyper Article en Ligne (HAL)</collection><jtitle>International journal of production research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Dolgui, A.</au><au>Finel, B.</au><au>Guschinskaya, O.</au><au>Guschinsky, N.</au><au>Levin, G.</au><au>Vernadat, F.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Balancing large-scale machining lines with multi-spindle heads using decomposition</atitle><jtitle>International journal of production research</jtitle><date>2006-09-15</date><risdate>2006</risdate><volume>44</volume><issue>18-19</issue><spage>4105</spage><epage>4120</epage><pages>4105-4120</pages><issn>0020-7543</issn><eissn>1366-588X</eissn><coden>IJPRB8</coden><abstract>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 of 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 treats the obtained subsets independently. The second aggregates the solution of the previous subproblems. Results of their computational evaluation are reported.</abstract><cop>London</cop><cop>Washington, DC</cop><pub>Taylor & Francis Group</pub><doi>10.1080/00207540600632232</doi><tpages>16</tpages><orcidid>https://orcid.org/0000-0003-3596-1699</orcidid><orcidid>https://orcid.org/0000-0003-0527-4716</orcidid><orcidid>https://orcid.org/0000-0002-5367-7846</orcidid><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0020-7543 |
ispartof | International journal of production research, 2006-09, Vol.44 (18-19), p.4105-4120 |
issn | 0020-7543 1366-588X |
language | eng |
recordid | cdi_proquest_journals_218653112 |
source | EBSCOhost Business Source Ultimate; Taylor and Francis:Jisc Collections:Taylor and Francis Read and Publish Agreement 2024-2025:Science and Technology Collection (Reading list) |
subjects | Applied sciences Assembly lines Automatic Decomposition Engineering Sciences Exact sciences and technology Heuristic Heuristics Integer programming Inventory control, production control. Distribution Line balancing Machine shops Machining lines Mathematical programming Operational research and scientific management Operational research. Management science Optimization Studies Work stations |
title | Balancing large-scale machining lines with multi-spindle heads using decomposition |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T23%3A23%3A17IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Balancing%20large-scale%20machining%20lines%20with%20multi-spindle%20heads%20using%20decomposition&rft.jtitle=International%20journal%20of%20production%20research&rft.au=Dolgui,%20A.&rft.date=2006-09-15&rft.volume=44&rft.issue=18-19&rft.spage=4105&rft.epage=4120&rft.pages=4105-4120&rft.issn=0020-7543&rft.eissn=1366-588X&rft.coden=IJPRB8&rft_id=info:doi/10.1080/00207540600632232&rft_dat=%3Cproquest_pasca%3E29109066%3C/proquest_pasca%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c511t-8b607ca079e8c8732a8882f57e73ce1e10b99aa4220589dc1360fda1f9c96a6e3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=218653112&rft_id=info:pmid/&rfr_iscdi=true |