• 산업경영시스템학회지
• /
• 제23권54호
• /
• pp.13-26
• /
• 2000

Machining route selection to produce parts should be based on shop flow information because of input data at scheduling tasks and is one of the main problem in process planning. This paper addresses the problem of machining route selection in multi-stage process with machine group included a similar function. The model proposed is formulated as 0-1 integer programing considering the relation of parts and machine table size, avaliable time of each machine for planning period, and delivery date. The objective of the model is to minimize the sum of processing, transportation, and setup time for all parts. Genetic algorithm approach is developed to solve this model. The efficiency of the approach is examined in comparison with the method of branch and bound technique for the same problem. Also, this paper is to solve large problem scale and provide it if the multiple machining routes are existed an optimal solution.

• 대한기계학회논문집A
• /
• 제22권1호
• /
• pp.90-101
• /
• 1998

This paper presents a scheduling method that uses Petri net modeling and heuristic search to handle the tool setup. In manufacturing systems, a tool is attached to a particular machine to process a particular operation. The activity to attach a tool to a particular machine and detach the tool from the machine requires time. The processing time of operations varies according to the attached tool and the machine used. The method proposed in this paper uses Petri net to model these characteristics and applies a search algorithm to the reachability graph of the Petri net model to generate an optimal or near-optimal schedule. New heuristic functions are developed for efficient search. The experimental results that show the effectiveness of the proposed method are presented.

• 대한임베디드공학회논문지
• /
• 제7권6호
• /
• pp.311-321
• /
• 2012

When developing a CPS, since it is nature of CPS to interact with a physical system, CPS should be verified during its development process by real-time simulation supporting timely interactions between the simulator and existing implemented hardwares. Furthermore, when a part of a simulated system is implemented to real hardwares, i.e., incremental development, the simulator should aware changes of the simulated system and apply it automatically without manual description of the changes for effective development. For this, we suggest a real-time simulation framework including the concept of 'port' which abstracts communication details between the tasks, and a scheduling algorithm for guaranteeing 'real-time correctness' of the simulator.

• 경영과학
• /
• 제15권2호
• /
• pp.201-210
• /
• 1998

Truck dispatching is one of the most commonly occurring problems of transprot management. We developed an interactive decision support system named IDSSTD, for the truck dispatching problem where two conflicting objectives are treated and travel speed varies depending on the passing areas and time of day. The IDSSTD aids the decision-making process by allowing the user to interact directly with the database, to direct data to a decision model, and to portray results in a convenient form. The IDSSTD is consisted of two major interactive phases. The pre-scheduling interactive phase is to reduce the complexity of a given problem before applying the BC-saving heuristic algorithm and the post-scheduling interactive phase is to improve practically the algorithmic solution. The IDSSTD has the capabilities of its own manipulation(analysis and recommendation) and diverse graphic features in order to facilitate a user's interaction.

• 산업공학
• /
• 제17권2호
• /
• pp.242-248
• /
• 2004

Lot-streaming is the process of splitting a job (lot) into a number of smaller sublots to allow the overlapping of operations between successive machines in a multi-stage production system. A new genetic algorithm (NGA) is proposed for minimizing the mean weighted absolute deviation of job completion times from due dates when jobs are scheduled in a no-wait lot-streaming flow shop. In a no-wait flow shop, each sublot must be processed continuously from its start in the first machine to its completion in the last machine without any interruption on machines and without any waiting in between the machines. NGA replaces selection and mating operators of genetic algorithms (GAs), which often lead to premature convergence, by new operators (marriage and pregnancy operators) and adopts the idea of inter-chromosomal dominance. The performance of NGA is compared with that of GA and the results of computational experiments show that NGA works well for this type of problem.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1995년도 춘계공동학술대회논문집; 전남대학교; 28-29 Apr. 1995
• /
• pp.776-782
• /
• 1995

This paper presents a methodology for development of a heterarchical control system in Flexible Manufacturing Systems (FMS) environment. A Petri net based model is applied for development of control software. A real-time scheduling methodology for the heterarchical system is also developed and it is used as a software entity in the overall architecture. The partition of generic and specific modules in control software development is emphasized. The control system performs its control tasks in two stages: (1) generation of generic control code and distribution of them to each controller entity prior to system execution; (2) generation of specific control code according to job arrival and its process plan. The control software and the scheduling algorithm are evaluated by a simulation program.

• International Journal of Automotive Technology
• /
• 제8권1호
• /
• pp.39-48
• /
• 2007

This paper addresses the problem of period and priority assignment in networked control systems (NCSs) using a fixed priority scheduler. The problem of assigning periods and priorities to tasks and messages is formulated as an optimization problem to allow for a systematic approach. The temporal characteristics of an NCS should be considered by defining an appropriate performance index (PI) which represents the temporal behavior of the NCS. In this study, the sum of the end-to-end response times required to process all I/Os with precedence relationships is defined as a PI. Constraints are derived from the task and message deadline requirements to guarantee schedulability. Genetic algorithms are used to solve this constrained optimization problem because the optimization formulation is discrete and nonlinear. By considering the effects of communication, an optimum set of periods and priorities can be holistically derived.

• 한국철도학회:학술대회논문집
• /
• 한국철도학회 2003년도 춘계학술대회 논문집
• /
• pp.280-285
• /
• 2003

The process of railway traffic planning is composed of several steps such as long-term, mid-term. short-term, and real-time plan. The planning of vehicle and manpower resources is a main research topic in tactical short-term planning step. Railway vehicle is usually consisted of a power car, passenger/freight cars and human resource is composed of engine driver, cabin crew, ground personnel. So far, power car was main research target in railway vehicle scheduling problem. Recently according as the light electric railway or high-speed railway is introduced, the operational planning of trainset vehicles become important, In this paper, we introduce the conceptional model for trainset restoring problem and developed heuristic algorithm.

• 대한안전경영과학회:학술대회논문집
• /
• 대한안전경영과학회 2003년도 춘계학술대회
• /
• pp.53-61
• /
• 2003

The process of railway traffic planning is composed of several steps such as long - term, mid - term, short - term, and real - time plan. The planning of vehicle and manpower resources is a main research topic in tactical short - term planning step Railway vehicle is usually consisted of a power car, passenger/freight cars and human resource is composed of engine driver, cabin crew, ground personnel. So far , power car was main research target in railway vehicle scheduling problem. Recently according as the light electric railway or high - speed railway is introduced, the operational planning of train set vehicles become important . In this paper , we introduce the conceptional model for trainset restoring problem and developed heuristic algorithm.

• 산업공학
• /
• 제24권1호
• /
• pp.78-86
• /
• 2011

To mitigate space restriction and to raise productivity, some shipbuilding companies use floating-docks on the sea instead of dry-docks on the land. In that case, a floating-crane that can lift very heavy objects (up to 3,600 tons) is used to handle the blocks which are the basic units in shipbuilding processes, and so, very large blocks (these are called the mega-blocks) can be used to build a ship. But, because these mega-blocks can be made only in the area near the floating-dock and beside the sea, the space is very important resource for the process. Therefore, our problem is to make an efficient spatial schedule for the mega-block assembly yard. First of all, we formulate this situation into a mathematical model and find optimal solution for a small problem using a commercial optimization software. But, the software could not give optimal solutions for practical sized problems in a reasonable time, and so we propose a GA-based heuristic algorithm. Through a numerical experiment, finally, we show that the spatial scheduling algorithm can provide a very good performance.