Montaj hattı işçi atama ve dengeleme problemi için bir sabitle ve optimize et algoritması

Mass production of standardised commodities are generally realized through assembly lines which are composed of a number of serial workstations and a material handling system that connect the workstations. The components are sequentially moves from one station to another until a finished product is produced. In today, to meet the customers' rising needs and expectations, it is crucial to response them in short time with reasonable production costs to be competitive. Therefore, companies need to optimize these aspects to increase the production rate or decreasing the production cost. The necessity of these configurations derived the assembly line balancing problem (ALBP). The ALBP seeks for a partition of tasks among the workstations to identify the optimum value of a performance measure under a set of precedence constraints. However, classical ALBP assumes that each task has a deterministic processing time which is an unsuitable assumption for reality, since, a task may have different operation times based upon the worker who executes it. Therefore, assembly line worker assignment and balancing problem (ALWABP), which considers also to optimally allocate operators among the workstations besides partitioning tasks among workstations, was derived to close this gap in the related literature. This study considers an ALWABP with different operation times of tasks because every worker has different ability, skill, and experience etc. On account of the NP-hard nature of the problem, a mat-heuristic algorithm is proposed for the first time in the related literature to get through the problem. The proposed algorithm mainly comprises the fix-and-optimize (FAO) approach and the simulated annealing (SA) algorithm. Performance evaluation tests of the proposed algorithm are done on a benchmark set of ALWABP instances available in the related literature. The computational results exhibit the satisfactory performance of the proposed algorithm and therefore indicate that the proposed algorithm is a competitive solution procedure in solving ALWABP instances.