An enumerative heuristic and reduction methods for the assembly line balancing problem

An enumerative heuristic and reduction methods for the assembly line balancing problem A new heuristic algorithm and new reduction techniques for the type 1 assembly line balancing problem are presented. The new heuristic is based on the well-known Hoffmann heuristic and builds solutions from both sides of the precedence network to choose the best. The reduction techniques aim at augmenting precedences, conjoining tasks and increasing operation times. The heuristic is tested on its own and also in combination with the reduction techniques. The tests, which are carried out on a well-known benchmark set of problem instances, testify to the efficacy of the combined algorithm, in terms of both solution quality and optimality verification, as well as to its computational efficiency. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png European Journal of Operational Research Elsevier

An enumerative heuristic and reduction methods for the assembly line balancing problem

Loading next page...
 
/lp/elsevier/an-enumerative-heuristic-and-reduction-methods-for-the-assembly-line-7rMqUc8kO6
Publisher
Elsevier
Copyright
Copyright © 2002 Elsevier Science B.V.
ISSN
0377-2217
eISSN
1872-6860
D.O.I.
10.1016/S0377-2217(02)00204-7
Publisher site
See Article on Publisher Site

Abstract

A new heuristic algorithm and new reduction techniques for the type 1 assembly line balancing problem are presented. The new heuristic is based on the well-known Hoffmann heuristic and builds solutions from both sides of the precedence network to choose the best. The reduction techniques aim at augmenting precedences, conjoining tasks and increasing operation times. The heuristic is tested on its own and also in combination with the reduction techniques. The tests, which are carried out on a well-known benchmark set of problem instances, testify to the efficacy of the combined algorithm, in terms of both solution quality and optimality verification, as well as to its computational efficiency.

Journal

European Journal of Operational ResearchElsevier

Published: Mar 16, 2003

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