Heuristics and lower bounds for the simple assembly line balancing problem type 1: Overview, computational tests and improvements

Heuristics and lower bounds for the simple assembly line balancing problem type 1: Overview,... 1 Introduction</h5> Assembly lines are a common way to organise mass production of standardised products. They consist of ordered stations along a conveyor belt to which a set of tasks is assigned to. The cycle time determines how much time the stations’ workers and/or machines have to fulfil their tasks before passing on the workpiece to the next following station.</P>The simple assembly line balancing problem type 1 (SALBP-1) is a fundamental and well-studied problem of assembly line design ( Baybars, 1986; Scholl, 1999 ). The tasks j = 1, … , n are defined by task times t j and their positions within the precedence graph. The goal is to minimise m as number of loaded stations given a fixed cycle time c . A list of all used symbols can be found in Table 1 . Fig. 1 illustrates SALBP-1 exemplarily. The nodes (tasks) of the precedence graph are indexed from 1 to 8 and above them stand their task times t j . For SALBP-1 a solution is feasible if (i) the tasks of each station do not have a task time sum larger than c and (ii) no direct or indirect predecessor of any task http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png European Journal of Operational Research Elsevier

Heuristics and lower bounds for the simple assembly line balancing problem type 1: Overview, computational tests and improvements

Loading next page...
 
/lp/elsevier/heuristics-and-lower-bounds-for-the-simple-assembly-line-balancing-fpq7gzk2wC
Publisher
Elsevier
Copyright
Copyright © 2014 The Author
ISSN
0377-2217
eISSN
1872-6860
D.O.I.
10.1016/j.ejor.2014.06.023
Publisher site
See Article on Publisher Site

Abstract

1 Introduction</h5> Assembly lines are a common way to organise mass production of standardised products. They consist of ordered stations along a conveyor belt to which a set of tasks is assigned to. The cycle time determines how much time the stations’ workers and/or machines have to fulfil their tasks before passing on the workpiece to the next following station.</P>The simple assembly line balancing problem type 1 (SALBP-1) is a fundamental and well-studied problem of assembly line design ( Baybars, 1986; Scholl, 1999 ). The tasks j = 1, … , n are defined by task times t j and their positions within the precedence graph. The goal is to minimise m as number of loaded stations given a fixed cycle time c . A list of all used symbols can be found in Table 1 . Fig. 1 illustrates SALBP-1 exemplarily. The nodes (tasks) of the precedence graph are indexed from 1 to 8 and above them stand their task times t j . For SALBP-1 a solution is feasible if (i) the tasks of each station do not have a task time sum larger than c and (ii) no direct or indirect predecessor of any task

Journal

European Journal of Operational ResearchElsevier

Published: Jan 1, 2015

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