Authorship：Last author   Language：Japanese   Publishing type：Research paper (scientific journal)  

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

researchmap

Publisher：The Japan Society of Mechanical Engineers  

To keep the consumption rate of each part is very important for mixed-model assembly line scheduling in JIT production system. The goal chasing method (GC) and a number of papers have been proposed to achieve the parts usage leveling goal. These methods keep the consumption speed of parts constant as much as possible, and aim to decrease the amount of the stock in pre-process indirectly. In this paper, we set objective function based on the stock in pre-process directly. The function is influenced by different assembly time and delivery cycle among each product. And we have proposed the sequencing method. The method is concept of time-based goal chafing method (TBCG) with consideration in parts delivery cycle. By numerical experiments, effect of proposed method is presented.

DOI： 10.1299/kikaic.77.1512

CiNii Article

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：BEIHANG UNIV PRESS  

Just-in-time production systems are intended not only to trim total inventory levels, but also to trim the total inventory value and to thereby increase profits. We have proposed a heuristic method, Price Based Goal Chasing Method (PBGC), for different parts compositions and different parts prices in a mixed-model assembly scheduling situation at a single work station. The method is based on price-based goal chasing method to decrease variations in purchase expenses of parts.
In this paper, we propose a new heuristic method, Assembly Time and Parts Prices Based Goal Chasing Method (TPBGC), considering the different assembly times of respective products. In addition, problems of neglecting the different assembly times of products are discussed through comparison of results obtained using PBGC and TPBGC. Numerous better results demonstrate the effectiveness of the new heuristic method.

Web of Science

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：BEIHANG UNIV PRESS  

The number of a child who stays alone in his/her home in daytime has increased as double-income family, women's participation into the society and the numbers of nuclear families are increasing. Therefore, the demand for After-school care for children has increased. However, some facilities have only accepted a limited number of children due to supervising instructor shortage and so on. So many children stay alone in their homes who hope to attend an after-school care facility.
In this study, we developed an application which displays children's group composition by using a sociogram to support the after-school care for the children. We proposed a new sociogram that is possible to make the sociogram without conducting sociometric test by paying attention to data whom did a child play with and display the children's sociality.
Children's group composition and sociality have been expressed through numerical experiment based on data from an after-school care for children. Some improvement points of the proposal method could be found for a future study.

Web of Science

researchmap

Language：English   Publisher：The Japan Society for Production Management  

Six Sigma methodology has been used commonly in the manufacturing sector to eliminate the quantity of defects, however, recently years has been incorporated to the health sector to increase quality standard of safe and effective patient care. Six Sigma methodology helps hospitals to get at the root causes for variation and errors, and put sustainable improvements in place. This study focused on implementing Six Sigma model DMAIC (Define, Measure, Analyze, Improve, and Control) Roadmap and tools to get a solution to reduce waiting times at Okayama University Hospital. The research focused its attention on five factors to conduct the analysis. These factors are number of patients in the morning, number of patients in the afternoon. number of Doctors. service time. and number of staff from Monday to Friday. Factors were examined by performing a DOE (Design of Experiment) to analyze the impact of each factor on the waiting time. To optimize the result DOE were used to determine important factors and to find the optimum waiting times setting in the research.

DOI： 10.14846/seisankanri1995.15.3_39

CiNii Article

researchmap

J-GLOBAL

researchmap

J-GLOBAL

researchmap

J-GLOBAL

researchmap

J-GLOBAL

researchmap

Language：Japanese   Publisher：Japan Industrial Management Association  

Data envelopment analysis (DEA) is a technique to measure relative effectiveness based on a ratio scale for industries. DEA is widely used everywhere and for various models. Inverted data envelopment analysis (IDEA) is an extended model of DEA. In this study, we review business analysis using DEA and IDEA. These analysis methods analyze an object based on efficiency/inefficiency. However, a new problem has arisen in business analysis methods where the domains of efficiency and inefficiency are interconnected. We propose an improvement, suggesting a better business analysis technique. We evaluated the technique by performing a numerical value experiment with real numerical values and compared the original technique with the proposed method. As a result, by solving some examples, the proposed method meets some general practical needs of business analysis. One problem is that a unitary evaluation does not exist because the proposed method evaluates the object from the aspects of both efficiency and inefficiency. The proposed method has no problem in determining the level of efficiency, and can lead a result which will be accepted by the evaluation of individual changing parameters.

