An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time

An enumeration procedure for the assembly line balancing problem based on branching by... 1 Introduction</h5> An assembly line is a production system most commonly used in the flow-line production of goods on an industrial scale. It consists of m workstations connected by a conveyor belt or similar mechanical device. As unfinished products travel from station to station, certain operations are performed to obtain the final product. The indivisible operations necessary to finish a product are known as tasks j = 1, … , n and require a fixed operation time t j to be completed.</P>The conveyor belt speed determines the output rate and the time in which each task must be completed before moving on to the next station. The available time is the same for every station and is referred to as cycle time c . The total operation time of the tasks assigned to each station can never exceed the cycle time.</P>Additionally, some tasks may not be able to start until another task has been completed. These precedence constraints must be fulfilled (i.e., if any task i assigned to station k precedes a task j assigned to station h , then h ⩾ k must hold).</P>The simple assembly line balancing problem type 1 (SALBP-1) consists of assigning each task http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png European Journal of Operational Research Elsevier

An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time

Loading next page...
 
/lp/elsevier/an-enumeration-procedure-for-the-assembly-line-balancing-problem-based-zczKnjOneG
Publisher
Elsevier
Copyright
Copyright © 2013 Elsevier B.V.
ISSN
0377-2217
eISSN
1872-6860
D.O.I.
10.1016/j.ejor.2013.03.003
Publisher site
See Article on Publisher Site

Abstract

1 Introduction</h5> An assembly line is a production system most commonly used in the flow-line production of goods on an industrial scale. It consists of m workstations connected by a conveyor belt or similar mechanical device. As unfinished products travel from station to station, certain operations are performed to obtain the final product. The indivisible operations necessary to finish a product are known as tasks j = 1, … , n and require a fixed operation time t j to be completed.</P>The conveyor belt speed determines the output rate and the time in which each task must be completed before moving on to the next station. The available time is the same for every station and is referred to as cycle time c . The total operation time of the tasks assigned to each station can never exceed the cycle time.</P>Additionally, some tasks may not be able to start until another task has been completed. These precedence constraints must be fulfilled (i.e., if any task i assigned to station k precedes a task j assigned to station h , then h ⩾ k must hold).</P>The simple assembly line balancing problem type 1 (SALBP-1) consists of assigning each task

Journal

European Journal of Operational ResearchElsevier

Published: Aug 16, 2013

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