• 산업공학
• /
• 제18권3호
• /
• pp.350-360
• /
• 2005

This paper considers a strategy for planning of rework in semiconductor monitoring burn-in test process. The equipment error in monitoring burn-in test process generates many defects. These defects are transformed into good products by rework process, i.e. retest. Rework has the advantage of saving production costs. But rework increases holding costs and incurs rework costs. In monitoring burn-in test process, rework depends on operator's experience with no pre-defined specification. In practice, a number of rework activities are performed with respect to the product importance and inventory quantity. Moreover, disregard for order jobs schedule have caused due date penalties. So a strategy for planning of rework by which order jobs schedule are not affected is suggested. Futhermore, production costs, rework costs and inventory costs for planning of rework are considered.

• 한국경영과학회지
• /
• 제17권3호
• /
• pp.137-158
• /
• 1992

We study the Multiple Product Single Facility Stockout Avoidance Problem (SAP). That is the problem of determining, given initial inventories, whether there is a multiple product single facility production schedule that avoids stockouts over a given time horizon. The optimization version of the SAP where stockouts are pnelized linearly is also studied. We call this problem the Weighted Stockout Problem (WSP). Both problems are NP-hard in the strong sense. We develop Mixed Integer Linear Programming (MIP) formulations for both the SAP and the WSP. In addition, several heuristic algorithms are presented and performances are tested using computational experiments. We show that there exist polynomial algorithms for some special cases of the SAP and the WSP. We also present a method to phase into a target cyclic schedule for infinite horizon problems. These can be used as a practical scheduling tool for temporarily overloaded facilities or to reschedule production after a disruption.

• Industrial Engineering and Management Systems
• /
• 제15권3호
• /
• pp.206-214
• /
• 2016

This paper deals with the no-wait flow shop scheduling problem in order to minimize the total time to complete the schedule or makespan. It is introduced a constructive heuristic which builds the production schedule from job partial sequences by using an appropriate mechanism of insertion. An extensive computational experiment has been performed to evaluate the performance of proposed heuristic. Experimental results have clearly shown that the presented heuristic provides better solutions than those from the best heuristics existing.

• 한국소성가공학회:학술대회논문집
• /
• 한국소성가공학회 1996년도 춘계학술대회논문
• /
• pp.101-109
• /
• 1996

Mini-mill process which is one of the new steel -marking technologies to be able to produce the hot rolled coils by thin slab caster of ISP(In-Line Strip Production) type, will be completed in the Kwangyang Steel Works of POSCO in August, 1996, SEt-Up Model of finishing mill which consists of 5 stands is the most basic and essential in mini-mill plant. Therefore, the simulation program of Finishing-mill Set-Up model were developed in this research , using new temeprature prediction model, roll gap model and rolling physical model. Using the developed FSU program , pass schedules to produce the strips with target strip thickness of 1.8mm, 2.0mm, 2.3mm, 2.7mm an d3.0mm were also determined respectively.

• Journal of applied mathematics & informatics
• /
• 제12권1_2호
• /
• pp.233-241
• /
• 2003

The rolling schedule procedure has been an important part of the Enterprise Resource Planning (ERP) systems. The performance of production planning in an ERP system depends on the selection of the three parameters in rolling schedule procedure: frozen interval, replanning interval, and planning horizon (forecast window). This research investigated, in a theoretical approach, the combined impact of selections of those three parameters. The proven mathematical theorems provided guidance to re-duction of instability (nervousness) and to seek the optimal balance between stability and responsiveness of ERP systems. Further the theorems are extended to incorporate the cost structure.

• 대한산업공학회지
• /
• 제21권2호
• /
• pp.207-216
• /
• 1995

Constructing a distributed management system has its own advantages in addressing the issue of implementing a quick responsive management system in dynamically changing environment of enterprise. We suggest a basic scheduling methodology applicable to a distributed production management system. A new concept of "flexible schedule" is introduced as a tool to accommodate dynamically changing situations of job shops. Then a search technique (referred to as CSP-CBA search) is presented to obtain such a schedule for the job shop scheduling problem, which is converted into a constraint satisfaction problem(CSP), by using the constraint based analysis(CBA). This approach is tested on more than 100 test problems. The results show that the suggested approach required shorter CPU time and solved more problems in given time than another fixed schedule method.

• 경영과학
• /
• 제10권2호
• /
• pp.61-77
• /
• 1993

This paper involves a study of developing the production scheduling system in a general job shop type mechanical factory. We consider realistic situations in the job-shop environments, such as alternative machines for operation, the new kinds of processes, the machining center with the plural pallet, the operational situation of each machine during the scheduling period, occurings of urgent orders and machine breakdowns. We also propose the methodology of re-schedule. It is very fast and acceptable for real time production control system. These all functions are implemented on IBM PC and program source is written in PASCAL language.

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

Utilizing the simulation approaches, the dynamic production scheduling system FOLS(Flexible flowshop On-Line Simulation) is developed under the flexible flowshop environment. When an interruption such as machine failure/recovery is occurred at the shop floor, the FOLS system performs evaluations for job selection rule oriented alternatives, and generates a dynamic production schedule based on the collected current shop floor data. For the case study, the FOLS system is applied to the printed circuit card assembly(PCCA) line and simulation results are reported.

• 대한조선학회논문집
• /
• 제50권5호
• /
• pp.334-342
• /
• 2013

In this paper, we analyze the procedure of the design manager for the enhancement of the hull production design process by use of the simulation method. Normally, design manager assigns design jobs according to various methods and estimates the corresponding results. When the construction drawing which is the output of the detail design where a design is dealt by zones, the design manager identifies blocks and analyzes their work difficulties, and assigns jobs to design engineers who are different in capabilities. These processes including the design engineer who can be modeled with man-hours evaluation model are represented in detail as a simulation model. As the high-level modeling for the discrete-event system, we use Event Graph model. And we implemented the simulation using Simkit which is open simulation engine for the discrete-event system. We made the simulation scenario to be written by a user in the scenario generator which is separated from the simulation model, and made the simulation result to be visualized in the form of Gantt chart in a Web. In the scenario of the irregular issuance for various construction drawings which contain different numbers of blocks, we performed the Monte-Carlo simulation according to various assignment methods to find the assignment result that satisfies the mid-term schedule.

• 대한기계학회논문집A
• /
• 제24권8호
• /
• pp.2131-2142
• /
• 2000

As recent production facilities are usually operated with unmanned material-handling system, the development of an efficient schedule with deadlock avoidance becomes a critical problem. Related researches on deadlock avoidance usually focus on real-time control of manufacturing system using deadlock avoidance policy. But little off-line optimization of deadlock-free schedule has been reported. This paper presents an optimization method for deadlock-free scheduling for Job-Shop system with no buffer. The deadlock-free schedule is acquired by the procedure that generates candidate lists of waiting operations, and applies a deadlock avoidance policy. To verify the proposed approach, simulation resultsare presented for minimizing makespan in three problem types. According to the simulation results the effect of each deadlock avoidance policy is dependent on the type of problem. When the proposed LOEM (Last Operation Exclusion Method) is employed, computing time for optimization as well as makespan is reduced.