Dong-Won Kim

Unrelated parallel machine scheduling with setup times using simulated annealing

This paper presents a scheduling problem for unrelated parallel machines with sequence-dependent setup times, using simulated annealing (SA). The problem accounts for allotting work parts of L jobs into M parallel unrelated machines, where a job refers to a lot composed of N items. Some jobs may have different items while every item within each job has an identical processing time with a common due date. Each machine has its own processing times according to the characteristics of the machine as well as job types. Setup times are machine independent but job sequence dependent. SA, a meta-heuristic, is employed in this study to determine a scheduling policy so as to minimize total tardiness. The suggested SA method utilizes six job or item rearranging techniques to generate neighborhood solutions. The experimental analysis shows that the proposed SA method significantly outperforms a neighborhood search method in terms of total tardiness.

Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective

Abstract This paper presents several search heuristics and their performance in batch scheduling of parallel, unrelated machines. Identical or similar jobs are typically processed in batches in order to decrease setup times and/or processing times. The problem accounts for allotting batched work parts into unrelated parallel machines, where each batch consists of a fixed number of jobs. Some batches may contain different jobs but all jobs within each batch should have an identical processing time and a common due date. Processing time of each job of a batch is determined according to the machine group as well as the batch group to which the job belongs. Major or minor setup times are required between two subsequent batches depending on batch sequence but are independent of machines. The objective of our study is to minimize the total weighted tardiness for the unrelated parallel machine scheduling. Four search heuristics are proposed to address the problem, namely (1) the earliest weighted due date, (2) the shortest weighted processing time, (3) the two-level batch scheduling heuristic, and (4) the simulated annealing method. These proposed local search heuristics are tested through computational experiments with data from dicing operations of a compound semiconductor manufacturing facility.

Robot arc welding task sequencing using genetic algorithms

This paper addresses welding task sequencing for robot arc welding process planning. Although welding task sequencing is an essential step in welding process planning, it has been considered through empirical knowledge, rather than a systematic approach. Thus, an effective task sequencing method for robot arc welding is required. Welding operations can be classified by the number of weldlines and layers. Genetic algorithms are applied to tackle those welding task sequencing problems in productivity and welding quality aspects. A genetic algorithm for the Traveling Salesman Problem (TSP) is utilized to determine welding task sequencing for a multiweldline-singlepass problem. Further, welding task sequencing for multiweldline-multipass welding is investigated and appropriate genetic algorithms are introduced. A random key genetic algorithm is presented to solve multi-robot welding task sequencing: mutliweldline with multiple robots. Finally, the genetic algorithms are implemented for the welding task sequencing of three-dimensional weld plate assemblies. Various simulation tests for a welded structure are performed to find the combination of genetic algorithm parameters suitable to weld sequencing problems and to verify the quality of genetic algorithm solutions. Robot operations for weld sequences are simulated graphically using the robot simulation software IGRIP.

High-Quality NC-Data Generation in Mold and Die Manufacturing

The CAM operation which generates a process plan and NC-data for mold machining plays an important role in mold manufacturing because it quite affects down stream processes such as NC machining, polishing, and assembly operation. This study proposes a supporting system which facilitates non-experts to perform the CAM operation easily and to select the high-quality NC-data which can increase machining productivity. It also designs and implements the support system in accordance with a CAM operation scenario. To check the usability of the support system developed, this study applies it to some practical examples of molding dies.