In the garment industry, assembly line balancing is one of the most significant tasks. To make a product, a manufacturing technique called assembly line is utilized, where components are assembled and transferred from workstation to workstation until the final assembly is finished. Assembly line should always be as balanced as possible in order to maximize efficiency. Different types of assembly line balancing problems were introduced along with many proposed solutions. In this paper, we focus on an assembly line balancing problem where the upper bound of the number of workers is given, tasks and workers have to be grouped into workstations so that the cycle time is minimized, the total number of workers is minimized and balance efficiency is maximized. With unfixed number of workstations and other various constraints, our problem is claimed to be novel. We propose three different approaches: exhaustive search, simulated annealing and simulated annealing with greedy. Computational results affirmed that our SA algorithm performed extremely good in terms of both accuracy and running time. From these positive outcomes, our algorithms clearly show their applicability potential in practice.

中文翻译：

---

通过模拟退火提高循环时间以解决实际装配线平衡问题

在服装行业，流水线平衡是最重要的任务之一。为了制造产品，使用了一种称为装配线的制造技术，其中组件被组装并从一个工作站转移到另一个工作站，直到最终组装完成。装配线应始终尽可能平衡，以最大限度地提高效率。引入了不同类型的装配线平衡问题以及许多建议的解决方案。在本文中，我们关注一个装配线平衡问题，其中给定工人数量的上限，必须将任务和工人分组到工作站中，以便最小化周期时间，最小化工人总数并平衡效率最大化。由于工作站数量不固定和其他各种限制，我们的问题据称是新的。我们提出了三种不同的方法：穷举搜索、模拟退火和贪婪模拟退火。计算结果证实我们的 SA 算法在准确性和运行时间方面都表现得非常好。从这些积极的结果中，我们的算法清楚地显示了它们在实践中的适用潜力。