Loading…

Procedures for the Time and Space constrained Assembly Line Balancing Problem

The Time and Space constrained Assembly Line Balancing Problem (TSALBP) is a variant of the classical Simple Assembly Line Balancing Problem that additionally accounts for the space requirements of machinery and assembled parts. The present work proposes an adaptation of the Bounded Dynamic Programm...

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research 2011-08, Vol.212 (3), p.473-481
Main Authors:	Bautista, Joaquín, Pereira, Jordi
Format:	Article
Language:	English
Subjects:	Adaptation Applied sciences Assembly Line Balancing Assembly lines Availability Bounded Dynamic Programming Column generation Constraints Cycle time Dynamic programming Exact sciences and technology Inventory control, production control. Distribution Lower bounds Machinery Manufacturing Manufacturing Assembly Line Balancing Lower bounds Column generation Bounded Dynamic Programming Mathematical programming Operational research Operational research and scientific management Operational research. Management science Optimization algorithms Production scheduling Reliability theory. Replacement problems 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-c488t-5c8c1a60cd453e7af38db59cd54ffe83812bbef879ae84ecf0781211a237a7b83
cites	cdi_FETCH-LOGICAL-c488t-5c8c1a60cd453e7af38db59cd54ffe83812bbef879ae84ecf0781211a237a7b83
container_end_page	481
container_issue	3
container_start_page	473
container_title	European journal of operational research
container_volume	212
creator	Bautista, Joaquín Pereira, Jordi
description	The Time and Space constrained Assembly Line Balancing Problem (TSALBP) is a variant of the classical Simple Assembly Line Balancing Problem that additionally accounts for the space requirements of machinery and assembled parts. The present work proposes an adaptation of the Bounded Dynamic Programming (BDP) method to solve the TSALBP variant with fixed cycle time and area availability. Additionally, different lower bounds for the simple case are extended to support the BDP method as well as to assess the quality of the obtained solutions. Our results indicate that the proposed bounds and solution procedures outperform any other previous approach found in the literature.
doi_str_mv	10.1016/j.ejor.2011.01.052
format	article
fullrecord	<record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_875064037</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0377221711001068</els_id><sourcerecordid>2322836581</sourcerecordid><originalsourceid>FETCH-LOGICAL-c488t-5c8c1a60cd453e7af38db59cd54ffe83812bbef879ae84ecf0781211a237a7b83</originalsourceid><addsrcrecordid>eNp9UU2L1TAULaLgc_QPuAqCuOozn00KbsZBncEnCo7rkKY3Tkrb1KRv4P17b3nDLFwY7s0X5xxOTqrqNaN7RlnzftjDkPKeU8b2FEvxJ9WOGc3rxjT0abWjQuuac6afVy9KGSilTDG1q779yMlDf8xQSEiZrHdAbuMExM09-bk4D8SnuazZxRl6clkKTN14Igc8ko9udLOP82-CKt0I08vqWXBjgVcP60X16_On26vr-vD9y83V5aH20pi1Vt545hrqe6kEaBeE6TvV-l7JEMAIw3jXQTC6dWAk-EA1XjHmuNBOd0ZcVO_OuktOf45QVjvF4mFEO5COxRqtaCPxzYh88w9ySMc8ozlrGs5bJluOIH4G-ZxKyRDskuPk8skyard87WC3fO2Wr6VYaiN9PZMyLOAfGYADoVDsvRWOM47zadttVOEitsBesKUWVhpm79YJ1d4--HTFuzHkLdjyqMolbVujGOI-nHGA8d5HyLb4CDN-YczgV9un-D_TfwGpv6lY</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>862291492</pqid></control><display><type>article</type><title>Procedures for the Time and Space constrained Assembly Line Balancing Problem</title><source>ScienceDirect Journals</source><creator>Bautista, Joaquín ; Pereira, Jordi</creator><creatorcontrib>Bautista, Joaquín ; Pereira, Jordi</creatorcontrib><description>The Time and Space constrained Assembly Line Balancing Problem (TSALBP) is a variant of the classical Simple Assembly Line Balancing Problem that additionally accounts for the space requirements of machinery and assembled parts. The present work proposes an adaptation of the Bounded Dynamic Programming (BDP) method to solve the TSALBP variant with fixed cycle time and area availability. Additionally, different lower bounds for the simple case are extended to support the BDP method as well as to assess the quality of the obtained solutions. Our results indicate that the proposed bounds and solution procedures outperform any other previous approach found in the literature.</description><identifier>ISSN: 0377-2217</identifier><identifier>EISSN: 1872-6860</identifier><identifier>DOI: 10.1016/j.ejor.2011.01.052</identifier><identifier>CODEN: EJORDT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Adaptation ; Applied sciences ; Assembly Line Balancing ; Assembly lines ; Availability ; Bounded Dynamic Programming ; Column generation ; Constraints ; Cycle time ; Dynamic programming ; Exact sciences and technology ; Inventory control, production control. Distribution ; Lower bounds ; Machinery ; Manufacturing ; Manufacturing Assembly Line Balancing Lower bounds Column generation Bounded Dynamic Programming ; Mathematical programming ; Operational research ; Operational research and scientific management ; Operational research. Management science ; Optimization algorithms ; Production scheduling ; Reliability theory. Replacement problems ; Studies</subject><ispartof>European journal of operational research, 2011-08, Vol.212 (3), p.473-481</ispartof><rights>2011 Elsevier B.V.</rights><rights>2015 INIST-CNRS</rights><rights>Copyright Elsevier Sequoia S.A. Aug 1, 2011</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c488t-5c8c1a60cd453e7af38db59cd54ffe83812bbef879ae84ecf0781211a237a7b83</citedby><cites>FETCH-LOGICAL-c488t-5c8c1a60cd453e7af38db59cd54ffe83812bbef879ae84ecf0781211a237a7b83</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://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=24099851$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttp://econpapers.repec.org/article/eeeejores/v_3a212_3ay_3a2011_3ai_3a3_3ap_3a473-481.htm$$DView record in RePEc$$Hfree_for_read</backlink></links><search><creatorcontrib>Bautista, Joaquín</creatorcontrib><creatorcontrib>Pereira, Jordi</creatorcontrib><title>Procedures for the Time and Space constrained Assembly Line Balancing Problem</title><title>European journal of operational research</title><description>The Time and Space constrained Assembly Line Balancing Problem (TSALBP) is a variant of the classical Simple Assembly Line Balancing Problem that additionally accounts for the space requirements of machinery and assembled parts. The present work proposes an adaptation of the Bounded Dynamic Programming (BDP) method to solve the TSALBP variant with fixed cycle time and area availability. Additionally, different lower bounds for the simple case are extended to support the BDP method as well as to assess the quality of the obtained solutions. Our results indicate that the proposed bounds and solution procedures outperform any other previous approach found in the literature.</description><subject>Adaptation</subject><subject>Applied sciences</subject><subject>Assembly Line Balancing</subject><subject>Assembly lines</subject><subject>Availability</subject><subject>Bounded Dynamic Programming</subject><subject>Column generation</subject><subject>Constraints</subject><subject>Cycle time</subject><subject>Dynamic programming</subject><subject>Exact sciences and technology</subject><subject>Inventory control, production control. Distribution</subject><subject>Lower bounds</subject><subject>Machinery</subject><subject>Manufacturing</subject><subject>Manufacturing Assembly Line Balancing Lower bounds Column generation Bounded Dynamic Programming</subject><subject>Mathematical programming</subject><subject>Operational research</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Optimization algorithms</subject><subject>Production scheduling</subject><subject>Reliability theory. Replacement problems</subject><subject>Studies</subject><issn>0377-2217</issn><issn>1872-6860</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><recordid>eNp9UU2L1TAULaLgc_QPuAqCuOozn00KbsZBncEnCo7rkKY3Tkrb1KRv4P17b3nDLFwY7s0X5xxOTqrqNaN7RlnzftjDkPKeU8b2FEvxJ9WOGc3rxjT0abWjQuuac6afVy9KGSilTDG1q779yMlDf8xQSEiZrHdAbuMExM09-bk4D8SnuazZxRl6clkKTN14Igc8ko9udLOP82-CKt0I08vqWXBjgVcP60X16_On26vr-vD9y83V5aH20pi1Vt545hrqe6kEaBeE6TvV-l7JEMAIw3jXQTC6dWAk-EA1XjHmuNBOd0ZcVO_OuktOf45QVjvF4mFEO5COxRqtaCPxzYh88w9ySMc8ozlrGs5bJluOIH4G-ZxKyRDskuPk8skyard87WC3fO2Wr6VYaiN9PZMyLOAfGYADoVDsvRWOM47zadttVOEitsBesKUWVhpm79YJ1d4--HTFuzHkLdjyqMolbVujGOI-nHGA8d5HyLb4CDN-YczgV9un-D_TfwGpv6lY</recordid><startdate>20110801</startdate><enddate>20110801</enddate><creator>Bautista, Joaquín</creator><creator>Pereira, Jordi</creator><general>Elsevier B.V</general><general>Elsevier</general><general>Elsevier Sequoia S.A</general><scope>IQODW</scope><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><scope>7TA</scope><scope>JG9</scope></search><sort><creationdate>20110801</creationdate><title>Procedures for the Time and Space constrained Assembly Line Balancing Problem</title><author>Bautista, Joaquín ; Pereira, Jordi</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c488t-5c8c1a60cd453e7af38db59cd54ffe83812bbef879ae84ecf0781211a237a7b83</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Adaptation</topic><topic>Applied sciences</topic><topic>Assembly Line Balancing</topic><topic>Assembly lines</topic><topic>Availability</topic><topic>Bounded Dynamic Programming</topic><topic>Column generation</topic><topic>Constraints</topic><topic>Cycle time</topic><topic>Dynamic programming</topic><topic>Exact sciences and technology</topic><topic>Inventory control, production control. Distribution</topic><topic>Lower bounds</topic><topic>Machinery</topic><topic>Manufacturing</topic><topic>Manufacturing Assembly Line Balancing Lower bounds Column generation Bounded Dynamic Programming</topic><topic>Mathematical programming</topic><topic>Operational research</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Optimization algorithms</topic><topic>Production scheduling</topic><topic>Reliability theory. Replacement problems</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bautista, Joaquín</creatorcontrib><creatorcontrib>Pereira, Jordi</creatorcontrib><collection>Pascal-Francis</collection><collection>RePEc IDEAS</collection><collection>RePEc</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical & 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><collection>Materials Business File</collection><collection>Materials Research Database</collection><jtitle>European journal of operational research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Bautista, Joaquín</au><au>Pereira, Jordi</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Procedures for the Time and Space constrained Assembly Line Balancing Problem</atitle><jtitle>European journal of operational research</jtitle><date>2011-08-01</date><risdate>2011</risdate><volume>212</volume><issue>3</issue><spage>473</spage><epage>481</epage><pages>473-481</pages><issn>0377-2217</issn><eissn>1872-6860</eissn><coden>EJORDT</coden><abstract>The Time and Space constrained Assembly Line Balancing Problem (TSALBP) is a variant of the classical Simple Assembly Line Balancing Problem that additionally accounts for the space requirements of machinery and assembled parts. The present work proposes an adaptation of the Bounded Dynamic Programming (BDP) method to solve the TSALBP variant with fixed cycle time and area availability. Additionally, different lower bounds for the simple case are extended to support the BDP method as well as to assess the quality of the obtained solutions. Our results indicate that the proposed bounds and solution procedures outperform any other previous approach found in the literature.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.ejor.2011.01.052</doi><tpages>9</tpages></addata></record>
fulltext	fulltext
identifier	ISSN: 0377-2217
ispartof	European journal of operational research, 2011-08, Vol.212 (3), p.473-481
issn	0377-2217 1872-6860
language	eng
recordid	cdi_proquest_miscellaneous_875064037
source	ScienceDirect Journals
subjects	Adaptation Applied sciences Assembly Line Balancing Assembly lines Availability Bounded Dynamic Programming Column generation Constraints Cycle time Dynamic programming Exact sciences and technology Inventory control, production control. Distribution Lower bounds Machinery Manufacturing Manufacturing Assembly Line Balancing Lower bounds Column generation Bounded Dynamic Programming Mathematical programming Operational research Operational research and scientific management Operational research. Management science Optimization algorithms Production scheduling Reliability theory. Replacement problems Studies
title	Procedures for the Time and Space constrained Assembly Line Balancing Problem
url	http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T03%3A08%3A23IST&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=Procedures%20for%20the%20Time%20and%20Space%20constrained%20Assembly%20Line%20Balancing%20Problem&rft.jtitle=European%20journal%20of%20operational%20research&rft.au=Bautista,%20Joaqu%C3%ADn&rft.date=2011-08-01&rft.volume=212&rft.issue=3&rft.spage=473&rft.epage=481&rft.pages=473-481&rft.issn=0377-2217&rft.eissn=1872-6860&rft.coden=EJORDT&rft_id=info:doi/10.1016/j.ejor.2011.01.052&rft_dat=%3Cproquest_cross%3E2322836581%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c488t-5c8c1a60cd453e7af38db59cd54ffe83812bbef879ae84ecf0781211a237a7b83%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=862291492&rft_id=info:pmid/&rfr_iscdi=true