Multi-rule Multi-objective Simulated Annealing Algorithm for Straight and U Type Assembly Line Balancing Problems

The task of balancing of assembly lines is of considerable industrial importance. It consists of assigning operations to workstations in a production line in such a way that (1) no assembly precedence constraint is violated, (2) no workstations in the line takes longer than a predefined cycle time t...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of intelligent manufacturing Ročník 17; číslo 2; s. 217 - 232
Hlavní autor: Baykasoglu, Adil
Médium: Journal Article
Jazyk:angličtina
Vydáno: London Springer Nature B.V 01.04.2006
Témata:
Algorithms
Assembly lines
Genetic algorithms
Heuristic
Manufacturing
Operations research
Optimization
Production scheduling
Studies
Work stations
ISSN:0956-5515, 1572-8145
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The task of balancing of assembly lines is of considerable industrial importance. It consists of assigning operations to workstations in a production line in such a way that (1) no assembly precedence constraint is violated, (2) no workstations in the line takes longer than a predefined cycle time to perform all tasks assigned to it, and (3) as few workstations as possible are needed to perform all the tasks in the set. This paper presents a new multiple objective simulated annealing (SA) algorithm for simple (line) and U type assembly line balancing problems with the aim of maximizing "smoothness index" and maximizing the "line performance" (or minimizing the number of workstations). The proposed algorithm makes use of task assignment rules in constructing feasible solutions. The proposed algorithm is tested and compared with literature test problems. The proposed algorithm found the optimal solutions for each problem in short computational times. A detailed performance analysis of the selected task assignment rules is also given in the paper. [PUBLICATION ABSTRACT]
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0956-5515
1572-8145
DOI:10.1007/s10845-005-6638-y