• 대한산업공학회지
• /
• 제40권6호
• /
• pp.642-647
• /
• 2014

In this paper, a hybrid genetic algorithm (HGA) approach is proposed for an n-job, m-machine flow shop scheduling problem with limited capacity buffers with blocking in which the objective is to minimize the total stretch. The stretch of a job is the ratio of the amount of time the job spent before its completion to its processing time. HGA adopts the idea of seed selection and development in order to improve the exploitation and exploration power of genetic algorithms (GAs). Extensive computational experiments have been conducted to compare the performance of HGA with that of GA.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 2002년도 춘계학술대회 논문집
• /
• pp.505-509
• /
• 2002

The looper control of hot strip finishing mill is one of the most important control item In hot strip rolling mill process. Loopers are placed between finishing mill stands and control the mass flow of the two stands. Another important action of the looper is to control the strip tension which influences on the width of the strip. So it is very important to control both the looper angle and the strip tension simultaneously but the looper angle and the strip tension are strongly interacted by each other. The gain scheduling is to break the control design process into two steps. First, one designs local linear controllers based on linerizations of the nonlinear system at several different operating conditions. Second, a global nonlinear controller for the nonlinear system is obtained by interpolating.

• 산업공학
• /
• 제9권2호
• /
• pp.143-158
• /
• 1996

This paper deals with the development of a software module for production planning and scheduling activities of an actual die-production management system. Scheduling problems, such as master schedule and detailed schedule, are the focal point of the whole article and they are considered in terms of operation procedures. Schedule-explosion module and load levelling module are the essential components of schedule management. The scheduling module allocates the resources, determines the process priority and the planned start and completion dates of processes. Rescheduling can be done to manipulate unforeseen situations that schedule is delayed owing to inducing defectives, machine breakdowns and lumpy demands. This study indicates a practical model for the die-producation management and helps to apply it for jobs in the real situation.

• 대한산업공학회지
• /
• 제32권3호
• /
• pp.163-171
• /
• 2006

This paper considers a scheduling problem to minimize the sum of the associated scheduling (production/delivery times) cost and the delivery cost for an integrated system of a single production machine and various transportation vehicles with transportation mode selection allowed. Each transportation mode is provided with a fixed number of vehicles at the associated delivery time and cost. The proposed problem is characterized as being NP-hard. Some solution properties are also characterized. Therewith, three heuristic algorithms (called SPT-based, LWF-based and WSPT-based heuristic) and a branch-and-bound algorithm are derived. In order to evaluate the effectiveness and efficiency of the proposed algorithms, computational experiments are made with some numerical instances.

• 한국경영과학회지
• /
• 제33권2호
• /
• pp.87-101
• /
• 2008

This paper considers an order scheduling model to minimize the total weighted tardiness of orders. Each order requires different types of products. Each type of product is manufactured on its dedicated machine specified in advance. The completion time of each order is represented by the time when all the products belonging to the order are completed. The objective of this paper is to find the optimal production schedule minimizing the total weighted tardiness of a finite number of orders. In the problem analysis, we first derive a powerful solution property to determine the sequence of two consecutive orders. Moreover, two lower bounds of objective are derived and tested along with the derived property within a branch-and-bound scheme. Two efficient heuristic algorithms are also developed. The overall performances of the proposed property, branch-and-bound and heuristic algorithms are evaluated through various numerical experiments.

• 대한산업공학회지
• /
• 제30권2호
• /
• pp.159-164
• /
• 2004

Lot-streaming is the process of splitting a job (lot) into a number of smaller sublots and then scheduling these sublots in order to accelerate the completion of jobs in a multi-stage production system. Anew genetic algorithm (NGA) is proposed for an-job, m-machine, equal-size sublot lot-streaming flow shop scheduling problem with delivery windows in which the objective is to minimize the mean weighted absolute deviation of job completion times from due dates. The performance of NGA is compared with that of an adjacent pairwise interchange (API) method and the results of computational experiments show that NGA works well for this type of problem.

• 산업공학
• /
• 제11권3호
• /
• pp.1-13
• /
• 1998

This paper addresses a scheduling scheme for Flexible Flow Shop(FFS) in the case that a factory is a sub-plant of an electronic device manufacturing plant. Under this environment, job orders for the sub-plants in the production route are generated together with job processing time bucket when the customer places orders for final product. The processing time bucket for each job is a duration from possible release date to permissible due date. A sub-plant modeled FFS should schedule these jobs orders within time bucket. Viewing a Printed Circuit Board(PCB) assembly line as a FFS, the developed scheme schedules an incoming order along with the orders already placed on the scheduled. The scheme consists of the four steps, 1)assigning operation release date and due date to each work cells in the FFS, 2)job grouping, 3)dispatching and 4)machine allocation. Since the FFS scheduling problem is NP-complete, the logics used are heuristic. Using a real case, we tested the scheme and compared it with the John's algorithm and other dispatching rules.

• 한국시뮬레이션학회논문지
• /
• 제5권2호
• /
• pp.41-58
• /
• 1996

The Discrete Event Systems Specification(DEVS) formalism specifies a discrete event system in a hierarchical, modular form. This paper presents a distributed simulation environment D-DEVSim++ for models specified by the DEVS formalism. D-DEVSim++ employs a new simulation scheme which is a hybrid algorithm of the hierarchical simulation and Time Warp mechanisms. The scheme can utilize both the hierarchical scheduling parallelism and the inherent parallelism of DEVS models. This hierarchical scheduling parallelism is investigated through analysis. Performance of the proposed methodology is evaluated through benchmark simulation on a 5-dimensional hypercube parallel machine. The performance results indicate that the methodology can achieve significant speedup. Also, it is shown that the analyzed speedup for the hierarchical scheduling time corresponds the experiment.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.111.1-111
• /
• 2001

In this paper, a robust speed control is proposed for Permanent Magnet Synchronous Motor system. PMSM without reduction gear has been widely used in high performance application such as robots and machine tools. It is well known that the control performance of the PMSM is very sensitive to load disturbance and system parameter variation. The idea of the proposed speed controller based on combination of sliding mode control with fuzzy gain scheduling. The sliding mode controller leads to fast system dynamics of slight sensitivity to the load disturbance and system parameter variations, the fuzzy gain scheduling mechanism reduces the chattering phenomenon. The simulation results have proved that the proposed control scheme provides a robust control performance under load disturbance and system parameter variation.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1994년도 춘계공동학술대회논문집; 창원대학교; 08월 09일 Apr. 1994
• /
• pp.357-363
• /
• 1994

In many industrial situations the human acts as the primary scheduler since there often exist various constraints and considerations that may not be mathematically or quantitatively defined. For proper design of interactive scheduling systems, how human strategy and performance are affected by the fashion of human-computer interaction at various levels of task complexity should be investigated. In this study, two scheduling experiments were conducted. The first one showed that human schedulers could perform better than simple heuristic rules with each of typical performance measures such as average machine utilization, average tardiness, and maximum tardiness. In experiment 2, the effect of providing computer-generated initial solution was investigated. The results was that in complex problems the subjects performed significantly better when the initial solutions were generated by themselves, evidencing the importance of the continuity of strategic search through the problem.