General resource-constrained assembly line balancing problem: conjunction normal form based constraint programming models

2021 ◽  
Vol 25 (8) ◽  
pp. 6101-6111
Author(s):  
Hacı Mehmet Alakaş
Keyword(s):  
Normal Form ◽  
Constraint Programming ◽  
Assembly Line ◽  
Assembly Line Balancing ◽  
Programming Models ◽  
Line Balancing ◽  
Resource Constrained ◽  
Assembly Line Balancing Problem

Constraint programming model for resource-constrained assembly line balancing problem

2019 ◽  
Vol 24 (7) ◽  
pp. 5367-5375 ◽  
Author(s):  
Hacı Mehmet Alakaş ◽  
Mehmet Pınarbaşı ◽  
Mustafa Yüzükırmızı
Keyword(s):  
Constraint Programming ◽  
Assembly Line ◽  
Programming Model ◽  
Assembly Line Balancing ◽  
Line Balancing ◽  
Resource Constrained ◽  
Assembly Line Balancing Problem ◽  
Constraint Programming Model

Robust optimization of resource-constrained assembly line balancing problems with uncertain operation times

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Wenrui Jin ◽  
Zhaoxu He ◽  
Qiong Wu
Keyword(s):  
Optimization Algorithm ◽  
Assembly Line ◽  
Assembly Line Balancing ◽  
Whale Optimization Algorithm ◽  
Line Balancing ◽  
Resource Constrained ◽  
Content Type ◽  
Whale Optimization ◽  
Minmax Regret ◽  
Assembly Line Balancing Problem

PurposeDue to the market trend of low-volume and high-variety, the manufacturing industry is paying close attention to improve the ability to hedge against variability. Therefore, in this paper the assembly line with limited resources is balanced in a robust way that has good performance under all possible scenarios. The proposed model allows decision makers to minimize a posteriori regret of the selected choice and hedge against the high cost caused by variability.Design/methodology/approachA generalized resource-constrained assembly line balancing problem (GRCALBP) with an interval data of task times is modeled and the objective is to find an assignment of tasks and resources to the workstations such that the maximum regret among all the possible scenarios is minimized. To properly solve the problem, the regret evaluation, an exact solution method and an enhanced meta-heuristic algorithm, Whale Optimization Algorithm, are proposed and analyzed. A problem-specific coding scheme and search mechanisms are incorporated.FindingsTheory analysis and computational experiments are conducted to evaluated the proposed methods and their superiority. Satisfactory results show that the constraint generation technique-based exact method can efficiently solve instances of moderate size to optimality, and the performance of WOA is enhanced due to the modified searching strategy.Originality/valueFor the first time a minmax regret model is considered in a resource-constrained assembly line balancing problem. The traditional Whale Optimization Algorithm is modified to overcome the inferior capability and applied in discrete and constrained assembly line balancing problems.

scholarly journals A constraint programming model for mixed model type 2 assembly line balancing problem

2016 ◽  
Vol 22 (4) ◽  
pp. 340-348 ◽  
Author(s):  
Hacı Mehmet Alağaş ◽  
Mehmet Pınarbaşı ◽  
Mustafa Yüzükırmızı ◽  
Bilal Toklu
Keyword(s):  
Constraint Programming ◽  
Assembly Line ◽  
Mixed Model ◽  
Programming Model ◽  
Assembly Line Balancing ◽  
Line Balancing ◽  
Model Type ◽  
Assembly Line Balancing Problem ◽  
Constraint Programming Model

A constraint programming approach to type-2 assembly line balancing problem with assignment restrictions

2019 ◽  
Vol 39 (5) ◽  
pp. 813-826 ◽  
Author(s):  
Mehmet Pinarbasi ◽  
Hacı Mehmet Alakas ◽  
Mustafa Yuzukirmizi
Keyword(s):  
Constraint Programming ◽  
Cycle Time ◽  
Assembly Line ◽  
Assembly Line Balancing ◽  
Line Balancing ◽  
Programming Approach ◽  
Solution Quality ◽  
Content Type ◽  
Assembly Line Balancing Problem

Purpose Main constraints for an assembly line balancing problem (ALBP) are cycle time/number of stations and task precedence relations. However, due to the technological and organizational limitations, several other restrictions can be encountered in real production systems. These restrictions are called as assignment restrictions and can be task assignment, station, resource and distance limitations. The purpose of the study is to evaluate the effects of these restrictions on ALBP using constraint programming (CP) model. Design/methodology/approach A novel CP model is proposed and compared to mixed-integer programming (MIP) as a benchmark. The objective is to minimize the cycle time for a given number of stations. The authors also provide explicit anthology of the assignment restriction effects on line efficiency, the solution quality and the computation time. Findings The proposed approach is verified with the literature test instances and a real-life problem from a furniture manufacturing company. Computational experiments show that, despite the fact that additional assignment restrictions are problematic in mathematical solutions, CP is a versatile exact solution alternative in modelling and the solution quality. Practical implications Assembly line is a popular manufacturing system in the making of standardized high volume products. The problem of assembly line balancing is a crucial challenge in these settings and consists of assigning tasks to the stations by optimizing one or more objectives. Type-2 AR-ALBP is a specific case with the objective function of minimizing the cycle time for a given number of stations. It further assumes assignment restrictions that can be confronted due to the technological limitations or the strategic decisions of the company management. This is especially encountered in rebalancing lines. Originality/value Several solution approaches such as mathematical modelling, heuristic and meta-heuristic are proposed to solve the ALBP in the literature. In this study, a new approach has been presented using CP. Efficient models are developed for Type-2 ALBP with several assignment restrictions. Previous studies have not considered the problem to the presented extent. Furthermore, to the best of the authors’ knowledge, the paper is the first study that solves ALBP with assignment restrictions using CP.

Sign in / Sign up

Export Citation Format

Share Document