Packing items to feed assembly lines

We treat a practical application of packing problems in feeding assembly lines. This study was motivated by a real situation encountered in the shop floor of a major automobile industry plant in Brazil. The assembly line feed problem (LFP) consists in how pack the items in the available containers t...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 2008-01, Vol.184 (2), p.480-489
Main Authors: de Souza, Mauricio C., de Carvalho, Carlos R.V., Brizon, Wellington B.
Format: Article
Language:English
Subjects:
Assembly lines
Automobile industry
GRASP
Heuristic
Integer programming
Metaheuristics
Packing
Packing problem
Shop floor logistics
Studies
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-c449t-8a673136e6159a685646b0404e9a8aec7381f3efd23af6fa1e8bd124e9bee75d3
cites cdi_FETCH-LOGICAL-c449t-8a673136e6159a685646b0404e9a8aec7381f3efd23af6fa1e8bd124e9bee75d3
container_end_page 489
container_issue 2
container_start_page 480
container_title European journal of operational research
container_volume 184
creator de Souza, Mauricio C.
de Carvalho, Carlos R.V.
Brizon, Wellington B.
description We treat a practical application of packing problems in feeding assembly lines. This study was motivated by a real situation encountered in the shop floor of a major automobile industry plant in Brazil. The assembly line feed problem (LFP) consists in how pack the items in the available containers to meet the line work centers’ requirements with a minimum total cost over the planning horizon. LFP is a variable-sized bin packing problem that has two special features: (i) a cardinality constraint on each bin’s size; and, (ii) a cost structure such that each bin’s cost varies according to the items that are packed in it. We propose an integer programming model and a GRASP heuristic for LFP. Numerical results on real-life test instances are reported.
doi_str_mv 10.1016/j.ejor.2006.09.091
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_204141045</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0377221706011453</els_id><sourcerecordid>1338230611</sourcerecordid><originalsourceid>FETCH-LOGICAL-c449t-8a673136e6159a685646b0404e9a8aec7381f3efd23af6fa1e8bd124e9bee75d3</originalsourceid><addsrcrecordid>eNp9UE1LxDAQDaLguvoHPBXx2jqTpmkKXmTxCxf0oOeQtlNN3W5rUhf235tS8WiYlxnIey_DY-wcIUFAedUm1PYu4QAygSIUHrAFqpzHUkk4ZAtI8zzmHPNjduJ9CwCYYbZgly-m-rTb98iO1Plo7KOGqI6M99SVm320sVvyp-yoMRtPZ799yd7ubl9XD_H6-f5xdbOOKyGKMVZG5immkiRmhZEqk0KWIEBQYZShKk8VNik1NU9NIxuDpMoaeXguifKsTpfsYvYdXP_1TX7Ubf_ttuFLzUGgQBBZIPGZVLnee0eNHpztjNtrBD2FoVs9haGnMDQUoTCInmaRo4GqPwWFE6jk9U6nBpUI9z4gSFVodhoDhgChQAtV6I-xC27XsxuFMHaWnPaVpW1FtXVUjbru7X_L_ADr9H_h</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>204141045</pqid></control><display><type>article</type><title>Packing items to feed assembly lines</title><source>ScienceDirect Freedom Collection</source><creator>de Souza, Mauricio C. ; de Carvalho, Carlos R.V. ; Brizon, Wellington B.</creator><creatorcontrib>de Souza, Mauricio C. ; de Carvalho, Carlos R.V. ; Brizon, Wellington B.</creatorcontrib><description>We treat a practical application of packing problems in feeding assembly lines. This study was motivated by a real situation encountered in the shop floor of a major automobile industry plant in Brazil. The assembly line feed problem (LFP) consists in how pack the items in the available containers to meet the line work centers’ requirements with a minimum total cost over the planning horizon. LFP is a variable-sized bin packing problem that has two special features: (i) a cardinality constraint on each bin’s size; and, (ii) a cost structure such that each bin’s cost varies according to the items that are packed in it. We propose an integer programming model and a GRASP heuristic for LFP. Numerical results on real-life test instances are reported.</description><identifier>ISSN: 0377-2217</identifier><identifier>EISSN: 1872-6860</identifier><identifier>DOI: 10.1016/j.ejor.2006.09.091</identifier><identifier>CODEN: EJORDT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Assembly lines ; Automobile industry ; GRASP ; Heuristic ; Integer programming ; Metaheuristics ; Packing ; Packing problem ; Shop floor logistics ; Studies</subject><ispartof>European journal of operational research, 2008-01, Vol.184 (2), p.480-489</ispartof><rights>2006 Elsevier B.V.</rights><rights>Copyright Elsevier Sequoia S.A. Jan 16, 2008</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c449t-8a673136e6159a685646b0404e9a8aec7381f3efd23af6fa1e8bd124e9bee75d3</citedby><cites>FETCH-LOGICAL-c449t-8a673136e6159a685646b0404e9a8aec7381f3efd23af6fa1e8bd124e9bee75d3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids><backlink>$$Uhttp://econpapers.repec.org/article/eeeejores/v_3a184_3ay_3a2008_3ai_3a2_3ap_3a480-489.htm$$DView record in RePEc$$Hfree_for_read</backlink></links><search><creatorcontrib>de Souza, Mauricio C.</creatorcontrib><creatorcontrib>de Carvalho, Carlos R.V.</creatorcontrib><creatorcontrib>Brizon, Wellington B.</creatorcontrib><title>Packing items to feed assembly lines</title><title>European journal of operational research</title><description>We treat a practical application of packing problems in feeding assembly lines. This study was motivated by a real situation encountered in the shop floor of a major automobile industry plant in Brazil. The assembly line feed problem (LFP) consists in how pack the items in the available containers to meet the line work centers’ requirements with a minimum total cost over the planning horizon. LFP is a variable-sized bin packing problem that has two special features: (i) a cardinality constraint on each bin’s size; and, (ii) a cost structure such that each bin’s cost varies according to the items that are packed in it. We propose an integer programming model and a GRASP heuristic for LFP. Numerical results on real-life test instances are reported.</description><subject>Assembly lines</subject><subject>Automobile industry</subject><subject>GRASP</subject><subject>Heuristic</subject><subject>Integer programming</subject><subject>Metaheuristics</subject><subject>Packing</subject><subject>Packing problem</subject><subject>Shop floor logistics</subject><subject>Studies</subject><issn>0377-2217</issn><issn>1872-6860</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2008</creationdate><recordtype>article</recordtype><recordid>eNp9UE1LxDAQDaLguvoHPBXx2jqTpmkKXmTxCxf0oOeQtlNN3W5rUhf235tS8WiYlxnIey_DY-wcIUFAedUm1PYu4QAygSIUHrAFqpzHUkk4ZAtI8zzmHPNjduJ9CwCYYbZgly-m-rTb98iO1Plo7KOGqI6M99SVm320sVvyp-yoMRtPZ799yd7ubl9XD_H6-f5xdbOOKyGKMVZG5immkiRmhZEqk0KWIEBQYZShKk8VNik1NU9NIxuDpMoaeXguifKsTpfsYvYdXP_1TX7Ubf_ttuFLzUGgQBBZIPGZVLnee0eNHpztjNtrBD2FoVs9haGnMDQUoTCInmaRo4GqPwWFE6jk9U6nBpUI9z4gSFVodhoDhgChQAtV6I-xC27XsxuFMHaWnPaVpW1FtXVUjbru7X_L_ADr9H_h</recordid><startdate>20080116</startdate><enddate>20080116</enddate><creator>de Souza, Mauricio C.</creator><creator>de Carvalho, Carlos R.V.</creator><creator>Brizon, Wellington B.</creator><general>Elsevier B.V</general><general>Elsevier</general><general>Elsevier Sequoia S.A</general><scope>DKI</scope><scope>X2L</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20080116</creationdate><title>Packing items to feed assembly lines</title><author>de Souza, Mauricio C. ; de Carvalho, Carlos R.V. ; Brizon, Wellington B.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c449t-8a673136e6159a685646b0404e9a8aec7381f3efd23af6fa1e8bd124e9bee75d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Assembly lines</topic><topic>Automobile industry</topic><topic>GRASP</topic><topic>Heuristic</topic><topic>Integer programming</topic><topic>Metaheuristics</topic><topic>Packing</topic><topic>Packing problem</topic><topic>Shop floor logistics</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>de Souza, Mauricio C.</creatorcontrib><creatorcontrib>de Carvalho, Carlos R.V.</creatorcontrib><creatorcontrib>Brizon, Wellington B.</creatorcontrib><collection>RePEc IDEAS</collection><collection>RePEc</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>Technology Research Database</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><jtitle>European journal of operational research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>de Souza, Mauricio C.</au><au>de Carvalho, Carlos R.V.</au><au>Brizon, Wellington B.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Packing items to feed assembly lines</atitle><jtitle>European journal of operational research</jtitle><date>2008-01-16</date><risdate>2008</risdate><volume>184</volume><issue>2</issue><spage>480</spage><epage>489</epage><pages>480-489</pages><issn>0377-2217</issn><eissn>1872-6860</eissn><coden>EJORDT</coden><abstract>We treat a practical application of packing problems in feeding assembly lines. This study was motivated by a real situation encountered in the shop floor of a major automobile industry plant in Brazil. The assembly line feed problem (LFP) consists in how pack the items in the available containers to meet the line work centers’ requirements with a minimum total cost over the planning horizon. LFP is a variable-sized bin packing problem that has two special features: (i) a cardinality constraint on each bin’s size; and, (ii) a cost structure such that each bin’s cost varies according to the items that are packed in it. We propose an integer programming model and a GRASP heuristic for LFP. Numerical results on real-life test instances are reported.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.ejor.2006.09.091</doi><tpages>10</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0377-2217
ispartof European journal of operational research, 2008-01, Vol.184 (2), p.480-489
issn 0377-2217
1872-6860
language eng
recordid cdi_proquest_journals_204141045
source ScienceDirect Freedom Collection
subjects Assembly lines
Automobile industry
GRASP
Heuristic
Integer programming
Metaheuristics
Packing
Packing problem
Shop floor logistics
Studies
title Packing items to feed assembly lines
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T23%3A24%3A54IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Packing%20items%20to%20feed%20assembly%20lines&rft.jtitle=European%20journal%20of%20operational%20research&rft.au=de%20Souza,%20Mauricio%20C.&rft.date=2008-01-16&rft.volume=184&rft.issue=2&rft.spage=480&rft.epage=489&rft.pages=480-489&rft.issn=0377-2217&rft.eissn=1872-6860&rft.coden=EJORDT&rft_id=info:doi/10.1016/j.ejor.2006.09.091&rft_dat=%3Cproquest_cross%3E1338230611%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c449t-8a673136e6159a685646b0404e9a8aec7381f3efd23af6fa1e8bd124e9bee75d3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=204141045&rft_id=info:pmid/&rfr_iscdi=true