DOI： 10.11221/jima.60.119

CiNii Article

CiNii Books

researchmap

J-GLOBAL

researchmap

J-GLOBAL

researchmap

J-GLOBAL

researchmap

Language：Japanese  

DOI： 10.14846/seisankanri1995.14.2_21

CiNii Article

CiNii Books

researchmap

Language：Japanese  

CiNii Article

CiNii Books

researchmap

Language：English  

CiNii Article

CiNii Books

researchmap

Language：English   Publisher：CHINA AVIATION INDUSTRY PRESS  

Queuing theory consists of two probability distributions. One is the arrival distribution and the other is the service distribution at the queue. A model should be described with Kendall's notation to solve problems in the model which is set to reduce waiting time of outpatients. In this paper, the queuing model is, firstly, searched by queuing theory for an outpatient department. Secondly, an assignment rule is proposed by queuing simulations to reduce expected waiting time in waiting queues of outpatients. The rule is decided by four situations on the vacancy in outpatient department etc., and the sequence in the waiting lines. Finally, effectiveness of the proposed rule is verified through numerical experiments.

Web of Science

researchmap

Language：English   Publisher：CHINA AVIATION INDUSTRY PRESS  

DEA (Data Envelopment Analysis) is a technique to measure the relative effectiveness based on a ratio scale for industries. DEA is widely used in everywhere and for various models. IDEA (Inverted Data Envelopment Analysis) is an extended model of DEA. In this study, we would treat the business analysis using DEA and IDEA. These analysis methods analyses an object from the both sides of efficiency/inefficiency. However, a new problem has arisen in the business analysis which is contacting between domains of efficiency and inefficiency. We would propose an improvement suggesting better business analysis technique. We would evaluate by performing a numerical value experiment with real numerical value and compare the original technique with the proposed method. As a result by solving some examples, the proposed method meets some general social needed in business analysis. A problem has been left that a unitarily evaluation is not exist because the proposed method-evaluate the object from the both sides of efficiency/inefficiency. The proposed method has no problem to judge right or wrong of efficiency and can lead a result which will be accepted by the evaluation of personal changing parameters.

Web of Science

researchmap

Language：English   Publisher：CHINA AVIATION INDUSTRY PRESS  

The traveling salesman problem (TSP) is a typical combinatorial problem in Operations Research. GA is a useful heuristic method and uses techniques which are based on the means of natural selection such as inheritance, selection, mutation and crossover. In this study, edge exchange crossover method (EXX) has been modified to introduce 3 genders to GA which may avoid fast convergence toward a local optimal. The three genders CA keeps various gene characteristics in populations and is going to solve the tendencies. The proposed three genders GA has been compared with normal EXX through some benchmark problems in TSPLIB. The proposed method has obtained better route than the EXX in large benchmark problems.

Web of Science

researchmap

J-GLOBAL

researchmap

Language：Japanese   Publisher：Japan Industrial Management Association  

A technique using DEA to evaluate the administrative business of local governments exists. This paper analyzes administrative evaluations for court systems using DEA. In addition, an attempt is made to evaluate not only administrative efficiency, but also inefficiency using inverted DEA. The court system includes the Supreme Court, High Court, and District Court, etc. First, an administrative evaluation of the High Court is performed. Additionally, the District Court, Summary Court and Family Court in each prefecture of Japan is evaluated. As a result, a significant change in evaluation was not apparent for a few years since the evaluation period was short. Moreover, we have found that efficient courts had few lawsuit cases per judge, and that the opposite was true for inefficient courts. However, when there is a large number of judges and the number of lawsuits is low, the court is not efficient. In order to improve efficiency, the number of judges needs to be increased as a whole. However, there is also a need to reduce the number of judges in a portion of the court system where the number is excessive.

DOI： 10.11221/jima.58.54

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publisher：日本生産管理学会  

DOI： 10.14846/seisankanri1995.13.11

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publisher：日本生産管理学会  

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publisher：日本生産管理学会  

CiNii Article

CiNii Books

researchmap

researchmap

researchmap

Language：English  

