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.展开更多
基金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.
