No abstract

Some practical arrangements in assembly lines necessitate setup times between consecutive tasks. To create more realistic models of operations, setup times must be considered. In this study, a sequencedependent setup times approach for two-sided u-type assembly line (TUAL) structures is proposed for the first time. Previous studies on TUAL have not included setup times in their analyses. Furthermore, an algorithm based on the Ant Colony Optimization (ACO) algorithm, which is using a heuristic priority rule based procedure has been proposed in order to solve this new approach. In this paper, we look at the sequence-dependent setup times between consecutive tasks and consecutive cycles, called the ''forward setup time'' and the ''backward setup time'', respectively. Additionally, we examine the ''crossover setup time'', which arises from a new sequence of tasks in a crossover station. In order to model more realistic assembly line configurations, it is necessary to include sequence-dependent setup times when computing all of the operational times such as task starting times and finishing times as well as the total workstation time. In this study, the proposed approach aims to minimize the number of mated-stations as the primary objective and to minimize the number of total workstations as a secondary objective. In order to evaluate the efficiency of the proposed algorithm, a computational study is performed. As can be seen from the experimental results the proposed approach finds promising results for all literature-test problems.

No abstract