• 대한기계학회논문집A
• /
• 제30권8호
• /
• pp.957-964
• /
• 2006

As the requirement of LCD products which are large screen and have high brightness increases, the role of light guide panel (LGP) of which micro-features diffuse the light uniformly on surface is getting important. In general, there are many errors in machining like machine tool errors process error, setup error and etc. The amount of setup error in general machining is not so big in comparison with the others, so it is mostly neglected. But, especially in v-groove micromachining, setup error has a significant effect on micro-features. Low quality product and high cost are resulted from setup error. In v-groove micromachining, to confirm the effect of setup error, it is identified and then setup error synthesis model is derived from analysis of tool and workpiece setup. In addition, to predict the micro-features affected by setup error and enhance the production efficiency, the setup condition satisfying the tolerance of micro-features is geometrically analyzed and presented.

• 산업공학
• /
• 제22권1호
• /
• pp.85-94
• /
• 2009

Nowadays, most of the major manufacturing companies prepare their manufacturing schedule using package based solutions. Even though the accuracy of the detail scheduling result is high at implementation, however, it is low during maintenance period. The main cause of low accuracy during maintenance period is due to difficulties in maintaining the accurate level of master data. In this paper, we propose to easily maintain setup time, which is one of the most important factors required in master data to achieve good scheduling result, after changing job. This paper is mainly focused on how to deduce the factors that influence the setup time in a roll-based manufacturing field with print operations. For this purpose, we employed rule based algorithm and applied for deciding setup time for the existing product items. Likewise, it can be applied to new items without any complex setup procedures, and, finally, it displays the result of the real setup-time and calculated setup-time.

• 한국경영과학회지
• /
• 제26권1호
• /
• pp.87-96
• /
• 2001

