A heuristic solution for fuzzy mixed-model line balancing problem
This paper addresses the mixed-model line balancing problem with fuzzy processing time. A fuzzy binary linear programming model is formulated for the problem. This fuzzy model is then transformed to a mixed zero–one program. Due to the complexity nature in handling fuzzy computation, new approximate...
Uloženo v:
| Vydáno v: | European journal of operational research Ročník 168; číslo 3; s. 798 - 810 |
|---|---|
| Hlavní autor: | |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Amsterdam
Elsevier B.V
01.02.2006
Elsevier Elsevier Sequoia S.A |
| Edice: | European Journal of Operational Research |
| Témata: | |
| ISSN: | 0377-2217, 1872-6860 |
| 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!
|
| Shrnutí: | This paper addresses the mixed-model line balancing problem with fuzzy processing time. A fuzzy binary linear programming model is formulated for the problem. This fuzzy model is then transformed to a mixed zero–one program. Due to the complexity nature in handling fuzzy computation, new approximated fuzzy arithmetic operation is presented. A fuzzy heuristic is developed to solve this problem based on the aggregating fuzzy numbers and combined precedence constraints. The general idea of our approach is to arrange the jobs in a sequence by a varying-section exchange procedure. Then jobs are allocated into workstations based on these aggregated fuzzy times with the considerations of technological constraint and cycle time limit. Promising results are obtained by experiments. |
|---|---|
| Bibliografie: | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 |
| ISSN: | 0377-2217 1872-6860 |
| DOI: | 10.1016/j.ejor.2004.07.029 |