• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.5
• /
• pp.2038-2047
• /
• 2011

This paper presents a framework for production planning for a Slim MES(Manufacturing Execution System) of module operations in TFT-LCD(Thin Film Transistor-Liquid Crystal Display) production lines. There are differences in the line configurations and functions among the module operations in the TFT-LCD production systems. This paper presents the framework for the customized MES reflecting these differences. First, a production process is figured out through the analysis of the TFT-LCD module operations. Next, a mathematical modeling is presented reflecting the constraints of shop floors and an optimal schedule is presented through a case example. And a scheduling process using the dispatching rules reflecting the status of shop floors is presented and the performances are measured and compared. Finally, a design process for the Slim MES framework is presented.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.1
• /
• pp.87-99
• /
• 1999

A shop floor control system(SFCS) performs the production activities required to fill orders. In order to effectively control these activities, the autonomous agent-based heterarchical shop floor control architecture is adopted where a supervisor does not exist. In this paper, we define functional perspective of the heterarchical shop floor control using planning, scheduling, and execution modules. In particular, we focus on an execution module that can coordinate the planning and scheduling modules and a general execution module that easily can be modified to execute the other equipment. The execution module can be defined informally as a module that downloads and performs a set of scheduled tasks. The execution module is also responsible for identifying and resolving various errors whether they come from hardware or software. The purpose of this research is to identify all the execution activities and solving techniques under the assumptions of the heterarchical control architecture. And we model the execution module in object-oriented modelling technique for generalization. The execution module modeled in object-oriented concept can be adopted to the other execution module easily. This paper also proposes a classification scheme for execution activities of the heterarchical control architecture. Petri-nets are used as a unified framework for modeling and controlling execution activities. For solving the nonexistence of a supervisor, a negotiation-based solution technique is utilized.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.193-200
• /
• 1995

A shop floor control system(SFCS), a central part of agile manufacturing, performs the production activities required to fill orders. In order to effectively control these activities, CSCW (computer supported cooperative work) is adopted where a supervisor does not exist. In this paper, we define functional perspective of CSCW-based shop floor control using planning, scheduling, and execution functions. In particular, we focus on an execution model that can coordinate the planning and scheduling functions. Execution can be defined informally as a function that downloads and performs a set of scheduled tasks. Execution is also responsible for identifying and resolving various errors whether they come from hardware or software. The purpose of this research is to identify all the execution activities and solving techniques under the assumptions of CSCW-based heterarchical control architecture. This paper also proposes a classification scheme for execution activities of CSCW-based heterarchical control architecture. Petri-nets are used as a unified framework for modeling and controlling execution activities. For solving the nonexistence of a supervisor, A negotiation-based solution technique is utilized.

• IE interfaces
• /
• v.9 no.2
• /
• pp.159-171
• /
• 1996

In recent, most'of automobile industries adopt the concept of JIT production. According to the concept, the paternal manufacturers require their suppliers to supply parts just in time, so it is very important for a subcontractor to produce the parts in the appointed time of delivery. This study develops a production information system for Woosin Industry, which is one of such subcontractors of Hyundai Motors Company(HMC). The system is developed for use in Client/Server environment. In this study, the following three modules are developed, i. e., the production scheduling module, the sales management module to deal with the information about orders of HMC, delivery of parts, and bill collecting, and the module for supporting material requirements planning and purchase of material.

• IE interfaces
• /
• v.7 no.2
• /
• pp.75-85
• /
• 1994

This paper presents a production scheduling model in a block assembly shop in shipbuilding industry. In a block assembly shop, the most important performance criterion is load leveling, which balances manpower and work area utilization through the planning horizon. The problem is formulated as a mixed-integer nonlinear programming(MINLP) problem of which objective function is to optimize load leveling. The developed MINLP problem can not be solvable due to computational complexity. The MINLP problem is decomposed into two stage mixed-integer linear programming (MILP) problems to obtain a good solution, but the decomposed MILP problems are still computationally intractable because of combinatorial complexity. Therfore, a heuristic method using linear programming is proposed to solve two stage MILP problems sequentially. The proposed heuristic generates a good production schedule within a reasonable computation time, and it is easily applicable for establishing the production schedule in a block assembly shop in shipbuilding industry.

• Proceedings of the KIEE Conference
• /
• 1989.11a
• /
• pp.194-196
• /
• 1989

The production costing plays a key role in power system expansion and operations planning especially for the calculation of expected energy, loss of load probability and unserved energy. Therefore, it is crucial to develope a probabilistic production costing algorithm which gives sufficiently precise results within a reasonable computational time. In this respect, a number of methods of solving production simulation have been proposed. In previous paper we proposed the method used Fast Hartley Transform in convolution process with considering only the thermal units. In this paper, the method considering the scheduling of pumped-storage plants and hydro plants with energy constraints is proposed.

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

Most manufacturing systems are large and complex. It is natural to divide the control into a hierarchy consisting of a number fo different levels. Each levels is characterized by the length of the planning horizon and the kind of data required for the decision making process. This paper describes an approach for the incorporation of Maintenance times into a hierachical scheduling for a failure prone flexible manufacturing system. The Maintenance should not be performed too often because of the resulting reduction of capacity. The machine failure and preventive maintenance are considered simultaneously.

• Proceedings of the Korean Society for Quality Management Conference
• /
• 2007.04a
• /
• pp.491-497
• /
• 2007

The planning and scheduling is considered as an important function because it influence to the overall performance of production in manufacturing system for supporting global objectives. In this paper, propose the hybrid approach to solve the problem which considered alternative resources and sequences, a sequence-dependent setups and transportation times. The objective of this problem is minimize the makespan with AGV traveling time. A iterative two heuristic algorithm(PSO, SA) is proposed to obtain the sequence of operations and CPLEX package is used to obtain the optimal sub-lot sizes(OLS) when the sequence of operations and greedy-based AGV dispatching rules are fixed or given. we show that performance of iterative two heuristic algorithms and simple numerical experiment.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.715-722
• /
• 2005

Disassembly scheduling is the problem of determining the quantity and timing of disassembling used products while satisfying the demand of their parts or components over a planning horizon. The case of single product type with assembly structure is considered for the objective of minimizing the sum of disassembly operation and inventory holding costs. In particular, the resource capacity constraint is explicitly considered. The problem is formulated as an integer programming model, and a two-stage heuristic with construction and improvement algorithms is suggested in this paper. To show the performance of the heuristic, computational experiments are done on a number of randomly generated problems, and the test results show that the algorithm can give near optimal solutions within a very short amount of computation time.

• IE interfaces
• /
• v.14 no.4
• /
• pp.385-393
• /
• 2001

In this paper, a scheme of scheduling a bottleneck operation is presented for production planning of make-to-order. We focus on the problem of capacity-dependent processing time in which processing time of the bottleneck operation is not fixed, but varies with job sequence or equipment capacity. For this, a genetic algorithm is applied for job sequencing with an objective function of mean square of weighted deviation. An experimental study is implemented in power transformer plant and results are compared with those of the EDD rule. It shows that the genetic algorithm is relatively good for most cases.