Purpose - The present research aims to explore students' perceptions of the needs of employers in terms of the personal qualities of higher education graduates. Design/methodology/approach - Questionnaires were delivered to students at four universities in the Chugoku area of Japan. The students were asked to indicate how important they thought each of the personal qualities that would be needed for their future employment, and their own evaluation of their capabilities with respect to each personal quality. In addition, respondents were asked to answer other questions in relation to satisfaction with their courses, job opportunities, and sources of their personal qualities. Findings - The key findings are that job-seeking students tend to have a lower assessment of their own abilities than their perceived importance of those abilities. In particular, students rated their abilities significantly lower in communication and presentation skills. Although they rated themselves highly in terms of optimism, cooperation, and responsibility, they were dissatisfied with their personal traits in terms of taking initiative, having flexibility, and (especially) in demonstrating an entrepreneurial mind. Research limitations/implications - The sample is limited to university students in a limited geographical area of Japan. The generalizability of the results could therefore be questioned. Practical implications - The study represents a useful source of information and impartial advice for undergraduate students planning to find a job, and for higher-education academic staff and administrators managing undergraduate programs. Originality/value - This paper fulfils an identified information and resources need, and offers practical help to reform teaching and career-development processes in Japanese higher education. © Emerald Group Publishing Limited.

DOI： 10.1108/09684880510607945

Scopus

researchmap

Language：Japanese   Publisher：Japan Industrial Management Association  

A just-in-time production system was founded by Toyota Motor Corporation. A broad definition of JIT is that only the right amount of necessary goods are supplied in the right place at the right time. Keeping the rate of each part used constant (parts usage leveling goal) is the most important goal in assembly scheduling of mixed-model products in JIT production system. Since the goal-chasing method was proposed, a number of papers have dealt with this problem. The purpose of the JIT production system, however, is not only to reduce inventory levels, but also to reduce inventory costs and increase profits. Until now, this subject has not been discussed in any JIT research. Therefore, in this paper, we propose a new heuristic method for different part compositions and different parts prices in mixed-model assembly scheduling at a single work-station. It is based on a price-based goal-chasing method to decrease variations in the purchasing cost of parts. The main contribution of this paper is that we do not only consider the quantity of parts, but also the purchase price of the parts. A large number of better results shows the effectiveness of the proposed heuristic method through numerical experiments.

DOI： 10.11221/jima.55.227

CiNii Article

CiNii Books

researchmap

researchmap

Language：English   Publisher：CHINA AVIATION INDUSTRY PRESS  

A number of papers have dealt with the sequencing problem and proposed products sequencing methods since the original goal chasing method was proposed. The papers have targeted to reduce gap between actual inventory level based on actual products sequencing and ideal inventory level based on each proposed method because the goal chasing method and other many methods have targeted to keep consumption rate of each parts constant. To keep parts consumption rate is one of the most important purposes in Just-in-Time production system because it is difficult to operate pull system under fluctuating parts consumption rate.
One of the purposes of JIT production system, however, is not only to trim total inventory level but also to trim total inventory value and to increase profits. We propose a new mixed-model products sequencing method based on Value-based goal chasing method to reduce variations in purchase expense of parts at an assembly process in JIT production system. We show effectiveness of the proposed heuristic methods by numerical experiments.

Web of Science

researchmap

researchmap

researchmap

Language：English   Publisher：TAYLOR & FRANCIS LTD  

In sequencing problems for mixed-model assembly line in JIT production system, the Goal Chasing method (GC) is widely used for parts used leveling goal. The difference in assembly time of each product is not taken into consideration in the Goal Chasing method. Assembly time usually varies with product types. In recent years, the Time-Based Goal Chasing method (TBGC) has been proposed. The advantage of TBGC is to consider the influence of different assembly time of each product and idle time in production period. TBGC, however, has been only applied to single work station problems. In this paper, TBGC is applied to an assembly line problem with multiple work stations. Furthermore, the sequencing method and use of Simulated Annealing (SA) or Local Search (LS) for this problem are proposed.

DOI： 10.1080/0953728031000057325

Web of Science

researchmap

Language：Japanese   Publisher：The Japan Society of Mechanical Engineers  

