【正文】 in reality, to achieve the goal of minimizing the costs of inputs. JITKANBAN is an important system, which is used in production lines of many industries to minimize workinprocess and throughput time, and maximize line efficiency. In this paper, the authors have made an attempt to review the stateofart of the research articles in the area “JITKANBAN system”. After a brief introduction to push and pull systems, different types of kanban and their operating principles, blocking mechanisms, the authors have classified the research articles under JITKANBAN system into five major headings, viz., empirical theory, modeling approach, variability and its effect, CONWIP and JITSCM. Also, the authors have provided a section for special cases under JITKANBAN. This paper would help the researchers to 吉林化工學(xué)院 本科 畢業(yè)設(shè)計（論文）外文翻譯 13 update themselves about the current directions and different issues under JITKANBAN system, which would further guide them for their future researches. The directions for future researches are presented below. The flow shop as well as mixed model assembly line problems e under binatorial category. Hence, metaheuristics viz., simulated annealing, geic algorithm and tabu search may be used to find solution to determine the minimum number of kanbans and other measures. In simulated annealing algorithm, researchers can aim to device a better seed generation algorithm which will ensures better starting solution. In most of the papers, parisons are done only based on relative improvements. Instead of this approach, parisons based on plete ANOVA experiments would provide reliable inferences. This algorithm developed by Elizabeth Vergara et al. [18] uses only twopoint crossover geic operators. A third geic operator may be introduced to further improve the performance of the evolutionary algorithm. The evolutionary algorithm may be modified to handle plex supply chain problem. In JITSCM related research works, effort should be directed to develop simulation as well as metaheuristics to derive results under probabilistic conditions. In the work of Sarah M. Rayan et al. [69], the application of single chain analysis for multiple chain operation raises an open question whether a single WIP level should be maintained for all products or individual levels for each product. Further, most of the studies use simulation. Hence, future research shall be directed to develop improved search procedures for finding WIP levels in kanban systems. As an extension to the work of Krieg et al. [38], a deposition algorithm can be developed for multiproduct kanban systems with state dependent setups. The adaptive approach suggested by Tardif et al. [85] may be extended for multistage, multiproduct kanban system. The work of Lai et al. [41] can be extended by including more variables and elements and conducting 吉林化工學(xué)院 本科 畢業(yè)設(shè)計（論文）外文翻譯 14 experiments to investigate the stability of the system under various conditions such as the sudden increase in demand and random demand, experimenting on the system behaviour of different types of customer and modes of manufacturing. The nested partitioned method provided by Leyuan Shi and Shuli Men [43] can be enhanced by incorporating any one or a bination of the many other heuristics viz., elaborate partitioning, sampling, backtracking scheme, simulation, etc. Then, they can be applied to binatorial problems of this type Ants colony optimization algorithm is a recent inclusion to the existing metaheuristics viz., simulated annealing algorithm, geic algorithm and tabu search. So, a researcher can study the solution accuracy as well as required putational time of this algorithm for his/her JIT problem of interest, which falls under binatorial category and pare its results with the results of the other three heuristics (metaheuristics). Source: Kumar, , 2021.“Literature review of JITKANBAN system”.The International Journal of Advanced Manufacturing Technology, ,.