Modelling and Solving Assembly Line Worker Assignment and Balancing Problem with Sequence-Dependent Setup Times

Dependent Setup Times ◽

Abstract Assembly lines appear with various differentiations in order to better include the disabled in the labor market and to increase production efficiency. In this way, the optimal workforce assignment problem that emerges heterogeneously is called assembly line worker assignment and balancing problem (ALWABP). This paper addresses the ALWABP where the simple version is enriched by considering sequence-dependent setup times between tasks. A mixed integer linear programming model is presented and a simulated annealing algorithm is developed such as an NP-hard problem. In order to test the proposed solutions, 640 benchmark problems in the literature were combined and used. The solutions obtained through using the proposed algorithm are compared with the mixed integer programming model on the small-size test problems. Experimental results show that the proposed algorithm is more effective and robust for a large set of benchmark problems.

Modeling and solving assembly line worker assignment and balancing problem with sequence-dependent setup times

Soft Computing ◽

10.1007/s00500-021-06107-3 ◽

2021 ◽

Author(s):

Hamid Yilmaz

Keyword(s):

Assembly Line ◽

Setup Times ◽

Worker Assignment ◽

Sequence Dependent ◽

Dependent Setup Times ◽

Batch Sequencing with Sequence Dependent Setup-Times and -Costs: A Comparison of Logic and Mixed Integer Programming Approaches

Operations Research ’93 ◽

10.1007/978-3-642-46955-8_68 ◽

1994 ◽

pp. 286-286

Author(s):

Carsten Jordan ◽

Andreas Drexl

Keyword(s):

Integer Programming ◽

Mixed Integer Programming ◽

Setup Times ◽

Mixed Integer ◽

Sequence Dependent ◽

Dependent Setup Times ◽

A Genetic Algorithm for a Two-Machine Flowshop with a Limited Waiting Time Constraint and Sequence-Dependent Setup Times

Mathematical Problems in Engineering ◽

10.1155/2020/8833645 ◽

2020 ◽

Vol 2020 ◽

pp. 1-13

Author(s):

Ju-Yong Lee

Keyword(s):

Genetic Algorithm ◽

Waiting Time ◽

Computation Time ◽

Time Constraint ◽

Setup Times ◽

Mixed Integer ◽

Sequence Dependent ◽

Dependent Setup Times ◽

This study considers a two-machine flowshop with a limited waiting time constraint between the two machines and sequence-dependent setup times on the second machine. These characteristics are motivated from semiconductor manufacturing systems. The objective of this scheduling problem is to minimize the total tardiness. In this study, a mixed-integer linear programming formulation was provided to define the problem mathematically and used to find optimal solutions using a mathematical programming solver, CPLEX. As CPLEX required a significantly long computation time because this problem is known to be NP-complete, a genetic algorithm was proposed to solve the problem within a short computation time. Computational experiments were performed to evaluate the performance of the proposed algorithm and the suggested GA outperformed the other heuristics considered in the study.

A heuristic algorithm for assembly line balancing with stochastic sequence-dependent setup times

2017 8th International Conference on Information Technology (ICIT) ◽

10.1109/icitech.2017.8080037 ◽

2017 ◽

Author(s):

Zeynel Abidin Cil ◽

Suleyman Mete ◽

Eren Ozceylan ◽

Zulal Diri Kenger ◽

Hande Cil

Keyword(s):

Heuristic Algorithm ◽

Assembly Line ◽

Assembly Line Balancing ◽

Setup Times ◽

Line Balancing ◽

Sequence Dependent ◽

Dependent Setup Times ◽

Assembly Line Balancing Problem with Stochastic Sequence-Dependent Setup Times

Pamukkale University Journal of Engineering Sciences ◽

10.5505/pajes.2015.93723 ◽

2015 ◽

Vol 21 (4) ◽

pp. 152-157 ◽

Cited By ~ 2

Author(s):

Zülal Diri ◽

Süleyman Mete ◽

Zeynel Abidin Çil ◽

Kürşad Ağpak

Keyword(s):

Assembly Line ◽

Assembly Line Balancing ◽

Setup Times ◽

Line Balancing ◽

Sequence Dependent ◽

Assembly Line Balancing Problem ◽

Dependent Setup Times ◽

Single Machine Scheduling Problems With Sequence-dependent Setup Times and Precedence Delays

10.21203/rs.3.rs-1148434/v1 ◽

2021 ◽

Author(s):

Shih-Wei Lin ◽

Kuo-Ching Ying

Keyword(s):

Single Machine ◽

Solution Space ◽

Machine Scheduling ◽

Single Machine Scheduling ◽

Setup Times ◽

Mixed Integer ◽

Sequence Dependent ◽

Dependent Setup Times ◽

Abstract Sequence-dependent setup times (SDSTs) and delayed precedence (DP) occur commonly in various manufacturing settings. This study investigated the single machine scheduling problem with SDSTs and DP constraints arising in an amplifier assembly company. A mixed-integer linear programming model and a lean iterated greedy (LIG) algorithm is proposed to search for the best job sequence with minimum makespan. Based on the characteristic of delayed precedence constraints of the problem, the proposed LIG algorithm implements a straightforward but effective lean construction mechanism, which can keep the search process within the feasible solution space and quickly converge toward the (near-) global optimum. Computational results reveal that LIG significantly outperforms the state-of-the-art algorithm in terms of solution quality and computational efficiency. This study mainly contributes to providing a simple, effective, and efficient algorithm that can facilitate industrial applications and act as a new benchmark approach for future research.