## Abstract Proposed is a Heuristic Network (HN) Procedure for balancing assembly lines. The procedure uses simple heuristic rules to generate a network which is then traversed using a shortest route algorithm to obtain a heuristic solution. The advantages of the HN Procedure are: a) it generally y
β¦ LIBER β¦
A random search and backtracking procedure for transfer line balancing
β Scribed by Finel, B.; Dolgui, A.; Vernadat, F.
- Book ID
- 126822678
- Publisher
- Taylor and Francis Group
- Year
- 2008
- Tongue
- English
- Weight
- 772 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0951-192X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A heuristic network procedure for the as
β
Peter A. Pinto; David G. Dannenbring; Basheer M. Khumawala
π
Article
π
1978
π
John Wiley and Sons
π
English
β 417 KB
A tabu search algorithm for balancing a
β
Kalayci, Can B.; Gupta, Surendra M.
π
Article
π
2013
π
Taylor and Francis Group
π
English
β 393 KB
Backtracking and exchange of information
β
Δ°hsan SabuncuoΔlu; Yasin Gocgun; Erdal Erel
π
Article
π
2008
π
Elsevier Science
π
English
β 250 KB
A stabilization procedure by line-search
β
R. Mahnken; E. Stein; D. Bischoff
π
Article
π
1992
π
John Wiley and Sons
π
English
β 672 KB
The paper is concerned with first order approximation methods to solve non-linear optimization problems as they arise in structural optimization. A modification of the original Method of Moving Asymptotes (MMA) is presented to prevent oscillation or divergence by incorporating a line-search into the
Exact and heuristic algorithms for balan
β
Alexandre Dolgui; Nikolai Guschinsky; Genrikh Levin
π
Article
π
2008
π
John Wiley and Sons
π
English
β 178 KB
Tabu Search Algorithms for an Industrial
β
R. Pastor, C. AndrΓ©s, A. Duran and M. PΓ©rez
π
Article
π
2002
π
Palgrave Publishers Ltd.
π
English
β 285 KB