This paper presents a scheduling method to maximize total profit as a performance measure in a two-stage flow shop model. The profit is defined as the difference between the revenue and the cost of production, and a scheduling method to maximize total profit is proposed using the Branch and Bound method aiming at maximizing revenue and minimizing costs. This paper compares the optimal schedule which maximize total profit with the optimal schedule which minimize total flow time searched by Johnson's theory. This paper also shows the usefulness and some characteristics of the proposed method through various numerical experiments.

DOI： 10.1299/kikaic.68.2502

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publisher：THE INSTITUTE OF SYSTEMS, CONTROL AND INFORMATION ENGINEERS (ISCIE)  

Various scheduling methods have been proposed in order to minimize total flow time or total actual flow time, and thereby promote efficient production. However, such methods are not so effective to maximize company profit, given that requests from customers and the prices of products have grown widely diversified in recent years. In such a case, it must be determined whether the profit can be maximized when both flow times are minimized. This paper proposes an optimal scheduling method which maximizes total profit as a performance measure in a single machine model. Our computational experiments show the usefulness and characteristics of the proposed method.

DOI： 10.5687/iscie.15.203

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publisher：公益社団法人日本オペレーションズ・リサーチ学会  

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publisher：日本生産管理学会  

CiNii Article

CiNii Books

researchmap

Language：English   Publisher：CHINA AVIATION INDUSTRY PRESS  

The present domestic physical distribution in Japan mainly depends on trucks. The track, however, is not good for environment. It was decided internationally in recent years that the amount of discharged CO2 should be restrained because it is main cause of the global warming. We can, therefore, expect that carbon tax will be introduced in Japan, but influence to the distribution system by the carbon tax is unknown.
In this research, we examine the influence how much the carbon. tax rate may affect the amount of discharged CO2 in the domestic physical distribution.

Web of Science

researchmap

DOI： 10.5687/iscie.15.203

CiNii Article

researchmap

Language：Japanese   Publisher：The Japan Society of Mechanical Engineers  

In mixed-model assembly line problem in JIT production system, to keep the consumption rate of each part is very important. It is called parts usage leveling goal. The goal chasing method (GC) and a number of paper have been proposed to achieve this goal. Recently, the time-based goal chasing method (TBGC) that is consideration of the different assembly time among each product has been proposed. The good point of TBGC is able to consider the working situation at assembly line. However, TBGC has been only applied to simple assembly line problem. In the assembly line, line stops do not happen because working area is not restricted and total length of the line is assumed to be long enough. In this paper, working situations are formulated in order to apply TBGC to an aessembly line problem which has line stops.

DOI： 10.1299/kikaic.67.262

Scopus

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publisher：日本生産管理学会  

CiNii Article

CiNii Books

researchmap

Language：English   Publisher：CHINA AVIATION INDUSTRY PRESS  

"Modal Shift" is advocated to shift the transport means from the truck to the railroad and/or the ship in recent years. The main means of the present domestic transport is the truck in Japan But we expect that the physical distribution only by the truck will become more difficult in the near future because of the increase in the driver's salary, the traffic congestion and the environmental problem by exhaust gas from trucks. Especially, in the environmental problem by exhaust gas, we expect that the environment lax will be introduced into Japan like Europe to regulate the amount of discharge of carbon dioxide which causes the global warming.
In this research,we shall optimize the physical distribution and the facility location based on the modal shift for environment conservation with the environment tax and we also propose the way of employing them to domestic transport.

Web of Science

researchmap

Language：English   Publisher：CHINA AVIATION INDUSTRY PRESS  

The time - based goal chasing method (TBGC) has been proposed to keep the consumption rate of each part constant in consideration of the different assembly time. The good point of TBGC is able to consider the influence of idle time and line stop time in the total assembly time. However, TBGC has been only applied to assembly line without line stop. In this paper, we apply TBGC to assembly line with line stops. Therefore, we formulate work situations on assembly line.

Web of Science

researchmap

Language：English   Publisher：Elsevier Science B.V.  

In mixed-model assembly scheduling with a single workstation, there is a new sequencing method [time-based goal chasing method (TBGC)] in consideration of the different assembly times between jobs. In this paper, we propose a new objective function in expanding the TBGC. Furthermore, we propose some heuristic methods to minimize the objective function. And through numerical experiments, we show the effectiveness of our proposal.

