Faculty Profiles - YANAGAWA Yoshinari

Multiple Objectives Scheduling with JIT Theory in a Flow Shop FMS

KAWTUMMACHAI Ruengsak, YANAGAWA Yoshinari, OHASHI Kazumasa, MIYAZAKI Shigeji

Transactions of the Japan Society of Mechanical Engineers. Series C. 64 ( 627 ) 4519 - 4524 1998.11

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.

Mixed-Model Assembly Line Scheduling in Consideration of Assembly Time

KURASHIGE Kenji, YANAGAWA Yoshinari, MIYAZAKI Shigeji, KAMEYAMA Yoshimasa

Transactions of the Japan Society of Mechanical Engineers. Series C. 64 ( 624 ) 3238 - 3245 1998.8

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.

Optimal Parallel Machine Scheduling in Consideration of Total Actual Flow Time and Total Processing Time

Application of Branch and Bound Method in Divided Line Balancing Problem

KURASHIGE Kenji, YANAGAWA Yoshinari, MIYAZAKI Shigeji

32 ( 2 ) 137 - 143 1998.6

OSAKADA Takafumi, YANAGAWA Yoshinari, MIYAZAKI Shigeji

Journal of Japan Industrial Management Association 49 ( 5 ) 293 - 302 1998

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

Mixed-Model Assembly Scheduling by Considering Assembly Times and Part Consumption Ratio in Single Workstation

WANGWIWATSIN Porndech, YANAGAWA Yoshinari, MIYAZAKI Shigeji

Transactions of the Japan Society of Mechanical Engineers. Series C. 63 ( 610 ) 2181 - 2188 1997.6

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.

Application of Backward Scheduling Rules in JIT/FMS Environment

KAWTUMMACHAI Ruengsak, YANAGAWA Yoshinari, MIYAZAKI Shigeji

Transactions of the Japan Society of Mechanical Engineers. Series C. 62 ( 600 ) 3371 - 3377 1996.8

Application of Branch and Bound Method Method in Divided Line Balancing Problem

KURASHIGE Kenji, YANAGAWA Yoshinari, MIYAZAKI Shigeji

Journal of the Japan Society for Precision Engineering 62 ( 5 ) 691 - 695 1996.5

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

Layout Method for Grouping Locations with Same Relation of Distances

NAGAKI Jiro, YANAGAWA Yoshinari, MIYAZAKI Shigeji

Transactions of the Japan Society of Mechanical Engineers. Series C. 62 ( 595 ) 1204 - 1209 1996.3

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

Scheduling for Parallel Machines with Different Efficiencies

YANAGAWA Yoshinari, MIYAZAKI Shigeji, HIRAKATA Satoshi, TERADO Nobuyuki

Transactions of the Japan Society of Mechanical Engineers. Series C. 62 ( 595 ) 1156 - 1162 1996.3

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

Sequencing Method for Various-assembly-timed Products in a Single Work Station : Mixed-model Assembly Scheduling Problem in JIT Production System : Part I

WANGWIWATSIN Porndech, YANAGAWA Yoshinari, MIYAZAKI Shigeji

Journal of Japan Industrial Management Association 47 ( 2 ) 84 - 90 1996

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

比較かんばん方式における定期・定量引き取り方式の優位性に関する研究

中島丈温, 柳川佳也, 宮崎茂次

日本経営工学会誌 45 ( 6 ) 604 - 604 1995

Operation Planning of MRP/JIT Method for Rarely Withdrawal Parts

NAKAJIMA Takeharu, YANAGAWA Yoshinari, MIYAZAKI Shigeji

Journal of Japan Industrial Management Association 46 ( 4 ) 284 - 290 1995

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