New mathematical and constraint programming models for U-type assembly line balancing problems with assignment restrictions

DOI10.1080/0305215x.2021.1921171zbMath1523.90191OpenAlexW3160365049MaRDI QIDQ6094522

Mehmet Pınarbaşı

Publication date: 10 October 2023

Published in: Engineering Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0305215x.2021.1921171

zbMATH Keywords

mathematical programmingconstraint programmingassembly line balancingassignment restrictionsU-type problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30) Combinatorial optimization (90C27)

Related Items (1)

A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions

Cites Work

• A goal programming approach to simple U-line balancing problem
• Ant algorithms for a time and space constrained assembly line balancing problem
• A chance-constrained approach to stochastic line balancing problem
• Multiple-criteria decision-making in two-sided assembly line balancing: a goal programming and a fuzzy goal programming model
• Traveling worker assembly line (re)balancing problem: model, reduction techniques, and real case studies
• Monolithic vs. hierarchical balancing and scheduling of a flexible assembly line
• Two-sided assembly lines balancing with assignment restrictions
• Rules-based heuristic approach for the U-shaped assembly line balancing problem
• A classification of assembly line balancing problems
• A versatile algorithm for assembly line balancing
• Branch and bound procedures for solving the assembly line worker assignment and balancing problem: Application to sheltered work centres for disabled
• A shortest route formulation of simple U-type assembly line balancing problem
• Balancing assembly lines with tabu search
• Constraint programming model for multi-manned assembly line balancing problem
• Evaluation of mixed-model U-line operational designs
• A Branch-and-Cut Approach for a Generic Multiple-Product, Assembly-System Design Problem
• A cutting plane approach for the single-product assembly system design problem
• Tabu search algorithms for an industrial multi-product and multi-objective assembly line balancing problem, with reduction of the task dispersion
• Balancing assembly lines: an industrial case study
• A two-stage heuristic method for balancing mixed-model assembly lines with parallel workstations
• Hybrid assembly line design and user's preferences
• Balancing stochastic type-II assembly lines: chance-constrained mixed integer and constraint programming models
• ANTBAL: an ant colony optimization algorithm for balancing mixed-model assembly lines with parallel workstations

This page was built for publication: New mathematical and constraint programming models for U-type assembly line balancing problems with assignment restrictions