DOI： 10.1016/S0925-5273(98)00174-1

Scopus

researchmap

Language：English   Publisher：Elsevier Science B.V.  

In mixed-model assembly scheduling with a single workstation, there is a new sequencing method [time-based goal chasing method (TBGC)] in consideration of the different assembly times between jobs. In this paper, we propose a new objective function in expanding the TBGC. Furthermore, we propose some heuristic methods to minimize the objective function. And through numerical experiments, we show the effectiveness of our proposal.

DOI： 10.1016/S0925-5273(98)00174-1

Scopus

researchmap

Language：English   Publisher：ELSEVIER SCIENCE BV  

In mixed-model assembly scheduling with a single workstation, there is a new sequencing method [time-based goal chasing method (TBGC)] in consideration of the different assembly times between jobs. In this paper, we propose a new objective function in expanding the TBGC. Furthermore, we propose some heuristic methods to minimize the objective function. And through numerical experiments, we show the effectiveness of our proposal. (C) 1999 Elsevier Science B.V. All rights reserved.

DOI： 10.1016/S0925-5273(98)00174-1

Web of Science

researchmap

DOI： 10.11221/jima.49.384

researchmap

Language：Japanese   Publisher：Japan Industrial Management Association  

In mixed-model assembly scheduling in JIT production system, keeping the consumption rate of each part used constant (parts usage leveling goal) is important. The goal (GC) chasing method and a number of papers have been proposed to achieve this goal. In such papers, however, the difference of assembly time among each product has not been considered. It has also never been described how the influence of the difference affects the parts usage leveling goal. Recently, a time-based goal chasing (TBGC) method that considers of the different assembly times among each product has been proposed. In this paper, we propose a new objective function. Finally, we show the efficiency of our proposed method and describe the influence of many conditions by numerical experiments.

DOI： 10.11221/jima.49.384

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publisher：The Japan Society of Mechanical Engineers  

In an FMS, a most complicated problem to be solved may be the scheduling problem which is flexible due to the complexity of the system. FMS needs very high cost for installation, therefore in order to get high efficiency, the most appropriate schedule (in general means the schedule with the minimum cost) should be obtained in the stage of scheduling. In this article an FMS model which is a flow shop-type production system has been engaged. Scheduling method is based on the multiple objectives and the total objective function is to minimize the value of all concerned objectives. Consequently, scheduling algorithm has been composed by applying the backward scheduling with Simulated Annealing (SA) method to realize JIT theory. Finally, numerical example has been conducted to show how the scheduling algorithm works and especially to find the efficiency of the proposed algorithm. According to the numerical example, it is shown that the algorithm works well when it was applied with the concerned FMS system.

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publisher：The Japan Society of Mechanical Engineers  

In a mixed-model assembly line problem, two objectives has been proposed to decide the product scheduling. One is to minimize the work congestion and the other is keeping the consumption rate of each part. In JIT production system, the latter one is more important, so the goal chasing method (GC) has been prposed to achieve this goal. The difference of assembly time among each product was not cnsidered in any solution algorithms. Recently, the time based goal chasing method (TBGC) has been proposed in which the different assembly time among each product is considered. The good point of TBGC is able to consider the idle time contained in an assembly line. However, TBGC is only applied to a single work station problem. In this paper, TBGC is applied to an assembly line and numerical experiments are presented.

CiNii Article

CiNii Books

researchmap

Language：English  

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publisher：Japan Industrial Management Association  

Total actual flow time is known as an effective evaluation measure under Just-In-Time environments. In such case, minimization of the total actual flow time has been previously studied, but an algorithm which minimizes total processing time after minimization of total actual flow time has never proposed. This paper proposes an optimal scheduling algorithm in a parallel machine scheduling problem to minimize total processing time on the assumption that total actual flow time has been minimized beforehand under a Just-In-Time environment. The optimal algorithm is developed on the basis of an active new node search procedure utilizing the Branch and Bound method. Some computational experience shows the usefulness of the algorithm, which is coded in C-language.

DOI： 10.11221/jima.49.293

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publisher：The Japan Society of Mechanical Engineers  

