With increasing demand diversification and short product lifecycles, industries now encounter challenges of demand uncertainty. The Japanese seru production system has received increased attention owing to its high ef...With increasing demand diversification and short product lifecycles, industries now encounter challenges of demand uncertainty. The Japanese seru production system has received increased attention owing to its high efficiency and flexibility. In this paper, the problem of seru production system formation under uncertain demand is researched. A multi-objective optimization model for a seru production system formation problem is developed to minimize the cost and maximize the service level of the system. The purpose of this paper is to formulate a robust production system that can respond efficiently to the stochastic demand. Sample average approximation （SAA） is used to approximate the expected objective of the stochastic programming. The non-dominated sorting genetic algorithm II （NSGA-II） is improved to solve the multi-objective optimization model. Numerical experiments are conducted to test the tradeoffbetween cost and service level, and how the performance of the seru production system varies with the number of product types, mean and deviation of product volume, and skill-level-based cost.展开更多
Seru production is regarded as a new production mode and derived from the production site of Japanese electronics industry. This production mode is proposed to overcome the low flexibility of the assembly line. Seru p...Seru production is regarded as a new production mode and derived from the production site of Japanese electronics industry. This production mode is proposed to overcome the low flexibility of the assembly line. Seru production has been successfully implemented in Japanese electronics industry, such as Canon and Sony. Benefits from Seru production include rapid response, good flexibility, and high productivity. Seru production has received extensive attention in academic research and production practice. This study reviews the background, characteristics, types, and operation of seru production. The advantages and applicable scenes of seru production are summarized from the perspective of business practice. We compare seru production and famous production modes, i.e., assembly line, cellular manufacturing, and Toyota Production System. The literature on seru production is surveyed and classified. Furthermore, future research directions are provided.展开更多
This paper investigates the production scheduling problems of allocating resources and sequencing jobs in the seru production system(SPS).As a new-type manufacturing mode arising from Japanese production practices,ser...This paper investigates the production scheduling problems of allocating resources and sequencing jobs in the seru production system(SPS).As a new-type manufacturing mode arising from Japanese production practices,seru production can achieve efficiency,flexibility,and responsiveness simultaneously.The production environment in which a set of jobs must be scheduled over a set of serus according to due date and different execution modes is considered,and a combination optimization model is provided.Motivated by the problem complexity and the characteristics of the proposed seru scheduling model,a nested partitioning method(NPM)is designed as the solution approach.Finally,computational studies are conducted,and the practicability of the proposed seru scheduling model is proven.Moreover,the efficiency of the nested partitioning solution method is demonstrated by the computational results obtained from different scenarios,and the good scalability of the proposed approach is proven via comparative analysis.展开更多
Today's volatile market conditions in electronic industries have lead to a new production system,seru(which is the Japanese pronunciation for cell),and has been widely implemented in hundreds of Japanese and other...Today's volatile market conditions in electronic industries have lead to a new production system,seru(which is the Japanese pronunciation for cell),and has been widely implemented in hundreds of Japanese and other Asia companies.In particular,the rotating seru has been widely implemented,where workers are fully cross-trained with the same skill level but may be different on the proficiency of performing tasks.The rotating seru production problem,which determines the rotating sequence of workers as well as the assembling sequence of jobs,is difficult to solve due to conflicting objectives and dynamic release of customer demands.To solve this problem,we propose a dynamic multiobjective NSGA-II based memetic algorithm.Moreover,to preserve desirable population diversity and improve the searching efficiency,we propose different problem-specific evolutionary strategies.Finally,we test the performance of our proposed memetic algorithm with other state-of-the-art multi-objective evolutionary algorithms and demonstrate the effectiveness of our proposed algorithm.展开更多
This paper deals with seru scheduling problems with multiple due windows assignment and DeJong’s learning effect.Specific time intervals are assigned to jobs with multiple due windows and learning effect is introduce...This paper deals with seru scheduling problems with multiple due windows assignment and DeJong’s learning effect.Specific time intervals are assigned to jobs with multiple due windows and learning effect is introduced to characterize the decrease of processing times with the accumulation of the working experience.We assume that the set of jobs assigned to each due window is independent,and no inclusion exists between due windows.The objective is to determine the optimal due window positions and sizes,the set of jobs assigned to each due window,and the optimal schedule in each seru to minimize a multidimensional function,which consists of the earliness and tardiness punishment cost,as well as the due window related starting time and size cost.We find that when the number of jobs and the due windows assigned to each seru are pre-specified in advance,the problem can be solved in polynomial time.Meanwhile,the impacts of the due-window allocation strategy and learning effect on the total cost are respectively discussed based on numerical examples and special cases.The results show that if each seru is assigned with the same number of due windows,the total cost can be reduced with the increasing ratio of the due-window number to the to-be-processed job number.Furthermore,with an increasing learning effect,the total cost will be decreased.展开更多
文摘With increasing demand diversification and short product lifecycles, industries now encounter challenges of demand uncertainty. The Japanese seru production system has received increased attention owing to its high efficiency and flexibility. In this paper, the problem of seru production system formation under uncertain demand is researched. A multi-objective optimization model for a seru production system formation problem is developed to minimize the cost and maximize the service level of the system. The purpose of this paper is to formulate a robust production system that can respond efficiently to the stochastic demand. Sample average approximation （SAA） is used to approximate the expected objective of the stochastic programming. The non-dominated sorting genetic algorithm II （NSGA-II） is improved to solve the multi-objective optimization model. Numerical experiments are conducted to test the tradeoffbetween cost and service level, and how the performance of the seru production system varies with the number of product types, mean and deviation of product volume, and skill-level-based cost.
基金the National Natural Science Foundation of China(Grant Nos.71420107028,71571037,and 71601089)Fundamental Research Funds for the Central Universities(Nos.N160402002 and N170405005).
文摘Seru production is regarded as a new production mode and derived from the production site of Japanese electronics industry. This production mode is proposed to overcome the low flexibility of the assembly line. Seru production has been successfully implemented in Japanese electronics industry, such as Canon and Sony. Benefits from Seru production include rapid response, good flexibility, and high productivity. Seru production has received extensive attention in academic research and production practice. This study reviews the background, characteristics, types, and operation of seru production. The advantages and applicable scenes of seru production are summarized from the perspective of business practice. We compare seru production and famous production modes, i.e., assembly line, cellular manufacturing, and Toyota Production System. The literature on seru production is surveyed and classified. Furthermore, future research directions are provided.
基金This research was sponsored by National Natural Science Foundation of China(Grant No.71401075,71801129)the Fundamental Research Funds for the Central Universities(No.30922011406)+1 种基金System Science and Enterprise Development Research Center(Grant No.Xq22B06)Grant-in-Aid for Scientific Research(C)of Japan(Grant No.20K01897).
文摘This paper investigates the production scheduling problems of allocating resources and sequencing jobs in the seru production system(SPS).As a new-type manufacturing mode arising from Japanese production practices,seru production can achieve efficiency,flexibility,and responsiveness simultaneously.The production environment in which a set of jobs must be scheduled over a set of serus according to due date and different execution modes is considered,and a combination optimization model is provided.Motivated by the problem complexity and the characteristics of the proposed seru scheduling model,a nested partitioning method(NPM)is designed as the solution approach.Finally,computational studies are conducted,and the practicability of the proposed seru scheduling model is proven.Moreover,the efficiency of the nested partitioning solution method is demonstrated by the computational results obtained from different scenarios,and the good scalability of the proposed approach is proven via comparative analysis.
基金We thank Professor Wei Jiang and two anonymous reviewers for their suggestions and comments.Feng Liu and Jiafu Tang were supported by the NSFC[grant numbers 71872033,71420107028]Kan Fang was supported by the NSFC[grant number 71701144]+1 种基金Yong Yin was supported by the Omron research fund.Feng Liu was also supported by the 2020 LiaoNing Revitalization Talents Program(XLYC2007061)the Dalian High Level Talents Innovation Support Plan(2019RQ107).
文摘Today's volatile market conditions in electronic industries have lead to a new production system,seru(which is the Japanese pronunciation for cell),and has been widely implemented in hundreds of Japanese and other Asia companies.In particular,the rotating seru has been widely implemented,where workers are fully cross-trained with the same skill level but may be different on the proficiency of performing tasks.The rotating seru production problem,which determines the rotating sequence of workers as well as the assembling sequence of jobs,is difficult to solve due to conflicting objectives and dynamic release of customer demands.To solve this problem,we propose a dynamic multiobjective NSGA-II based memetic algorithm.Moreover,to preserve desirable population diversity and improve the searching efficiency,we propose different problem-specific evolutionary strategies.Finally,we test the performance of our proposed memetic algorithm with other state-of-the-art multi-objective evolutionary algorithms and demonstrate the effectiveness of our proposed algorithm.
基金the National Natural Science Foundation of China(NSFC),under grant Nos.71401075 and 71801129System Science and Enterprise Development Research Center,under grant No.Xq22B06。
文摘This paper deals with seru scheduling problems with multiple due windows assignment and DeJong’s learning effect.Specific time intervals are assigned to jobs with multiple due windows and learning effect is introduced to characterize the decrease of processing times with the accumulation of the working experience.We assume that the set of jobs assigned to each due window is independent,and no inclusion exists between due windows.The objective is to determine the optimal due window positions and sizes,the set of jobs assigned to each due window,and the optimal schedule in each seru to minimize a multidimensional function,which consists of the earliness and tardiness punishment cost,as well as the due window related starting time and size cost.We find that when the number of jobs and the due windows assigned to each seru are pre-specified in advance,the problem can be solved in polynomial time.Meanwhile,the impacts of the due-window allocation strategy and learning effect on the total cost are respectively discussed based on numerical examples and special cases.The results show that if each seru is assigned with the same number of due windows,the total cost can be reduced with the increasing ratio of the due-window number to the to-be-processed job number.Furthermore,with an increasing learning effect,the total cost will be decreased.
