An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset

An application of the branch, bound, and remember algorithm to a new simple assembly line... 1 Introduction</h5> The assembly line balancing problem is a well-studied problem with many applications, including the automotive industry, consumer electronics, and household items ( Baybars, 1986; Sarker & Pan, 2001 ). This problem has many variants with different objectives and side constraints; see Battaïa and Dolgui (2013) for a recent survey of problem formulations and solution techniques. One of the most basic assembly line balancing problems is the Simple Assembly Line Balancing Problem (SALBP). In this problem, a set of tasks T = { 1 , 2 , … , n } is given that must be accomplished by a set of workers or stations. In many applications, stations are designed to complete specific tasks; however, the SALBP relaxes this assumption so that all stations are considered identical. Each task requires a certain amount of time t j (called the processing time ) to complete, and each station has a specified fixed amount of time c (called the cycle time ) that it can spend completing tasks.</P>Additionally, a directed acyclic graph G , called the precedence graph , is given with vertex set T and arc set A . An arc ( i , j ) ∈ A http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png European Journal of Operational Research Elsevier

An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset

Loading next page...
 
/lp/elsevier/an-application-of-the-branch-bound-and-remember-algorithm-to-a-new-OElaxBPjKa
Publisher
Elsevier
Copyright
Copyright © 2013 Elsevier B.V.
ISSN
0377-2217
eISSN
1872-6860
D.O.I.
10.1016/j.ejor.2013.11.033
Publisher site
See Article on Publisher Site

Abstract

1 Introduction</h5> The assembly line balancing problem is a well-studied problem with many applications, including the automotive industry, consumer electronics, and household items ( Baybars, 1986; Sarker & Pan, 2001 ). This problem has many variants with different objectives and side constraints; see Battaïa and Dolgui (2013) for a recent survey of problem formulations and solution techniques. One of the most basic assembly line balancing problems is the Simple Assembly Line Balancing Problem (SALBP). In this problem, a set of tasks T = { 1 , 2 , … , n } is given that must be accomplished by a set of workers or stations. In many applications, stations are designed to complete specific tasks; however, the SALBP relaxes this assumption so that all stations are considered identical. Each task requires a certain amount of time t j (called the processing time ) to complete, and each station has a specified fixed amount of time c (called the cycle time ) that it can spend completing tasks.</P>Additionally, a directed acyclic graph G , called the precedence graph , is given with vertex set T and arc set A . An arc ( i , j ) ∈ A

Journal

European Journal of Operational ResearchElsevier

Published: Jul 16, 2014

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off