• Management Science and Financial Engineering
• /
• v.13 no.2
• /
• pp.47-77
• /
• 2007

This paper considers a scheduling problem where a customer orders multiple products(jobs) from a production facility. The objective is to minimize the sum of the order(batch) completion times. While a machine can process only one job at a time, multiple machines can simultaneously process jobs in a batch. Although each job has a unique processing time, we consider the case where batch processing times are identical. This simplification allows us to develop heuristics with improved performance bounds. This problem was motivated by a real world problem encountered by foreign electronics manufacturers. We first establish the complexity of the problem. For the two parallel machine case, we introduce two simple but intuitive heuristics, and find their worst case relative error bounds. One bound is tight and the other bound goes to 1 as the number of orders goes to infinity. However, neither heuristic is superior for all instances. We extend one of the heuristics to an arbitrary number of parallel machines. For a fixed number of parallel machines, we find a worst case bound which goes to 1 as the number of orders goes to infinity. Then, a tighter bound is found for the three parallel machine case. Finally, the heuristics are empirically evaluated.

• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 2006.11a
• /
• pp.289-292
• /
• 2006

In this paper, the hybrid algorithm of Support Vector Machine md Artificial Neural Network is used for the defect diagnostics algorithm for the aircraft turbo-shaft engine. The results of learning of ANN, especially, accuracy or speed of convergence are sensitive to the number of data, so a comparison between design point and off-design area, especially, Mach number and fuel flow variable area, is essential research. From application results for diagnostics of gas turbine engine, it was confirmed that the hybrid algorithm could detect well in the of-design area as well as design point.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.121-124
• /
• 1996

In general, cellular manufacturing system can be constructed by the following two steps. The first step forms machine cells and part families, and the second step determines cell layout based on the result of first step. Cell layout has to be considered when cell is formed becauese the result of cell formation affects it. This paper presents a cell formation algorithm and proposes an integrated mathematical model for cell formation and cell layout. The cell formation algorithm minimizes the number of exceptional element in cellular manufacturing system. New concept for similarity and incapability is introduced, based on machine-operation incidence matrix and part-operation incidence matrix. One is similarity between the machines, the other is similarity between preliminary machine cells and machines. The incapability identifies relations between machine cells and parts. In this procedure, only parts without an exceptional element are assigned to machine cell. Bottleneck parts are considered with cell layout design in an integrated mathematical model. The integrated mathematical model determines cell layout and assigns bottleneck parts to minimize the number of exceptional element and intercell moving distance, based on linearixed 0-1 integer programming. The proposed algorithm is illustrated by using numerical examples.

• IE interfaces
• /
• v.11 no.3
• /
• pp.23-40
• /
• 1998

In this paper, a method to determine the optimal configuration of operating policies in an integrated-automated manufacturing system using the Taguchi method and computer simulation experiments is presented. An integrated-automated manufacturing system called direct-input-output manufacturing system(DIOMS) is described. We only consider the operational aspect of the DIOMS. Four operating policies including input sequencing control, dispatching rule for the storage/retrieval(S/R) machine, machine center-based part type selection rule, and storage assignment policy are treated as design factors. The number of machine centers, the number of part types, demand rate, processing time and the rate of each part type, vertical and horizontal speed of the S/R machine, and the size of a local buffer in the machine centers are considered as noise factors in generating various manufacturing system environment. For the performance characteristics, mean flow time and throughput are adopted. A robust design experiment with inner and outer orthogonal arrays are conducted by computer simulation, and an optimal configuration of operating policies is presented which consists of a combination of the level of each design factor. The validity of the optimal configurations is investigated by comparing their signal-to-noise ratios with those obtained with full factorial designs.

• Journal of Korean Institute of Industrial Engineers
• /
• v.34 no.4
• /
• pp.481-488
• /
• 2008

This paper deals with a scheduling problem for two-machine flow shop, in which the preceding machine is a batch processing machine that can process a number of jobs simultaneously. To minimize makespan of the system, we present a mixed integer linear programming formulation for the problem, and using this formulation, it is shown that an optimal solution for small problem can be obtained by a commercial optimization software. However, since the problem is NP-hard and the size of a real problem is very large, we propose a number of heuristic algorithms including genetic algorithm to solve practical big-sized problems in a reasonable computational time. To verify performances of the algorithms, we compare them with lower bound for the problem. From the results of these computational experiments, some of the heuristic algorithms show very good performances for the problem.

• International Journal of Internet, Broadcasting and Communication
• /
• v.14 no.3
• /
• pp.285-291
• /
• 2022

The number of people enrolling in universities is rising due to the simplicity of applying and the benefit of earning a bachelor's degree. However, the on-time graduation rate has declined since plenty of students fail to complete their courses and take longer to get their diplomas. Even though there are various reasons leading to the aforementioned problem, it is crucial to emphasize the cause originating from the management and care of learners. In fact, understanding students' difficult situations and offering timely Number of Test data and advice would help prevent college dropouts or graduate delays. In this study, we present a machine learning-based method for early detection at-risk students, using data obtained from graduates of the Faculty of Information Technology, Dainam University, Vietnam. We experiment with several fundamental machine learning methods before implementing the parameter optimization techniques. In comparison to the other strategies, Random Forest and Grid Search (RF&GS) and Random Forest and Random Search (RF&RS) provided more accurate predictions for identifying at-risk students.

