National technical qualification does not recognised degree of working-career in labor market and an industrial field situation. National qualification is supply to nurture expert manpower and accomplish of self-development and a duty accomplishment ability improvement at a side of personal. So, This study is purposed to find that a method for recognition of working-career on the national technical qualification system According to, this study is designed to questionnaire with BSC(Balaced ScoreCard), SEM(Structure Equation Model) with the delphi method, and is analysed using the AMOS 7.0 program package. Finally, This study is suggested growing to qualification standard for an examination a degree of master craftsman only under the change of national qualification systematization as a standard to operation and control.

  The objective of this paper is to remove noises of image based on the heuristic noises filter and to extract a tumor region by using morphology techniques in breast ultrasound image. Similar objective studies have been conducted based on ultrasound imag

  This paper considers an assembly-type flowshop scheduling problem in which each job is assembled with two types of components. One type of the components is outsourced with positive lead time but the other type is fabricated in-house at the first stage.

This paper proposes a hierarchical approach to the machine loading problem when the workload and tool magazine capacity of each machine are restrained. This heuristic approach reduces the maximum workload of the machines by partially grouping them. This research deals with situations where different groups of machines performing the same operation require different processing times. This work proposes a solution that is comprised of two phases. In first phase, demand is divided into batches and then operations are allocated. In Phase II, the processing time of the operation is different for each machine group, which is composed of the same identical machines; however, these machines can perform different sets of operations if tooled differently. In partial grouping, each machine is tooled differently, but they can assist one another in processing each individual operation.

In steady-state simulation the output data of the transient phase often cause a bias in the estimation of the steady-state results. A common method is to cut off this transient phase. This paper presents a new heuristic used to detect the warm-up period in steady-state simulation output. An evaluation procedure is used to compare the presented rule, called EVR, with the method MSER-m known as the most sensitive rule in detecting bias and most consistent rule in mitigating its effects. The rules are applied to the output generated by M/M/1 queuing process and the performance of the methods is tested at 4 different levels of utilizations. Various measures of goodness are used to assess the effectiveness, consistency and confidence of the methods.

A new heuristic algorithm for the heterogeneous MCLP(Multiple Container Loading Problem) is proposed in this paper. In order to solve MCLP, this algorithm generates an initial solution by applying the new SCLP(Single Container Loading Problem) algorithm t

This paper presents a data-mining aided heuristic algorithm development. The developed algorithm includes three steps. The steps are a uniform selection, development of feature functions and clustering, and a decision tree making. The developed algorithm

A new heuristic algorithm for the heterogeneous single container loading problem is proposed in this paper. This algorithm fills empty spaces with the homogeneous load-blocks of identically oriented boxes and splits residual space into three sub spaces st

This paper dealt with a kind of heterogeneous vehicle routing problem with known demand and time deadline of customers. The customers are supposed to have one of tight deadline and loose deadline. The demand of customers with tight deadline must be fulfil

A new heuristic algorithm for the heterogeneous single container loading problem is proposed in this paper. This algorithm fills empty spaces with the homogeneous load-blocks of identically oriented boxes and splits residual space into three sub spaces starting with an empty container. An initial loading pattern is built by applying this approach recursively until all boxes are exhausted or no empty spaces are left. In order to generate alternative loading patterns, the load-blocks of pattern determining spaces are replaced with the alternatives that were generated on determining the load-blocks. An improvement algorithm compares these alternatives with the initial pattern to find improved one. Numerical experiments with 715 test cases show the good performance of this new algorithm, above all for problems with strongly heterogeneous boxes.

This paper proposes the heuristic approach for the generalized GT(Group Technology) problem to consider the restrictions which are given the number of cell, maximum number of machines and minimum number of machines. This approach is classified into two st

This paper proposes the heuristic algorithm for the generalized GT problem to consider the restrictions which are given the number of cell, maximum number of machines and minimum number of machines. This algorithm is classified into two stages. First stage is the course to form machine cells. we use the similarity coefficient which proposed and calculate the similarity values about each pair of all machines and align these values descending order. If any machine which is composed of selected similarity coefficient is possible to link the other machine on the edge of machine cell and have regard to restrictions and different kind relation among machines in the machine cell, then we assign the machine to the machine cell. Next stage is the course to form part families using proposed grouping efficacy. This stage is also completed when every part is assigned to the machine cell. The results of using the proposed algorithm are compared to the Modified p-median model. The computational results show that the proposed algorithm provides a powerful means of solving the machine-part grouping problem.

This paper proposes a heuristic scheduling algorithm to satisfy the customer''s due date in the production process under make to order cnvironment. The goal is to achicve the machine scheduling in the transformer winding process, in which consists of para

Scheduling plays an important role in shop floor planning. A scheduling shows the planned time when processing of a specific job will start on each machine that the job requires. It also indicates when the job will be completed on every process. Thus, it is a timetable for both jobs and machines. There is only one server available and arriving work require services from this server. Job are processed by the machine one at a time. The most common objective is to sequence jobs on the severs so as to minimize the penalty for being late, commonly called tardiness penalty. Based on other objectives, many criteria may serve as s basis for developing job schedules. The process also comprises all strategic planning, capital investments, management decisions, and tasks necessary to create a new product. manufacturing processes must be created so that the product can be produced in the product facility. Purchasing new equipment and training workers may be required if new technology is to be used. Tools, fixtures, and the sequence of steps in the manufacturing processes must all be developed to allow rapid, high-quality, cost effective production. Also, it may be needed to be rearrange the production facility to adapt to the new manufacturing processes. Therefore, this study tries to proposed that Scheduling by customer needs group for minimizing the problem and reducing inventory, product development time, cycle time, and order lead time.