• Proceedings of the Korea Society for Simulation Conference
• /
• 1999.10a
• /
• pp.217-217
• /
• 1999

The main objective of this study is to simulate the design and operational policies of the assembly shop of an automotive plant for planning purposes and to find possible improvements. The simulation study was used to answer the following questions: How does the sequence affect the daily throughput\ulcorner What are the bottlenecks to the assembly lines in a given scenario\ulcorner A Simulation model was developed in accordance with the objective of this study. The model incorporates detailed workstation logic to accurately model downtime results through the use of a pull cord system. It is written with SIMAN. The discrete event feature of SIMAN does not adequately model the conveyor systems of the asembly shop. As a result, a few subroutines were added to the SIMAN modeling structures to mimic the operations of the assembly shop. Use of the model uncovered attractive improvement opportunities, such as a tremendous gain in annual volume if four additional spaces were added to a between-line buffer.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.45
• /
• pp.165-180
• /
• 1998

To make a scheduling for minimizing the tardiness of delivery, we present an efficient heuristic algorithm for job-shop scheduling problems with due dates. The SDME(Slack Degree Modified Exchange) algorithm, which is the proposed heuristic algorithm, carries out the operation in two phases. In the phase 1, a dispatching rule is employed to generate an active or non-delay initial schedule. In the phase 2, tasks selected from a predetermined set of promising target operations in the initial schedule are tested to ascertain whether, by left-shifting their start times and rearranging some subset of the remaining operations, one can reduce the total tardiness. In the numerical example, the results indicate that the proposed SDME algorithm is capable of yielding notable reductions in the total tardiness for practical size problems.

• Industrial Engineering and Management Systems
• /
• v.15 no.1
• /
• pp.32-40
• /
• 2016

This paper considers a special case of a three machine flow shop scheduling problem in which operation processing time of each job is ordered such that machine 1 has the longest processing time, whereas machine 3, the shortest processing time. The objective of the problem is the minimization of the total completion time. Although the problem is simple, its complexity is yet to be established to our best knowledge. This paper first introduces the problem and presents some optimal properties of the problem. Then, it establishes several special cases in which a polynomial-time optimal solution procedure can be found. In addition, the paper proves that the recognition version of the problem is at least binary NP-complete. The complexity of the problem has been open despite its simple structure and this paper finally establishes its complexity. Finally, a simple and intuitive heuristic is developed and the tight worst case bound on relative error of 6/5 is established.

• Journal of the Korean Society for Precision Engineering
• /
• v.11 no.5
• /
• pp.75-87
• /
• 1994

The demand for automatic manufacturing systems is increasing. One of the crucial obstacles to the Flexible Manufacturing System(FMS) is the lack of excellent strategies for efficient operations. The aim of this research is constructing an automaton scheme in the low level of factories where various machineries are involved. An operating strategy is established for an automation unit named as a cell which resides between the upper level computers and manufacturing shop floor. The cell is defined to fit into the total manufacturing system. The defined cell has more functions than conventional cells. A scheduling scheme is adopted for the shop floor operations. A set of software has been developed and tested through simulations and shop floor experiments.

• Korean Business Review
• /
• v.13
• /
• pp.263-273
• /
• 2000

Mercedes-Benz United States International (MBUSI) built a manufacturing facility for the production of the new M-Class All Activity Vehicle (AAV). This plant consists of three large sequential shops: the Body Shop, the Paint Shop, and the Assembly Shop. When the plant reaches full production, 270 vehicles will be produced each day by two shifts. A finished vehicle is intended to leave the end of the assembly line every 3.6 minutes. The main objective of this study is to simulate the design and operational policies of the AAV assembly facility and to verify that the daily throughput requirements can be met. The simulation study also answered the following questions: What is the maximum throughput (capacity) of the facility? What is the daily distribution of throughput? Does the current design produce the required throughput of 270 cars per day? How do the buffers behave in terms of quantity fluctuations? What are the possible bottlenecks to the desired throughput? This paper provides a description of the integrated simulation model to analyze the capability of the production facilities at MBUSI. This paper includes the inputs used for the development of each of the three individual models: the Body Shop, the Paint Shop, and the Assembly Shop. Additionally, it includes descriptions of the model features and the assumptions that were made.

• Journal of Korean Institute of Industrial Engineers
• /
• v.20 no.4
• /
• pp.181-192
• /
• 1994

In an order-oriented production system such as mold manufacturing, the production starts with an order acceptance, and the production planning is set up according to the accepted order information. Such a work can be done through a dynamic process management system which can reflect shop floor situation dynamically. In this paper, so called the Quick order acceptance evaluation system that can investigate order confirmation quickly, is discussed. When an order is asked, this system must consider the time constraint to determine whether to accept or not, and must be reliable when the determined results are used in the shop floor. For this system, firstly, we simplified the machines by grouping based on their operation capabilities, secondly, we conducted load analysis to calculate available capacities during given periods using heuristic method instead of mathematical algorithm, thirdly, expert can input his experienced knowledge into the system interactively when simulation results don't meet the required due dates. As a case study, we applied this system to an injection mold manufacturing factory.

• IE interfaces
• /
• v.11 no.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.

• Proceedings of the Korean Society of Marine Engineers Conference
• /
• 2005.11a
• /
• pp.73-74
• /
• 2005

Shipping company and operators have to manage well to keep shipping schedules without problems in main engine. Specially operators have to operate main engine within the limit of operation point, and adjust related parameters to be operated safely and continuously. Also operators have ability to analyze fouling condition of hull through comparing data gotten from P-V curve and performance results of new building ships in trial with service ships. In this study, not only compared main engine performance results in shop trial and sea trial, but also investigated performance trend in accordance with the time elapsed for the service ship's diesel engine. They were confirmed as follows. First, shop trial load is higher than sea trial load but ship's speed is satisfied with owner's contract speed. Second as time goes by, load of service ship increases steadily and other parameters related with main engine shows variable change depend on main engine load increasing.

• Journal of the Korea Society for Simulation
• /
• v.9 no.1
• /
• pp.21-38
• /
• 2000

A fuzzy dispatching algorithm with adaptable control scheme is proposed for more flexible and adaptable operation of AGV system. The basic idea of the algorithm is prioritization of all move requests based on the fuzzy urgency. The fuzzy urgency is measured by the fuzzy multi-criteria decision-making method, utilizing the relevant information such as incoming and outgoing buffer status, elapsed time of move request, and AGV traveling distance. At every dispatching decision point, the algorithm prioritizes all move requests based on the fuzzy urgency. The performance of the proposed algorithm is compared with several dispatching algorithms in terms of system throughput in a hypothetical job shop environment. Simulation experiments are carried out varying the level of criticality ratio of AGVs , the numbers of AGVs, and the buffer capacities. The rule presented in this study appears to be more effective for dispatching AGVs than the other rules.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1992.04a
• /
• pp.359-363
• /
• 1992

As the demands of manufacturing automation is increasing, lots of efforts are devoted to the applications of Computer Integrated Manufacturing(CIM) concept in manufacturing shop floor. A workstation is a computer which controls differnet machines in the low level of factory(shop floor). A workstation can be utilized efficiently to enhance the coopetative work of machines. A scheduler is a component program in a workstation and it controls the operation of machines according to a fixed plan. A scheme for the scheduler has been developed for selected machines and software has been made. The fixed plan is stored in a schedule file which keeps machine names, communications methods, information for communications and time for the usages, etc. The scheduler carries out its role by the information in the schedule file. Although the developed software has some Iimitations, the test results show that the scheduler can be applied easily to the automation of the low level of factory.