Line-seru conversion towards reducing worker(s) without increasing makespan: models, exact and meta-heuristic solutions

Compared with the traditional assembly line, seru production can reduce worker(s) and decrease makespan. However, when the two objectives are considered simultaneously, Pareto-optimal solutions may save manpower but increase makespan. Therefore, we formulate line-seru conversion towards reducing worker(s) without increasing makespan and develop exact and meta-heuristic algorithms for the different scale instances. Firstly, we analyse the distinct features of the model. Furthermore, according to the feature of the solution space, we propose two exact algorithms to solve the small to medium-scale instances. The first exact algorithm searches the solution space from more workers to fewer workers. The second exact algorithm searches the solution space from fewer workers to more workers. The two exact algorithms search a part of solution space to obtain the optimal solution of reducing worker(s) without increasing makespan. According to the variable length of the feasible solutions, we propose a variable-length encoding heuristic algorithm for the large-scale instances. Finally, we use the extensive experiments to evaluate the performance of the proposed algorithms and to investigate some managerial insights on when and how to reduce worker(s) without increasing makespan by line-seru conversion.

[1]  Wei Sun,et al.  Line-hybrid seru system conversion: Models, complexities, properties, solutions and insights , 2017, Comput. Ind. Eng..

[2]  Lin Tang,et al.  An improved multi-objective genetic algorithm for heterogeneous coverage RFID network planning , 2016 .

[3]  Yong Yin,et al.  The Evolution of Seru Production Systems Throughout Canon , 2008 .

[4]  Ikou Kaku,et al.  Reducing worker(s) by converting assembly line into a pure cell system , 2013 .

[5]  Richard F. Hartl,et al.  Supply chain dynamics, control and disruption management , 2016 .

[6]  Shih-Wei Lin,et al.  Multi-objective unrelated parallel machine scheduling: a Tabu-enhanced iterated Pareto greedy algorithm , 2016 .

[7]  Ikou Kaku,et al.  Modeling and numerical analysis of line-cell conversion problems , 2009 .

[8]  Clarisse Dhaenens,et al.  Parallel partitioning method (PPM): A new exact method to solve bi-objective problems , 2007, Comput. Oper. Res..

[9]  Ching-Jong Liao,et al.  Scheduling with multi-attribute set-up times on unrelated parallel machines , 2016 .

[10]  Karol Pak,et al.  Stirling Numbers of the Second Kind , 2005 .

[11]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[12]  George Q. Huang,et al.  A hybrid evolutionary algorithm with adaptive multi-population strategy for multi-objective optimization problems , 2017, Soft Comput..

[13]  María Concepción López Fernández,et al.  A review of manufacturing flexibility: systematising the concept , 2016 .

[14]  Ikou Kaku,et al.  Seru: The Organizational Extension of JIT for a Super-Talent Factory , 2012, Int. J. Strateg. Decis. Sci..

[15]  Dario Ikuo Miyake,et al.  The shift from belt conveyor line to work-cell based assembly systems to cope with increasing demand variation in Japanese industries , 2006 .

[16]  Yu Sakazume,et al.  Is Japanese Cell Manufacturing a New System? : A Comparative Study between Japanese Cell Manufacturing and Cellular Manufacturing( Production and Logistics) , 2004 .

[17]  Steve Evans,et al.  Effects of key enabling technologies for seru production on sustainable performance , 2017 .

[18]  Min Huang,et al.  A decomposition based multiobjective genetic algorithm with adaptive multipopulation strategy for flowshop scheduling problem , 2017, Natural Computing.

[19]  Ikou Kaku,et al.  Complexity of line-seru conversion for different scheduling rules and two improved exact algorithms for the multi-objective optimization , 2016, SpringerPlus.

[20]  L. Lasdon,et al.  On a bicriterion formation of the problems of integrated system identification and system optimization , 1971 .

[21]  Cheng-Hsiang Liu.  Solving the bi-objective optimisation problem with periodic delivery operations using a lexicographic method , 2016 .

[22]  Min Huang,et al.  Multiobjective optimisation design for enterprise system operation in the case of scheduling problem with deteriorating jobs , 2016, Enterp. Inf. Syst..

[23]  Ikou Kaku,et al.  How to carry out assembly line–cell conversion? A discussion based on factor analysis of system performance improvements , 2012 .

[24]  Dario Ikuo Miyake.  The Shift from Belt Conveyor Line to Work-cell Based Assembly Systems to Cope with Increasing Demand Variation and Fluctuation in The Japanese Electronics Industries , 2006 .