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

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 forma...

Full description

Bibliographic Details
Main Authors:	Yu, Yang, Wang, Sihan, Tang, Jiafu, Kaku, Ikou, Sun, Wei
Format:	Online
Language:	English
Published:	Springer International Publishing 2016
Online Access:	https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4916081/

id	pubmed-4916081
recordtype	oai_dc
spelling	pubmed-49160812016-07-07 Complexity of line-seru conversion for different scheduling rules and two improved exact algorithms for the multi-objective optimization Yu, Yang Wang, Sihan Tang, Jiafu Kaku, Ikou Sun, Wei Research 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. Springer International Publishing 2016-06-21 /pmc/articles/PMC4916081/ /pubmed/27390649 http://dx.doi.org/10.1186/s40064-016-2445-5 Text en © The Author(s) 2016 Open AccessThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
repository_type	Open Access Journal
institution_category	Foreign Institution
institution	US National Center for Biotechnology Information
building	NCBI PubMed
collection	Online Access
language	English
format	Online
author	Yu, Yang Wang, Sihan Tang, Jiafu Kaku, Ikou Sun, Wei
spellingShingle	Yu, Yang Wang, Sihan Tang, Jiafu Kaku, Ikou Sun, Wei Complexity of line-seru conversion for different scheduling rules and two improved exact algorithms for the multi-objective optimization
author_facet	Yu, Yang Wang, Sihan Tang, Jiafu Kaku, Ikou Sun, Wei
author_sort	Yu, Yang
title	Complexity of line-seru conversion for different scheduling rules and two improved exact algorithms for the multi-objective optimization
title_short	Complexity of line-seru conversion for different scheduling rules and two improved exact algorithms for the multi-objective optimization
title_full	Complexity of line-seru conversion for different scheduling rules and two improved exact algorithms for the multi-objective optimization
title_fullStr	Complexity of line-seru conversion for different scheduling rules and two improved exact algorithms for the multi-objective optimization
title_full_unstemmed	Complexity of line-seru conversion for different scheduling rules and two improved exact algorithms for the multi-objective optimization
title_sort	complexity of line-seru conversion for different scheduling rules and two improved exact algorithms for the multi-objective optimization
description	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.
publisher	Springer International Publishing
publishDate	2016
url	https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4916081/
_version_	1613597820785262592

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

Similar Items