EconPapers    
Economics at your fingertips  
 

Comparison of MILP and CP models for balancing partially automated assembly lines

Imre Dimény () and Tamás Koltai ()
Additional contact information
Imre Dimény: Budapest University of Technology and Economics
Tamás Koltai: Budapest University of Technology and Economics

Central European Journal of Operations Research, 2024, vol. 32, issue 4, No 4, 945-959

Abstract: Abstract The objective of Assembly Line Balancing (ALB) is to find the proper assignment of tasks to workstations, taking into consideration various types of constraints and defined management goals. Early research in the field focused on solving the Simple Assembly Line Balancing problem, a basic simplified version of the general problem. As the production environment became more complex, several new ALB problem types appeared, and almost all ALB problems are NP-hard, meaning that finding a solution requires a lot of time, resources, and computational power. Methods with custom-made algorithms and generic approaches have been developed for solving these problems. While custom-made algorithms are generally more efficient, generic approaches can be more easily extended to cover other variations of the problem. Over the past few decades, automation has played an increasingly important role in various operations, although complete automation is often not possible. As a result, there is a growing need for partially automated assembly line balancing models. In these circumstances, the flexibility of a generic approach is essential. This paper compares two generic approaches: mixed integer linear programming (MILP) and constraint programming (CP), for two types of partially automated assembly line balancing problems. While CP is relatively slower in solving the simpler allocation problems, it is more efficient than MILP when an increased number of constraints is applied to the ALB and an allocation and scheduling problem needs to be solved.

Keywords: Assembly line balancing; Mixed integer linear programing; Constraint programming; Human–robot collaboration (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10100-023-00885-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:cejnor:v:32:y:2024:i:4:d:10.1007_s10100-023-00885-x

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10100

DOI: 10.1007/s10100-023-00885-x

Access Statistics for this article

Central European Journal of Operations Research is currently edited by Ulrike Leopold-Wildburger

More articles in Central European Journal of Operations Research from Springer, Slovak Society for Operations Research, Hungarian Operational Research Society, Czech Society for Operations Research, Österr. Gesellschaft für Operations Research (ÖGOR), Slovenian Society Informatika - Section for Operational Research, Croatian Operational Research Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-03-20
Handle: RePEc:spr:cejnor:v:32:y:2024:i:4:d:10.1007_s10100-023-00885-x