• Industrial Engineering and Management Systems
• /
• v.15 no.1
• /
• pp.11-18
• /
• 2016

This paper considers a scheduling problem in a flexible job shop with a reconfigurable manufacturing cell. The flexible job shop has both operation and routing flexibilities, which can be represented in the form of a multiple process plan, i.e. each part can be processed through alternative operations, each of which can be processed on alternative machines. The scheduling problem has three decision variables: (a) selecting operation/machine pairs for each part; (b) sequencing of parts to be fed into the reconfigurable manufacturing cell; and (c) sequencing of the parts assigned to each machine. Due to the reconfigurable manufacturing cell's ability of adjusting the capacity, functionality and flexibility to the desired levels, the priority scheduling approach is proposed in which the three decisions are made at the same time by combining operation/machine selection rules, input sequencing rules and part sequencing rules. To show the performances of various rule combinations, simulation experiments were done on various instances generated randomly using the experiences of the manufacturing experts, and the results are reported for the objectives of minimizing makespan, mean flow time and mean tardiness, respectively.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1999.04a
• /
• pp.318-319
• /
• 1999

• Journal of Korea Society of Industrial Information Systems
• /
• v.21 no.4
• /
• pp.95-110
• /
• 2016

The purpose of this study is to design a service encounter of a duty free shop using a blueprinting method. This case study analyzed differences between city-based and airport-based duty free shop and proposed a flow chart based on administration blueprinting of the duty free shop in South Korea. The paper presented process criteria based on administrative procedures of customers in city-based and airport-based duty free shop. The results of the study provided the cause of failure with waiting point of customer and customer service and suggested management plan to solve failure. Also, the study addressed more customer-oriented service delivery processes to improve service quality and customer satisfaction through waiting and failure points.

• The Journal of Bigdata
• /
• v.7 no.1
• /
• pp.75-87
• /
• 2022

This study investigates a dynamic flexible flow shop scheduling problem under uncertain rework operations for an automobile pipe production line. We propose a weighted dispatching rule (WDR) based on the multiple dispatching rules to minimize the weighted sum of average flowtime and tardiness. The set of weights in WDR should be carefully determined because it significantly affects the performance measures. We build a discrete-event simulation model and propose a genetic algorithm to optimize the set of weights considering complex and variant operations. The simulation experiments demonstrate that WDR outperforms the baseline dispatching rules in average flowtime and tardiness.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.2
• /
• pp.79-97
• /
• 1997

Many dispatching rules have been developed for the on-line control of product flow in a job shop. The introduction of a flexible manufacturing system (FMS) has added a new requirement to classical job shop control problem : the selection of machines by parts of different types. An FMS can keep a great deal of information on the status of the system, such as information on what is scheduled in the near future, with great accuracy. For example, the knowledge of the time when the next part will arrive at each machine can be neneficial for the routing. This paper tests the effects of the use of this knowledge for part routing on the parts flow time (sum of the time for waiting and service) under a simple routing procedure- a look-ahead routing procedure. A test under many operating conditions shows that the reduction of part flow time from the cases without using this information is between 1% and 11%, which justifies more study on this routing procedure at real production sites when machine capacity is a critical issue. The test results of this paper are also valid for other highly automated systems such as the semi-conductor fabrication plants for routing when the arrivals of parts in the near future are known.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.34 no.4
• /
• pp.82-88
• /
• 2011

A typical job sequencing problem is studied in this research to improve productivities in manufacturing companies. The problem consists of two-stage parts and assembly processes. Two parts are provided independently each other and then two sequential assembly processes are followed. A new heuristic is developed to solve the new type of sequencing problem. Initial solution is developed in the first stage and then the initial solution is improved in the second stage. In the first stage, a longer part manufacturing time for each job is selected between two, and then a sequence is determined by descending order of the times. This initial sequence is compared with Johnson's sequence obtained from 2-machine assembly times. Any mismatches are tried to switch as one possible alternative and completion time is calculated to determine whether to accept the new sequence or not to replace the current sequence. Searching process stops if no more improvement can be made.

• Journal of the Korea Society for Simulation
• /
• v.20 no.3
• /
• pp.119-127
• /
• 2011

Overhaul and repair service means the sequential processes of disassembly, repair and reassembly for a product which has been used for a long time. Overhaul is required for the companies producing airplanes, ships, trains, military weapons and heavy industrial equipments which are very expensive and have a long life cycle. The most important performance measure of the overhaul repair shop is usually the lead time. Thus, how to design the manufacturing system to meet the delivery date is a major concern in overhaul repair shop. This paper introduces the case study of an overhaul repair shop producing military weapon systems with the 3D simulation tool, $QUEST^{TM}$. At first, the characteristics of overhaul shop and what should be considered for simulation modeling are explained. Then, various simulation scenarios including two types of disassembly systems, one is flow line system and the other is cell system, are discussed with the results of simulation experiments.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.17 no.32
• /
• pp.63-71
• /
• 1994

The purpose of this paper is to describe an effective cell scheduling system for flexible manufacturing cells. Based on the FMC characteristics, cell scheduling can be defined as a dynamic modified flow shop working in a real-time system. This paper attempt to find the optimal cell scheduling when minimizing the mean flow time for n-job/m-machine problems in static and dynamic environments. Real-time scheduling in an FMC environment requires rapid computation of the schedule.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.14 no.24
• /
• pp.97-103
• /
• 1991

This paper deals with a scheduling problem with the objective of maximizing the throughput rate in flexible manufacturing system with shop type. Manufacturing system is consisted of multi-stage in series. All kinds of parts are processed in same in processing time. No buffer space is allowed between stages, and no part waiting is allowed in each stage. Part flow control method for determining the optimal production sequence of all parts and the production starting time of each part is proposed.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2012.10a
• /
• pp.511-512
• /
• 2012