This paper proposes an algorithm for the Unrelated Parallel Machine Scheduling Problem(UPMSP) without setup times, aiming to minimize total tardiness. As an NP-hard problem, the UPMSP is hard to get an optimal solution. Consequently, practical scenarios are solved by relying on operator's experiences or simple heuristic approaches. The proposed algorithm has adapted two methods: a policy network method, based on Transformer to compute the correlation between individual jobs and machines, and another method to train the network with a reinforcement learning algorithm based on the REINFORCE with Baseline algorithm. The proposed algorithm was evaluated on randomly generated problems and the results were compared with those obtained using CPLEX, as well as three scheduling algorithms. This paper confirms that the proposed algorithm outperforms the comparison algorithms, as evidenced by the test results.

This paper is proposing a novel machine scheduling model for the unrelated parallel machine scheduling problem without setup times to minimize the total completion time, also known as “makespan”. This problem is a NP-complete problem, and to date, most approaches for real-life situations are based on the operator’s experience or simple heuristics. The new model based on the Memetic Algorithm, which was proposed by P. Moscato in 1989, is a hybrid algorithm that includes genetic algorithm and local search optimization. The new model is tested on randomly generated datasets, and is compared to optimal solution, and four scheduling models; three rule-based heuristic algorithms, and a genetic algorithm based scheduling model from literature; the test results show that the new model performed better than scheduling models from literature.

This paper considers a parallel-machine scheduling problem with dedicated and common processing machines using GA (Genetic Algorithm). Non-identical setup times, processing times and order lot size are assumed for each machine. The GA is proposed to minimize the total-tardiness objective measure. In this paper, heuristic algorithms including EDD (Earliest Due-Date), SPT (Shortest Processing Time) and LPT (Longest Processing Time) are compared with GA. The effectiveness and suitability of the GA are derived and tested through computational experiments.

In this paper, we raised the performance of heuristic algorithm to assign job to workers in parallel line inspection process without sequence. In previous research, we developed the heuristic algorithm. But the heuristic algorithm can't find optimal solution perfectly. In order to solve this problem, we proposed new method to make initial solution called FN(First Next) method and combined the new FN method and old FE method using previous heuristic algorithm. Experiments of assigning job are performed to evaluate performance of this FE+FN heuristic algorithm. The result shows that the FE+FN heuristic algorithm can find the optimal solution to assign job to workers evenly in many type of cases. Especially, in case there are optimal solutions, this heuristic algorithm can find the optimal solution perfectly.

Traveling salesman problem is to minimize the total cost for a traveling salesman who wants to make a tour given finite number of cities along with the cost of travel between each pair them, visiting each cities exactly once before returning home. Traveling salesman problem is known to be NP-hard, and it needs a lot of computing time to get the optimal solution, so that heuristics are more frequently developed than optimal algorithms. This study suggests a hybrid parallel genetic algorithm(HPGA) for traveling salesman problem The suggested algorithm combines parallel genetic algorithm, nearest neighbor search, and 2-opt. The suggested algorithm has been tested on 7 problems in TSPLIB and compared the results of existing methods(heuristics, meta-heuristics, hybrid, and parallel). Experimental results shows that HPGA could obtain good solution in total travel distance minimization.

Reliability has been considered as a one of the major design measures in various industrial and military systems. The main objective is to suggest a mathematical programming model and a hybrid parallel genetic algorithm(HPGA) for the problem that determin

다분야통합해석에 기반한 설계문제는 일반적으로 전체 설계과정에서 매우 큰 계산시간을 요구하며, 이러한 계산시간을 단축하기 위해 병렬처리시스템을 도입하는 것이 필수적이다. 그러나 다분야통합해석에 기존의 병렬처리기법을 적용하기 위해서는 해석에 필요한 모든 CAE 소프트웨어들이 병렬처리시스템의 모든 서버에 설치되어 있어야 하며, 이는 매우 큰 CAE 소프트웨어의 비용을 필요로 한다. 본 논문에서는 이러한 문제점을 해결하기 위해 가중치 기반 멀티큐 부하분산 알고리즘을 제안하였다. 제안된 알고리즘은 서버들의 성능과 설치된 CAE 소프트웨어들의 종류가 각기 다른 이종 병렬처리시스템을 고려하였으며 성능검증을 위해 선입선출(First Come First Servre) 알고리즘을 적용한 경우와 비교한 전산실험을 수행하였다.

Among the semiconductor If-chips, unlike memory chips, a majority of Application Specific IC(ASIC) products are produced by customer orders, and meeting the customer specified due date is a critical issue for the case. However, to the one who understands the nature of semiconductor manufacturing, it does not take much effort to realize the difficulty of meeting the given specific production due dates. Due to its multi-layered feature of products, to be completed, a semiconductor product(called device) enters into the fabrication manufacturing process(FAB) repeatedly as many times as the number of the product specified layers, and fabrication processes of individual layers are composed with similar but not identical unit processes. The unit process called photo-lithography is the only process where every layer must pass through. This re-entrant feature of FAB makes predicting and planning of due date of an ordered batch of devices difficult. Parallel machines problem in the photo process, which is bottleneck process, is solved with restricted roll out algorithm. Roll out algorithm is a method of solving the problem by embedding it within a dynamic programming framework. Restricted roll out algorithm Is roll out algorithm that restricted alternative states to decrease the solving time and improve the result. Results of simulation test in condition as same as real FAB facilities show the effectiveness of the developed algorithm.

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