• 산업경영시스템학회지
• /
• 제33권4호
• /
• pp.58-68
• /
• 2010

Particle Swarm Optimization (PSO) which has been well known to solve continuous problems can be applied to discrete combinatorial problems. Several DPSO (Discrete Particle Swarm Optimization) algorithms have been proposed to solve discrete problems such as traveling salesman, vehicle routing, and flow shop scheduling problems. They are different in representation of position and velocity vectors, operation mechanisms for updating vectors. In this paper, the performance of 5 DPSOs is analyzed by applying to traditional Traveling Salesman Problems. The experiment shows that DPSOs are comparable or superior to a genetic algorithm (GA). Also, hybrid PSO combined with local optimization (i.e., 2-OPT) provides much improved solutions. Since DPSO requires more computation time compared with GA, however, the performance of hybrid DPSO is not better than hybrid GA.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1993년도 추계학술대회발표논문집; 서강대학교, 서울; 25 Sep. 1993
• /
• pp.118-118
• /
• 1993

We consider a discrete event dynamic system called periodic job shop, where an identical mixture of items called minimal part set(MPS) is repetitively produced in the same processing order and the primary performance measure is the cycle time. The precedence relationships among events(starts of operations) are represented by a directed graph with rocurront otructure. When each operation starts as soon as all its preceding operations complete(called earliest starting), the occurrences of events are modeled in a linear system using a special algebra called minimax algebra. By investigating the eigenvalues and the eigenvectors, we develop conditions on the directed graph for which a stable steady state or a finite eigenvector exists. We demonstrate that each finite eigenvector, characterized as a finite linear combination of a class of eigenvalue, is the minimum among all the feasible schedules and an identical schedule pattern repeats every MPS. We develop an efficient algorithm to find a schedule among such schedules that minimizes a secondary performance measure related to work-in-process inventory. As a by-product of the linear system approach, we also propose a way of characterizing stable steady states of a class of discrete event dynamic systems.

• 산업공학
• /
• 제12권3호
• /
• pp.374-381
• /
• 1999

In this paper, we propose an architecture of the DNC system for Shop Floor Control/Point of Production(SFC/POP). The DNC system to be presented this paper retrieves line-up sheets which include the drawing information, making a index database for line-up sheets, NC programs and tool adjustment data. And it is interface with a raw material, jig and tool information. Also, the DNC system transmits operation information to real workers rapidly, and supports realtime monitoring by collecting the state information of machines directly. In the analysis and design phases, this paper models realtime events using the state transition diagrams. In the implementation phase, we use the ORACLE DBMS(Database Management System) as the DBMS and Developer 2000 and Microsoft Visual C++ 5.0 as the programming tools.

• 산업공학
• /
• 제7권2호
• /
• pp.107-120
• /
• 1994

This study introduces a scheduling policy to achieve unmanned operations in machining shops representing the feature of both FMS and machining centers. The proposed policy considers the practical constraints in the machining shops such as lot sizes, multiple pallets, and jig/fixtures. In addition, rescheduling to cope with extraordinary events(eg., arrival of high-priority jobs and breakdown of machines) is included. Basically, the scheduling policy consists of four procedures; (1) selection of a job according to dispatching rule, (2) selection of a machine, (3) assignment of jobs to a multiple pallet for the unmanned operation during a certain shift, and (4) prevention of unexpected machine idle caused by constraints on jig/fixture.

• 산업공학
• /
• 제18권1호
• /
• pp.22-34
• /
• 2005

This paper introduces a simulation model which is based on the process analysis of a semiconductor company. The objective of the simulation modelis not only to estimate the overall performancesof the company but also to evaluate the performances of various operation rules for shop floor control. First, in order to develop the simulation model, a time study is performed for each process after analyzing the processes for the company. Second, by using ARENA, a simulation model is constructed based on the process analysis and the time study. After the simulation model is tested and run, its results are discussed.

• 산업공학
• /
• 제15권1호
• /
• pp.99-106
• /
• 2002

A recently developed alternative to traditional production planning and control systems such as material requirement planning(MRP) and just-in-time(JIT) is the drum-buffer-rope(DBR). The DBR now being implemented in growing number of manufacturing organizations enables better scheduling and decision making on the shop floor. In implementing the DBR, however, an information system is usually needed to transmit the signal that runs from the constraint to material release. In this paper we propose a different mechanism to transmit the signal in the case that the demand of product is stable, which uses the well-known Kanban system. To improve the reality, this paper shows and example of the Kanban format, its operation, and calculation of the number of Kanbans.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2000년도 춘계공동학술대회 논문집
• /
• pp.617-620
• /
• 2000

In this paper, we show an application of constraint logic programming to the operation scheduling on machines in a job shop. Constraint logic programming is a new genre of programming technique combining the declarative aspect of logic programming with the efficiency of constraint manipulation and solving mechanisms. Due to the latter feature, combinatorial search problems like scheduling may be resolved efficiently. In this study, the jobs that consist of a set of related operations are supposed to be constrained by precedence and resource availability. We also explore how the constraint solving mechanisms can be defined over a scheduling domain. Thus the scheduling approach presented here has two benefits: the flexibility that can be expected from an artificial intelligence tool by simplifying greatly the problem; and the efficiency that stems from the capability of constraint logic programming to manipulate constraints to prune the search space in an a priori manner.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1997년도 추계학술대회 논문집
• /
• pp.847-850
• /
• 1997

This paper presents a strategy to develop the environmentally conscious machining process. To establish the knowledge the analytical and experimental methodology for he prediction of aerosol concentration due to cutting fluid atomization mechanism in machining operation. The established analytical model which is based on atomization theory analyzes the cutting fluid motion and aerosol generation in machining process. The impinging and evaporation experiments were performance to know the particle size ad evaporation rate of cutting fluid. The predictive models can be used as a basis for environmental impact analysis on the shop floor. It can be also facilitate the optimization of cutting fluid usage in achieving a balanced consideration of productivity and environmental consciousness.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2000년도 춘계학술대회 논문집
• /
• pp.948-951
• /
• 2000

This paper presents the analytical and experimental methodology for the prediction of aerosol concentration and size distribution due to cutting fluid atomization mechanism in turnining operation. The established analytical model which is based on atomization theory analyzes the cutting fluid motion and aerosol generation in machining process. The impinging and evaporation experiments were performed to know the particle size and evaporation rate of cutting fluid. The predictive models can be used as a basis for environmental impact analysis on the shop floor. It can be also facilitate the optimization of cutting fluid usage in achieving a balanced consideration of productivity and environmental consciousness.

• 산업공학
• /
• 제14권4호
• /
• pp.394-402
• /
• 2001

In this study, we deal a spatial scheduling system for the block painting process in the shipbuilding industry. In general, the spatial scheduling for the block painting process is a very complicated task. Because spatial allocation of each block in blasting and painting cells is considered simultaneously. Thus the spatial scheduling for the block painting process is the problem of planning and control of operation, which arises in shipyard. This system is developed for blocks to meet the delivery date given by the shipyard production planning system, to maximize space utilization of blasting and painting cells and to balance workload among working teams. And it has been tested using actual scheduling data from a shipyard and successfully applied in a paint shop in a shipbuilding company.