Complexity of line-seru conversion for different scheduling rules and two improved exact algorithms for the multi-objective optimization

Abstract

Productivity can be greatly improved by converting the traditional assembly line to a seru system, especially in the business environment with short product life cycles, uncertain product types and fluctuating production volumes. Line-seru conversion includes two decision processes, i.e., seru formation and seru load. For simplicity, however, previous studies focus on the seru formation with a given scheduling rule in seru load. We select ten scheduling rules usually used in seru load to investigate the influence of different scheduling rules on the performance of line-seru conversion. Moreover, we clarify the complexities of line-seru conversion for ten different scheduling rules from the theoretical perspective. In addition, multi-objective decisions are often used in line-seru conversion. To obtain Pareto-optimal solutions of multi-objective line-seru conversion, we develop two improved exact algorithms based on reducing time complexity and space complexity respectively. Compared with the enumeration based on non-dominated sorting to solve multi-objective problem, the two improved exact algorithms saves computation time greatly. Several numerical simulation experiments are performed to show the performance improvement brought by the two proposed exact algorithms.

Seru üretim sistemlerinde yükleme problemi için karışık tamsayılı bir matematiksel model ve mat-sezgisel çözüm yaklaşımı

“…[9] ile Yu vd. [13] tarafından yapılan çalışmalar her iki problem üzerinde beraber odaklanmış çalışmalardır. İlk çalışmada geleneksel bir düz montaj hattından tamamen serulardan oluşturulmuş bir üretim sistemi tasarımına geçiş ve bu yeni tasarıma işçilerin ve işlerin ataması ele alınmıştır [9].…”

“…Problemin NP-zor bir problem olduğunun literatürde belirtildiğinden hareketle Genetik Algoritma (GA) tabanlı bir sezgisel yöntem önerilmiş ve problem çözülmüştür. İkinci çalışmada da seru yükleme problemi dikkate alınmıştır [13]. İlgili çalışmada seru yükleme probleminin aslında bir çizelgeleme problemi olduğu kabulüyle 10 farklı çizelgeleme kuralının hat-seru dönüşümü üzerindeki etkisi incelenmiştir.…”

Review of seru production

“…On the basis of the analysis of the experimental results, they concluded that a batch should be assigned to the seru with the SPT to minimize the total labor hours, and the batch allocation should consider the balance among serus to minimize the makespan. Yu et al (2016) investigated the influences of 10 scheduling rules on the complexity and performance of the pure seru system. The 10 scheduling rules were divided into two categories: scheduling rules unrelated and related to the seru sequence.…”

An Automatic Heuristic Design Approach for Seru Scheduling Problem with Resource Conflicts

“…e configuration problem of an SPS can be divided into two categories, i.e., seru formation [12] and seru scheduling [13]. Seru formation means grouping workers into serus and determining their tasks according to the arrived orders [12].…”

“…Seru formation means grouping workers into serus and determining their tasks according to the arrived orders [12]. Seru scheduling refers to constructing serus with an exact sequence in limited workspace [13].…”