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.
Highlights
The seru production, conceived at Sony, is an innovation of assembly system used widely in the Japanese electronics industry and recognized a new production patten
Since the complexity of seru formation is independent of scheduling rule, we focus on clarifying the influence of different scheduling rules to complexity of seru load
We investigate the significant influence of the 10 selected scheduling rules on the total throughput time (TTPT) and total labor hours (TLH) performances of seru system
Summary
The seru production, conceived at Sony, is an innovation of assembly system used widely in the Japanese electronics industry and recognized a new production patten. To obtain Pareto-optimal solutions for the large-scale instances of line-seru conversion, we propose two improved exact algorithms by decreasing time complexity and space complexity respectively. To illustrate clearly that TTPT and TLH of line-seru conversion are influenced by the different scheduling rules, we used 5 product batches and 2 serus, where worker 1 in seru 1 and worker 2 in seru 2.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