Since the goal chasing method (GC) was first proposed to achieve a constant rate of parts usage goal in a mixed-model assembly scheduling problem, many studies have dealt with this problem. In these studies, however, the difference in assembly time among products which affects the scheduled result was not addressed. Consequently, we proposed a time-based goal chasing method (TBGC) in our previous work. In this paper, we present different definitions of the ideal number of parts used which lead to various evaluation measures, addressed and utilized in previous studies. We propose a new method, TBGC + ML, in which assemble time and usage quantities of parts are both considered evaluation measure. Then, through a number of numerical experiments, we show that our two proposed methods are superior to other methods, and discuss their effectiveness when used under different conditions.

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publisher：The Japan Society of Mechanical Engineers  

DOI： 10.1299/kikaic.62.3371

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publisher：The Japan Society for Precision Engineering  

In large scale problems of line balancing, a weak point is to spend very effort of calculation when branch and bound method is adopted to solve the result. Therefore, in this paper, they propose the method which can seek the satisfactory result by split the problem into partition. Firstly, problem is divided into several parts, in each part the optimal line balancing is investigated, and then, the results of all parts are jointed together to search the trial solution for the whole part. Lastly, in order to improve the trial solution, line balancing of the union of partitional result is conducted again to search for the satisfactory result. Furthermore, computer is used for the result calculation, the result is compared with the convent ioal method to find the efficiency of this proposed method.

DOI： 10.2493/jjspe.62.691

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publisher：The Japan Society of Mechanical Engineers  

Many previous researches for the Quadratic Assignment Problem (QAP) have been proposed and applied to several layout problems. Tabu Search setting up "tabu list" is one of the effective approaches in these researches. This paper proposes a heuristic method making use of the main features of Tabu Search for QAP. A suboptimal solution should be efficiently obtained by the proposed method which sets up some restricted and forbidden conditions under various situations. The algorithm in this method is coded in C language. Through a numerical example, steps of the algorithm are shown. The effectiveness of obtained solutions is investigated by the computational experiences.

DOI： 10.1299/kikaic.62.1204

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publisher：The Japan Society of Mechanical Engineers  

This paper concerns a sheduling problem for parallel machines with different machining efficiencies. Each job has a common due date. Neither tardiness nor early shipping are allowed. Therefore, Jobs completed early must be stored in the shop until the due date. Under these conditions the actual flow time of each job is measured from the starting time until the due date. The performance measure of schedules is the total actual flow time. An analytical procedure leads to some theorems to determine the assignment of jobs to each machine. An optimal algorithm based on these theorems is presented. A numerical example illustrates the procedure of the algorithm.

DOI： 10.1299/kikaic.62.1156

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publisher：Japan Industrial Management Association  

This paper, taking the difference of assembly time of each product into account, proposes a new heuristic method based on the goal chasing method for sequencing various-assembly-time products in a single work station. In addition, the effect of neglecting the difference of assembly time of each product is discussed through comparing a number of results obtained by the goal chasing method and our proposed method. A large number of better results show the effectiveness of our proposed method.

DOI： 10.11221/jimapre.47.2_84

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publisher：公益社団法人 日本経営工学会  

DOI： 10.11221/jimapre.45.6_604_3

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publisher：Japan Industrial Management Association  

Recently, many companies have accomplished high efficiency "stockless" manufacturing as a result of adopting "JIT" production system. Moreover, as the individual preference has become strong, the variation of products should be developed rapidly. Therefore, in manufacturing is often processed only 1 unit per 1 month. Suppose that KANBAN is applied to such rarely withdrawal parts, the quantities of WIP become larger in the factory. MRP/JIT method, an integrated concept of MRP and KANBAN, is proposed to solve problems caused by rarely withdrawal parts in KANBAN production system. The proposed MRP/JIT system, the improved fixed interval withdrawal KANBAN system are compared mutually under variety conditions like processed rate of parts and analyzed total operation cost. Furthermore, the efficiency of the above-mentioned methods is investigated.

DOI： 10.11221/jimapre.46.4_284

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publisher：公益社団法人日本オペレーションズ・リサーチ学会  

CiNii Article

CiNii Books

researchmap

Language：English  

