Search engine :
Return to the menu
| : /
Vote:
Results:
4 Votes
JANUARY-DECEMBER 2013 - Volume: 1 - Pages: [10 p.]
Download pdf
This paper focus in the description and evaluation of a new Greedy heuristic to solve assembly line balancing problems type-I (SALBPs-1), which is based in sequence of activities and their operation time to have an approximation more adequate of work stations. Here we show a comparative evaluation of this heuristic with others 14 of same type, among these positional weight, biggest number of successor tasks, longest operation time and biggest number of successor immediate tasks. We used 269 problems for the comparative evaluation, where each heuristic was codified in software MATLAB 2009b. The results show us that the JOMI heuristic generates very good solutions with the best average of efficiency 90,24%; showing so other simple and feasible way to solve balancing line problems.Keywords: Balance, heuristic, assembly line, sequence, operation time.
Share:
© Dyna Management journal 2013
EDITORIAL: Publicaciones DYNA SL
Adress: Alameda Mazarredo 69 - 2º, 48009-Bilbao SPAIN
Email:info@dyna-management.com - Web site: www.dyna-management.com
Regístrese en un paso con su email y podrá personalizar sus preferencias mediante su perfil
Name: *
Surname 1: *
Surname 2:
Email: *