Resource-constrained assembly line balancing problems with multi-manned workstations

Chen, Yin-Yann; Cheng, Chen-Yang; Li, Jiaying

doi:10.1016/j.jmsy.2018.07.001

Cited by 43 publications

(15 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Chen et al [26] proposed a mixed-integer programming model for the resourceconstrained multi-manned assembly line balancing problem. They proposed a genetic algorithm to minimize the number of stations and operators.…”

Section: Multi-manned Assembly Line Balancing Problemmentioning

confidence: 99%

Stochastic Local Search for Solving Chance-Constrained Multi-Manned U-shaped Assembly Line Balancing Problem with Time and Space Constraints

Zakarai¹,

Zaher²,

Ragaa³

2021

JUSST

View full text Add to dashboard Cite

The assembly line balancing problems have great importance in research and industry fields. They allow minimizing the learning aspects and guaranteeing a fixed number of products per day. This paper introduces a new problem that combines the multi-manned concept with the U-shaped lines with time and space constraints under uncertainty. The processing time of the tasks is considered as random variables with known means and variances. Therefore, chance-constraints appear in the cycle time constraints. In addition, each task has an associated area, where the assigned tasks per station are restricted by a total area. The proposed algorithm for solving the problem is a stochastic local search algorithm. The parameter levels of the proposed algorithm are optimized by the Taguchi method to cover the small, medium, and large-sized problems. Well-known benchmark problems have been adapted to cover the new model. The computational results showed the importance of the new problem and the efficiency of the proposed algorithm.

show abstract

Section: Multi-manned Assembly Line Balancing Problemmentioning

confidence: 99%

Stochastic Local Search for Solving Chance-Constrained Multi-Manned U-shaped Assembly Line Balancing Problem with Time and Space Constraints

Zakarai¹,

Zaher²,

Ragaa³

2021

JUSST

View full text Add to dashboard Cite

show abstract

“…Rather we focus on multi-manned assembly lines. Amongst the different assembly line forms, multi-manned assembly line (MMAL) allows simultaneous operation of more than one worker at the same workstation (Kellegöz & Toklu, 2012;Chen, 2017;Chen et al, 2018). MMAL are commonly used in large-sized product manufacturing, and they satisfy several advantages over simple assembly lines, such as increased team-working, reduced line length, and reduced work-in-process (Dimitriadis, 2006).…”

Section: Assembly Line Balancing Problem (Albp)mentioning

confidence: 99%

The use of labour flexibility for output control in workload controlled flow shops: A simulation analysis

Staudacher¹,

Costa²,

Thürer³

2020

10.5267/j.ijiec

View full text Add to dashboard Cite

Workload control theory seeks to align capacity and demand to improve delivery performance. However, workload control researchers mainly focused on input control, which regulates the input of work to the production system, thereby neglecting output control, which uses capacity adjustments to regulate the outflow of the work. Moreover, few existing studies on output control investigate a temporarily increase in capacity. This paper introduces a new search direction for output control which does not require an increase in capacity-labour flexibility. Idle operators can move from their workstation to another, thus temporarily increasing the output of that workstation without extra capacity. Using simulation of a five workstations flow shop line, we highlight the positive performance effect of labour flexibility. However, this comes at the cost of high labour movement. Introducing a load-based constraint on when workers are allowed to move significantly reduces labour movement, while realizing most of the performance improvement observed for unconstrained labour movement. This has important implications for future research and practice.

show abstract

“…Constraint (16) observes the sequence of stations' index in lines. Constraints (17) and (18) ensure that the range of the finish time of task i is between its completion time and the cycle time. Constraints (19)- (23) are the internality constraints.…”

Section: E Mathematicalmentioning

confidence: 99%

“…Michels et al [16] proposed a benders' decomposition algorithm to minimize the number of workers as the primary objective. For other extension of MALBP-I, Chen et al [17] additionally considered the resource constraint. Şahin and Kellegöz [18] assumed that workers could walk between different stations.…”

Section: Introductionmentioning

confidence: 99%

A Mathematical Model and a Simulated Annealing Algorithm for Balancing Multi-manned Assembly Line Problem with Sequence-Dependent Setup Time

Yang

Cheng

2020

Mathematical Problems in Engineering

View full text Add to dashboard Cite

Multi-manned assembly lines have been widely applied to the industrial production, especially for large-sized products such as cars, buses, and trucks, in which more than one operator in the same station simultaneously performs different tasks in parallel. This study deals with a multi-manned assembly line balancing problem by simultaneously considering the forward and backward sequence-dependent setup time (MALBPS). A mixed-integer programming is established to characterize the problem. Besides, a simulated annealing algorithm is also proposed to solve it. To validate the performance of the proposed approaches, a set of benchmark instances are tested and the lower bound of the proposed problem is also given. The results demonstrated that the proposed algorithm is quite effective to solve the problem.

show abstract

Resource-constrained assembly line balancing problems with multi-manned workstations

Cited by 43 publications

References 29 publications

Stochastic Local Search for Solving Chance-Constrained Multi-Manned U-shaped Assembly Line Balancing Problem with Time and Space Constraints

Stochastic Local Search for Solving Chance-Constrained Multi-Manned U-shaped Assembly Line Balancing Problem with Time and Space Constraints

The use of labour flexibility for output control in workload controlled flow shops: A simulation analysis

A Mathematical Model and a Simulated Annealing Algorithm for Balancing Multi-manned Assembly Line Problem with Sequence-Dependent Setup Time

Contact Info

Product

Resources

About