This paper deals with an optimal operation planning for the fixed quantity withdrawal Kanban system with variable leadtimes and different consumption rates of parts for each production term. The behaviour of the optimal operation planning which minimizes the average total operation cost is shown by means of simulation analysis of various values of parameters: the order cost factor, the range of consumption rates of parts and the range of leadtimes for delivery. © 1994.

DOI： 10.1016/0925-5273(94)90129-5

Scopus

researchmap

Language：Japanese   Publisher：公益社団法人 日本経営工学会  

DOI： 10.11221/jimapre.45.3_281_3

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publisher：公益社団法人 日本経営工学会  

DOI： 10.11221/jimapre.44.6_543_7

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publisher：公益社団法人 日本経営工学会  

DOI： 10.11221/jimapre.44.3_254_6

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publisher：Japan Industrial Management Association  

Conventional Kanban system requires an assumption that no defect exists in a container delivered to the succeeding station. In this paper, the effect of the defective parts in a container on the optimal operation planning is analyzed. The analysis leads to the optimal order interval (R^*) and the optimal container capacity (u^*) which minimize the total operating costs including the shortage inventory cost per hour due to the defective parts in the fixed order interval Kanban system. The result shows that u^* must always be smaller than the optimal container capacity under the conditions of no defective part.

DOI： 10.11221/jimapre.42.6_440

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publisher：Japan Industrial Management Association  

This paper deals with the fixed order interval withdrawal Kanban system under the variable demand rates. Firstly, two methods, the adaptable capacity of containers and the adaptable number of Kanbans, are introduced. Secondly, the algorithm to determine the optimal operation planning for the two methods is presented. Thirdly, the solutions by the two methods for various numerical examples are compared. The results indicate that the total operation cost under the adaptable capacity containers is lower than the total operation cost under the adaptable number of Kanbans for the small variation of hourly demand.

DOI： 10.11221/jimapre.43.3_179

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publisher：Japan Industrial Management Association  

This paper deals with an optimal operation planning for the fixed quantity withdrawal Kanban system with variable leadtime and different consumption rate of parts for each period. The behaviour of the optimal planning (the optimal container capacity) which minimizes average total operation cost is shown by means of simulations under various values of parameters : the order cost factor, the range of consumption rate of parts and the range of leadtime for delivery.

DOI： 10.11221/jimapre.43.1_1

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publisher：公益社団法人 日本経営工学会  

DOI： 10.11221/jimapre.42.3_206_6

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publisher：公益社団法人 日本経営工学会  

DOI： 10.11221/jimapre.41.6_431_4

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publisher：Japan Industrial Management Association  

In the majority of previous researches on Kanban system, the leadtime for delivery is treated as a fixed value.In many practical situations, however, the leadtime is likely variable. In this paper, an optimal operation planning of the fixed-interval withdrawal Kanban with variable leadtime is proposed. A cost is incurred for the inventory level less than the safety inventory level, since the risk of shortage of inventory should be considered.Behaviors of the optimal number of Kanbans and withdrawal interval of Kanban are investigated in terms of various parameters such as standard deviation and the mean of leadtime.

DOI： 10.11221/jimapre.40.6_399

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publisher：公益社団法人 日本経営工学会  

DOI： 10.11221/jimapre.41.3_217_5

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publisher：Japan Industrial Management Association  

This paper deals with the optimal operation planning for the fixed quantity withdrawal kanban system. First, the formulas are given for obtaining the average inventory level and the minimum number of Kanbans to be required for fixed quantity withdrawal Kanban system. Secondly, the algorithm is proposed to determine the optimal container capacity so as to minimize the total operation cost composed of inventory cost and withdrawal cost. Thirdly, the behaviour of the optimal plannings is analysed under various values of parameters ; the order cost factor, the average consumption of parts per hour, and the duration of period in which the consumption rate of parts is constant.

DOI： 10.11221/jimapre.41.1_37

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publisher：Japan Industrial Management Association  

A procedure for minimizing the total operating costs in the fixed interval withdrawal Kanban system has been proposed in terms of two decision variables (order interval and container capacity). In the practical situation, however, the transportation strategy between the preceeding stations and the succeeding stations is critical for minimizing the withdrawal cost under the mixed parts delivery. In this paper an algorithm is proposed to determine the suitable transportation strategy among two major categories, depot system and picking up system, as well as the optimal order interval, container capacity and necessary number of Kanbans in the supplier Kanben.