This paper considers the transfer batch scheduling problem for a two-machine flow shop with setup times consisting of attached setup time and separate setup time. The attached setup is attached to the processing and can be scheduled in anticipation of arriving work. Two cases of the separate setup are addressed. One is the case that the separate setup can be done only when a machine is idle. The other is the case that the separate setup can be done even though the machine is idle. the other is the case that the separate setup can be done even though the machine is operating. A scheduling rule similar to Johnson\`s rule is suggested to minimize makespan. the scheduling rule developed can be applied to most of the two-machine flow shop scheduling problems if some parameters are adjusted. A numerical example is presented to illustrate the scheduling rule.

• 산업공학
• /
• 제5권1호
• /
• pp.3-14
• /
• 1992

This paper deals with the development of setup planning for Automated FIXture planning system(AFIX) which selects setups, setup sequence and operation sequence in each setup according to the machining mode. In AFIX, part type considered is prismatic workpiece that use the 3-2-1 locating system as the general structure of the fixture. The heuristic algorithms selecting setup and setup sequence are based on DDR(Degree of Dimensional Relationship), AMV(Admissible Misalignment Value) and machining sterategy and feature attributes. A case example is given to illustrate the performance fo AFIX.

• Management Science and Financial Engineering
• /
• 제3권1호
• /
• pp.57-74
• /
• 1997

An EOQ-like inventory model for a manufacturing process is studied. The system is assumed to deteriorate during the production process. The results are either the production of a number of defective items, or the breakdown of the production machine. The optimal production lot size is derived. The model is extended to the case in which the probabilities of making defective items and machine breakdowns are a function of both the quantity (amount) and quality (performance) of the consumed setup cost (including the preventive maintenance cost). We further assume that the setup performance can be improved by investing in the performance improvement program. Hence, the same or a better setup outcome can be achieved with a lower setup cost. We then investigate the optimal setup cost and investment policy simultaneously, thereby achieving a better process quality and setup cost reduction concurrently.

• 대한산업공학회지
• /
• 제32권2호
• /
• pp.98-103
• /
• 2006

In this research, the single machine capacitated lot-sizing and scheduling problem with sequence- dependent setup costs and setup times (CLSPSD) is considered. This problem is the extension of capacitated lot-sizing and scheduling problem (CLSP) with an additional assumption on sequence-dependent setup costs and setup times. The objective of the problem is minimizing the sum of production costs, inventory holding costs and setup costs satisfying customers' demands. It is known that the CLSPSD is NP-hard. In this paper, the MIP formulation is presented. To handle the problem more efficiently, a conceptual model is suggested, and one of the well-known meta-heuristics, the simulated annealing approach is applied. To illustrate the performance of this approach, various instances are tested and the results of this algorithm are compared with those of the CLPEX. Computational results show that this approach generates optimal or nearly optimal solutions.

• Journal of Magnetics
• /
• 제21권3호
• /
• pp.425-430
• /
• 2016

The aim of this study was to measure the setup variation for X (lateral), Y (longitude), and Z (vertical) by taking magnetic megavoltage computed tomography (MVCT) before treating the brain, oropharynx, lung, and prostate patients on helical tomotherapy. In this study, 30 patients were chosen for each of the treatment areas, and their skin was labeled with a mark on a treatment planning reference point when taking CT. We preceded MVCT prior to tomotherapy and then conducted an auto registration based on the bony landmarks; image registration was used for automatically matching the patient's setup. Lastly, we confirmed and evaluated the translation coordinates of the images for 30 patients. The following shows the comparison result of the setup errors of each part: X (lateral) showed the highest setup errors with $3.44{\pm}2.05$ from Lung; Y (longitude) showed the highest setup errors showing $3.40{\pm}2.87mm$ from Prostate; and Z (vertical) showed the highest setup errors showing $6.62{\pm}4.38mm$ from Lung. This result verifies that the setup error can be prevented by taking MVCT before the treatment, and Planning Target Volume (PTV) margins can be reduced by referring to the resulting value of each treatment part. Ultimately, the dosage of the normal organs can be decreased as well as any side effects.

• 산업공학
• /
• 제6권1호
• /
• pp.31-45
• /
• 1993

Setup planning for machining processes is a part of fixture planning which is also a part of process planning. A setup of a part is defined as a group of features which are machined while the part is fixtured in one single fixture. Setup planning includes a number of tasks such as the selection of setup, sequence of setups and datum frame for each setup. Setup planning is an important function in fixture planning which must be able to support and to clamp a workpiece to prevent deflections caused by machining and clamping loads. This paper presents setup planning system using expert system approach(SPES) for prismatic parts which can be machined on vertical milling machine. SPES consists of preprocessing module and main processing module. Preprocessing module executes the conversion of feature data to frame type data and the determination of setups, and main processing module executes the determination of datum frame of each setup and sequance of setups. Preprocessing module is coded by C language and main processing module is a rule-based expert system using EXSYS pro. The performance of SPES is evaluated through case studies and the results show successful work except for operation sequence of machining holes. This is due to the limited rules for machining holes.

• Industrial Engineering and Management Systems
• /
• 제4권1호
• /
• pp.1-22
• /
• 2005

This paper presents new scheduling heuristics, namely Mean Progressive Weighted Tardiness Estimator (MPWT) Heuristic Method and modified priority rules with sequence-dependent setup times consideration. These are designed to solve job shop scheduling problems with new performance measures - progressive weighted tardiness penalties. More realistic constraints, which are inter-machine overlapping sequence-dependent setup times, are considered. In real production environments, inter-machine overlapping sequence-dependent setups are significant. Therefore, modified scheduling generation algorithms of active and nondelay schedules for job shop problems with inter-machine overlapping sequence-dependent setup times are proposed in this paper. In addition, new customer-based measures of performance, which are total earliness and progressive weighted tardiness, and total progressive weighted tardiness, are proposed. The objective of the first experiment is to compare the proposed priority rules with the consideration of sequence-dependent setup times and the standard priority rules without setup times consideration. The results indicate that the proposed priority rules with setup times consideration are superior to the standard priority rules without the consideration of setup times. From the second experiment and the third experiment to compare the proposed MPWT heuristic approach with the efficient priority rules with setup times consideration, the MPWT heuristic method is significantly superior to the Batched Apparent Tardiness Cost with Sequence-dependent Setups (BATCS) rule, and other priority rules based on total earliness and progressive weighted tardiness, and total earliness and tardiness.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
• /
• pp.306-309
• /
• 1996

The job shop scheduling problem has been a major target for many researchers. And, most of the past studies did not consider setup time. In many cases of real manufacturing environment, however, there exists a setup time for each operations. The setup can be divide into two parts, one can be done after job arrival. The setup time based on the latter can be summed together with processing time, but that based on the former can not be. We propose an approximation method based on shifting bottleneck procedure for solving the job shop scheduling problem with sequence independent setup time. It schedules the machines one by one, taking a bottleneck machine among the machines not yet scheduled. Every time after a new machine is scheduled, all schedules previously established are updated. Both the bottlenck search and the schedule updating procedure are based on solving a single machine scheduling problem with ready time, setup time and delivery time iteratively.