Balancing and scheduling tasks in parallel assembly lines with sequence-dependent setup times

Parallel assembly lines are special flow type production systems where two or more neighbouring assembly lines are balanced together. In some industries such as automobile and household appliances industries, neighbouring lines are frequently used. In parallel assembly lines, a setup can be defined...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:International journal of production economics Ročník 213; s. 81 - 96
Hlavný autor: Özcan, Uğur
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 01.07.2019
Predmet:
Assembly line balancing
Binary linear programming
Parallel assembly lines
Sequence-dependent setup times
Simulated annealing
Parallel assembly lines
Sequence-dependent setup times
Binary linear programming
Assembly line balancing
Simulated annealing
ISSN:0925-5273
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Parallel assembly lines are special flow type production systems where two or more neighbouring assembly lines are balanced together. In some industries such as automobile and household appliances industries, neighbouring lines are frequently used. In parallel assembly lines, a setup can be defined as a set of activities to perform a task, such as movements, selecting a new assembly tool and/or taking a position in order to using the most suitable installation procedure. Setups in a workstation on the same line may occur in two ways; forward setup and backward setup. And also, a setup in a workstation on two neighbouring lines may occur. In this study, this is named as line-switching setups. In this paper, the problem of balancing and scheduling tasks in parallel assembly lines with sequence-dependent setup times (PALBPS) is introduced and characterised. A binary linear mathematical programming (BLP) model and a simulated annealing (SA) algorithm are proposed to model and solve the PALBPS. A computational study is performed in order to test the proposed SA algorithm. The computational results show that the proposed algorithm is very effective and successful for the PALBPS. •Balancing and scheduling tasks in parallel lines with setups is considered.•The problem is introduced and characterised for the first time.•A mathematical model and a simulated annealing are proposed to the problem.•Proposed algorithm is evaluated on a set of new generated benchmark problems.
ISSN:0925-5273
DOI:10.1016/j.ijpe.2019.02.023