DOI： 10.11221/jimapre.40.6_407

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publisher：公益社団法人 日本経営工学会  

DOI： 10.11221/jimapre.40.5_363_4

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publisher：Japan Industrial Management Association  

In Part I the optimal order interval of the fixed interval withdrawal Kanban system has been given to minimize the total operating cost. In this paper the cost function compoesed of inventory cost, order cost, and container soct for the supplier Kanban system including the inventory at the preceding station is analyzed. The optimal operation planning of the supplier Kanban is given in terms of two decision variables-the order interval and the container capacity-on the basis of field data in a factory ; the behaviours of optimal order interval and container capacity are investigated under various values of parameters.

DOI： 10.11221/jimapre.40.3_141

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publisher：公益社団法人 日本経営工学会  

DOI： 10.11221/jimapre.40.3_197_4

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publisher：公益社団法人 日本経営工学会  

DOI： 10.11221/jimapre.39.3_194_4

CiNii Article

CiNii Books

researchmap

Event date： 2022.9.3 - 2022.9.4

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Event date： 2021.9.4 - 2021.9.5

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Event date： 2020.10.25

Language：Japanese   Presentation type：Oral presentation (general)  

Venue：online  

researchmap

Event date： 2019.9.9

Language：Japanese   Presentation type：Oral presentation (general)  

Venue：タワーホール船掘  

researchmap

Event date： 2009.9.12 - 2009.9.13

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Event date： 2009.9.12 - 2009.9.13

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Event date： 2009.9.12 - 2009.9.13

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Event date： 2009.9.12 - 2009.9.13

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Event date： 2009.3.14 - 2009.3.15

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Event date： 2008.10.18 - 2008.10.19

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Event date： 2008.9.13 - 2008.9.14

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Event date： 2008.5.10 - 2008.5.11

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Event date： 2008.3.15 - 2008.3.16

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Event date： 2008.3.15 - 2008.3.16

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Event date： 2008.3.15 - 2008.3.16

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Event date： 2007.3.17 - 2007.3.18

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Event date： 2007.3.17 - 2007.3.18

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Event date： 2007.3.17 - 2007.3.18

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Event date： 2007.3.17 - 2007.3.18

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Event date： 2006.11.5

Venue：広島  

researchmap

Event date： 2006.11.4

Venue：広島  

researchmap

Event date： 2006.11.4

Venue：広島  

researchmap

Event date： 2006.9.9 - 2006.9.10

Venue：平塚市  

researchmap

Event date： 2006.3.18 - 2006.3.19

Venue：大阪市  

researchmap

Event date： 2006.3.18 - 2006.3.19

Venue：大阪市  

researchmap

Event date： 2005.9.4

Venue：名古屋市  

researchmap

Event date： 2005.9.4

Venue：名古屋市  

researchmap

Event date： 2005.9.4

Venue：名古屋市  

researchmap

Event date： 2005.5.14

Venue：東京  

researchmap

Event date： 2004.8.28

Venue：名古屋市  

researchmap

Event date： 2004.8.28

Venue：名古屋市  

researchmap

Event date： 2004.8.28

Venue：名古屋市  

researchmap

Event date： 2004.5.22

Venue：高崎市  

researchmap

Event date： 2004.3.6

Venue：西宮市  

researchmap

Event date： 2003.10.19

Venue：大阪  

researchmap

Event date： 2003.9.21

Venue：長崎  

researchmap

Event date： 2002.10.10

Venue：大阪  

researchmap

Event date： 2002.3.27

Venue：富山  

researchmap

Event date： 2001.11.18

Venue：北九州市  

researchmap

Event date： 2001.10.10

Venue：札幌市  

researchmap

Event date： 2001.5.2

Venue：小金井市  

researchmap

Event date： 2000.11.5

Venue：西条  

researchmap

Event date： 2000.9.10

Venue：幕張  

researchmap

Event date： 2000.3.26

Venue：岡山  

researchmap

Event date： 1999.10.24

Venue：札幌  

researchmap

Event date： 1999.10.15

Venue：京都  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：English   Presentation type：Oral presentation (general)  

researchmap