• Geomechanics and Engineering
• /
• v.38 no.5
• /
• pp.517-528
• /
• 2024

For numerous tunnelling projects implemented in urban areas due to limited space, it is crucial to take into account the interaction between the foundation, ground, and tunnel. In predicting the deformation of piled foundations and the ground during twin tunnel excavation, it is essential to consider various factors. Therefore, this study derived a prediction model for pile group settlement using machine learning to analyze the importance of various factors that determine the settlement of piled foundations during twin tunnelling. Laboratory model tests and numerical analysis were utilized as input data for machine learning. The influence of each independent variable on the prediction model was analyzed. Machine learning techniques such as data preprocessing, feature engineering, and hyperparameter tuning were used to improve the performance of the prediction model. Machine learning models, employing Random Forest (RF), eXtreme Gradient Boosting (XGB), and Light Gradient Boosting Machine (LightGBM, LGB) algorithms, demonstrate enhanced performance after hyperparameter tuning, particularly with LGB achieving an R² of 0.9782 and RMSE value of 0.0314. The feature importance in the prediction models was analyzed and P_N was the highest at 65.04% for RF, 64.81% for XGB, and P_CTC (distance between the center of piles) was the highest at 31.32% for LGB. SHAP was utilized for analyzing the impact of each variable. P_N (the number of piles) consistently exerted the most influence on the prediction of pile group settlement across all models. The results from both laboratory model tests and numerical analysis revealed a reduction in ground displacement with varying pillar spacing in twin tunnels. However, upon further investigation through machine learning with additional variables, it was found that the number of piles has the most significant impact on ground displacement. Nevertheless, as this study is based on laboratory model testing, further research considering real field conditions is necessary. This study contributes to a better understanding of the complex interactions inherent in twin tunnelling projects and provides a reliable tool for predicting pile group settlement in such scenarios.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.22 no.1
• /
• pp.15-28
• /
• 2018

Recently Machine Learning algorithms are widely used to process Big Data in various applications and a lot of these applications are executed in run time. Therefore the speed of Machine Learning algorithms is a critical issue in these applications. However the most of modern iteration Machine Learning algorithms use a successive iteration technique well-known in Numerical Linear Algebra. But this technique has a very low convergence, needs a lot of iterations to get solution of considering problems and therefore a lot of time for processing even on modern multi-core computers and clusters. Tchebychev iteration technique is well-known in Numerical Linear Algebra as an attractive candidate to decrease the number of iterations in Machine Learning iteration algorithms and also to decrease the running time of these algorithms those is very important especially in run time applications. In this paper we consider the usage of Tchebychev iterations for acceleration of well-known K-Means and SVM (Support Vector Machine) clustering algorithms in Machine Leaning. Some examples of usage of our approach on modern multi-core computers under Apache Spark framework will be considered and discussed.

• IE interfaces
• /
• v.9 no.2
• /
• pp.203-218
• /
• 1996

This paper deals with a Direct-Input-Output Manufacturing System (DIOMS) which has a number of machine centers placed along a built-in automated storage/retrieval system (AS/RS). During its operations, the storage/retrieval(S/R) machine picks up a pallet from the pickup/deposit port of a machine center and then moves it either to an empty rack opening of the AS/RS for temporary storage or to place it on the port of another machine center for subsequent operation. The machine layout problem in DIOMS is formulated as an integer mathematical programming whose objective is to minimize the total expected distance of the loaded S/R machine during a production period. Recognizing the limit of the exact solution procedure(the Branch and Bound method), two improvement-type heuristics are proposed. One is based on the simulated annealing method and the other the pairwise interchange method. The validity of the heuristics is examined with example problems.

• The Journal of the Acoustical Society of Korea
• /
• v.43 no.2
• /
• pp.207-213
• /
• 2024

In this paper, we study how to improve the performance of a machine learning-based automatic music transcription model by adding musical information to the input data. Where, the added musical information is information on the number of pitches that occur in each time frame, and which is obtained by counting the number of notes activated in the answer sheet. The obtained information on the number of pitches was used by concatenating it to the log mel-spectrogram, which is the input of the existing model. In this study, we use the automatic music transcription model included the four types of block predicting four types of musical information, we demonstrate that a simple method of adding pitch number information corresponding to the music information to be predicted by each block to the existing input was helpful in training the model. In order to evaluate the performance improvement proceed with an experiment using MIDI Aligned Piano Sounds (MAPS) data, as a result, when using all pitch number information, performance improvement was confirmed by 9.7 % in frame-based F1 score and 21.8 % in note-based F1 score including offset.