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

This paper addresses scheduling heuristics for an assembly job-shop that includes at least an assembly process throughout its processes. The assembly job shop has certain characteristics not only considering the precedence relationship between the processes but also considering the processing progress between the parts. In addition, it probably presents a different processing time for the same product according to the order of processes and the point of workable time, due to the difference in the availability of equipments. The paper proposes several priority-based dispatching rules that consider these characteristics of the assembly job-shop, aiming to minimize the total tardiness of products in the shop floor. Computational tests showed that job due date based priority rules significantly outperform existing priority rules in terms of total tardiness.

• IE interfaces
• /
• v.24 no.3
• /
• pp.267-273
• /
• 2011

In the shipbuilding industry, since production processes are so complicated that the data collection for decision making cannot be fully automated, most of production planning and controls are based on the information provided only by field workers. Therefore, without sufficient information it is very difficult to manage the whole production process efficiently. Job status is one of the most important information used for evaluating the remaining processing time in production control, specifically, in block assembly shop. Currently, it is checked by a production manager manually and production planning is modified based on that information, which might cause a delay in production control, resulting in performance degradation. Motivated by these remarks, in this paper we propose an efficient algorithm for identifying job status in block assembly shop for shipbuilding. The algorithm is based on the multi-layer perceptron neural network model using two key factors for input parameters. We showed the superiority of the algorithm by using a numerical experiment, based on real data collected from block assembly shop.

• IE interfaces
• /
• v.12 no.4
• /
• pp.617-624
• /
• 1999

In order to maximize an availability of machine and utilization of space, the parallel machines scheduling problem with space limit is frequently discussed in the industrial field. In this paper, we consider a scheduling problem for assembly machine in ship engine assembly shop. This paper considers the parallel machine scheduling problem in which n jobs having different release times, due dates and space limits are to be scheduled on m parallel machines. The objective function is to minimize the sum of earliness and tardiness. To solve this problem, a heuristic is developed. The proposed heuristic is divided into three modules hierarchically: job selection, machine selection and job sequencing, solution improvement. To illustrate its effectiveness, a proposed heuristic is evaluated with a large number of randomly generated test problems based on the field situation. Through the computational experiment, we determine the job selection rule that is suitable to the problem situation considered in this paper and show the effectiveness of our heuristic.

• 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 Korean Institute of Industrial Engineers
• /
• v.35 no.1
• /
• pp.15-39
• /
• 2009

Advanced planning and scheduling (APS) refers to a manufacturing management process by which raw materials and production capacity are optimally allocated to meet demand. APS is especially well-suited to environments where simpler planning methods cannot adequately address complex trade-offs between competing priorities. However, most scheduling problems of APS in the real world face both inevitable constraints such as due date, capability, transportation cost, set up cost and available resources. In this survey paper, we address three crucial issues in APS, including basic scheduling model, job-shop scheduling (JSP), assembly line balancing (ALB) model, and integrated scheduling models for manufacturing and logistics. Several evolutionary algorithms which adapt to the problems are surveyed and proposed; some test instances based on the practical problems demonstrate the effectiveness and efficiency of evolutionary approaches.

• Korean Journal of Computational Design and Engineering
• /
• v.9 no.4
• /
• pp.325-333
• /
• 2004

To ensure competitiveness in the modern automotive market, material arrangements and information managements should be performed concurrently with new car developments. In automotive general assembly shops, thus, new business workflow and supporting environments are inevitable to reduce the manufacturing preparation time in developing a new car in the manner of concurrent and collaborative engineering. Since complete material arrangements for a whole general assembly system is a huge and complex job, several planners should execute their planning jobs and share information. Therefore, each planner should provide others with his/her results with continuous on-line communication and cooperation. Digital automotive general assembly factory is useful the performing concurrent and collaborative engineering and is essential for material arrangements and information managements systems. In this research, we constructed a sophisticated digital factory of an automotive general assembly shop by measuring and modeling through the parametric 3-D CAD, and a web-based system for concurrent and collaborative material arrangements for automotive general assembly via 3D mock-up is developed. By the digital general assembly shop and developed web-based system, savings in time and colt of manufacturing preparation activities are possible, and the reliability of the planning result Is greatly improved.

• 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.

• Journal of the Korea Society for Simulation
• /
• v.5 no.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.

• Korean Management Science Review
• /
• v.11 no.1
• /
• pp.23-37
• /
• 1994

This paper discusses the methodology for the operational performance of unit-load automated guided vehicles(AGVs) in a flow-shop-type flexible machining and assembly systems (FM/AS). Throughout the paper, AGVs are working as a carrier and mobile workstation. For a double-loop FM/AS, in which one loop is dedicated to machining and the other to assembly, three AGV operating strategies are proposed. Considering the entering interval and travel time of AGVs between workcenters, the strategies are developed to determine the best job sequence which minimizes the makespan and vehicle idle time. Entering times of AGVs and the required minimum number of AGVs are obtained on the basis of the best job sequence. When the number of AGVs are limited, entering times of AGVs are adjusted to maximize the utilization of AGVs.

• IE interfaces
• /
• v.5 no.1
• /
• pp.35-46
• /
• 1992

This paper deals with analysis of material handling system efficiency of a heat-exchanger manufacturing line. This line is a typical flow shop type assembly line which consists of 10 steps of assembly stations. Each station have one or two workers who assemble and move components for the job, and no special transporters for component's movement. Therfore, all the workers are involoved in unnecessary moving activities which decrease overall production efficiencies of the line. To improve productivities, production outputs and worker's job performances for this assembly line, the several alternatives are considered such as installing new conveyor lines and automatic guided vehicle(AGV) system. Analyzing economic feasibilities and responses of the system alternatives, an experimental simulation model is built suing SIMAN Ver. 3. 5 simulation language with CINEMA package for animation of the process flow. Through this animation process a vivid picturial analysis could performed on the process flow.