• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.3
• /
• pp.345-357
• /
• 1998

This paper focuses on production planning and scheduling problems in an assembly system operating on a make-to-order basis. Due dates are considered as constraints in the problems, that is, tardiness is not allowed. Since the planning problem is a higher-level decision making than the scheduling problem, the scheduling problem is solved using a production plan obtained by solving the planning problem. We suggest heuristic procedures in which aggregated information is used when the production planning problem is solved while more detailed information is used when the scheduling problem is solved. Since a feasible schedule may not be obtained from a production plan, an iterative approach is employed in the two procedures to obtain a solution that is feasible for both the production planning and scheduling problems. Computational tests on randomly generated test problems are done to show the performance of these algorithms, and results are reported.

• Korean Journal of Computational Design and Engineering
• /
• v.17 no.2
• /
• pp.111-122
• /
• 2012

Capacity planning plays an important role not only for master production plan but also for facility or layout design in shipbuilding. Product work breakdown structure, attributes of production resources, and production method or process data are associated in order to make the discrete event simulation model of shipyard layout plan. The production amount of each process and the process time is assumed to be stochastic. Based on the stochastic discrete event simulation model, the production capacity of each facility in shipyard is estimated. The stochastic model of product arrival time, process time and transferring time is introduced for each process. Also, the production capacity is estimated for the assumed master production schedule.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.10a
• /
• pp.268-271
• /
• 2000

In these days, the technical advances and complexities have generated much of the difficulties in managing the project resources, both time and costing to accomplish the project in the most efficient manner. The project manager is frequently required to render judgements concerning the schedule and resource adjustments. This research develops an analytical model for a schedule-cost and risk analysis based on visual PERT/CPM. We used a two-step approaches ：in the step 1, a deterministic PERT/CPM model for the critical path and estimating the project time schedule and related resource planning, In the second step, we developed a heuristic model for crash and stretch out analysis based upon a time-cost trade-off associated with the crash and stretch out of the project. Computer implementation of this model is provided based on GUI-Type objective-oriented programming for the users and provided displays of all the inputs and outputs in the form of visual graphical. Also developed GUI-type program, Dongeui Visual-PERT/CPM. The results of this research will provide the project managers with an efficient management tool.

• IE interfaces
• /
• v.7 no.2
• /
• pp.75-85
• /
• 1994

This paper presents a production scheduling model in a block assembly shop in shipbuilding industry. In a block assembly shop, the most important performance criterion is load leveling, which balances manpower and work area utilization through the planning horizon. The problem is formulated as a mixed-integer nonlinear programming(MINLP) problem of which objective function is to optimize load leveling. The developed MINLP problem can not be solvable due to computational complexity. The MINLP problem is decomposed into two stage mixed-integer linear programming (MILP) problems to obtain a good solution, but the decomposed MILP problems are still computationally intractable because of combinatorial complexity. Therfore, a heuristic method using linear programming is proposed to solve two stage MILP problems sequentially. The proposed heuristic generates a good production schedule within a reasonable computation time, and it is easily applicable for establishing the production schedule in a block assembly shop in shipbuilding industry.

• Proceedings of the Korean DIstribution Association Conference
• /
• 2003.05a
• /
• pp.55-70
• /
• 2003

The most transport companies are placing increasing emphasis on powerful new techniques for planning their vehicle operations. They have tried to improve their vehicle control and customer service capability by adopting tile advanced information technology, such as GPS(Global Position System) and Using Digital Map. But researches on the VRSP(vehicle routing St schedule problem) in this situation were very few. The purpose of this research is to develop vehicle scheduling heuristics for making a real-time dynamic VRSP under the situation that GPS and using Digital Map are equipped to the transport company. Modified savings techniques are suggested for the heuristic method and an insertion technique is suggested for the dynamic VRSP. The urgent vehicle schedule is based on the regular vehicle schedule. This study suggest on VRSP system using GPS and Digital Map and the performance of the suggested heuristics is illustrated through an real case example.

• IE interfaces
• /
• v.25 no.2
• /
• pp.216-228
• /
• 2012

BIM-based 4D simulation makes people easily understand complex construction process using 3D graphics model and helps them review and identify the construction schedule in each phase of the construction process. Moreover, 4D simulation can be used as reference data to determine the validity of the process in the design phase and will be utilized as a measure for checking the construction process. Therefore 4D simulation of construction improves efficiency of project management. However, current commercial applications available for 4D simulation do not provide sufficient functions for connection of 3D models and process information. In this paper, we propose an automated generation method through the definition of the process based on a work method template and developed the template based schedule generation system (TSGS).

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.30 no.1
• /
• pp.115-121
• /
• 2007

In this paper, we study flowshop scheduling problems with availability constraints. In such problems, n jobs have to be scheduled on m machines sequentially under assumption that the machines are unavailable during some periods of planning horizon. The objective of the problem is to find a non-permutation schedule which minimizes the makespan. As a solution procedure, we propose an improved genetic algorithm which utilizes a look-ahead schedule generator to find good solutions in a reasonable time Computational experiments show that the proposed genetic algorithm outperforms the existing genetic algorithm.

• Korean Journal of Construction Engineering and Management
• /
• v.8 no.3
• /
• pp.125-133
• /
• 2007

If project time extension were required in the construction projects, either liquidated damages or extension costs should be applied according to causation of the schedule delays. However, in actual cases it is not applied so far according to the contract conditions. The reason why this situation happened Is that function of the present planning and scheduling is not working feasibly. The CPM schedule could not provide a proper solution for apportioning responsibility for the schedule delays. This situation could be considered as breach of contract and will cause potential disputes for schedule delay. Therefore, in this research process based contract administration model for construction delay claim is proposed to prevent schedule delay and solve the claims. The model is based on pro-active management for causation of delay to provide apportionment of responsibility and written evidences.

• Journal of the Society of Naval Architects of Korea
• /
• v.32 no.1
• /
• pp.9-16
• /
• 1995

The erection process planning is to decide erection strategy and sequence that satisfies dock duration. The erection scheduling is to decide erection date of each block. The load profile varies according to scheduling and it is related to building cost. It must be possible to simulate the various combinations of process plan and schedule for optimal planning. To develop the process planning system for optimal planning, the system that generate the sequence of erection automatically and the load leveling system are required. This paper suggests the method that generates the erection sequence. The load leveling should be done to all the ships in the same dock batch to get reliable results. In this case since the search space is very large, efficient optimization method is needed Our research achieved the load leveling system using Genetic Algorithm. This system made it possible to simulate various process plans to which schedule is considered.

• Journal of the Korean Society for Precision Engineering
• /
• v.14 no.10
• /
• pp.75-84
• /
• 1997

This paper describes the development of an integrating method for process planning and scheduling activities for block assembly in shipbuilding. A block is composed of several steel plates and steel sections with the predetermined shapes according to the ship design. The parts which constitute the block are manufac- tured by cutting and/or bending operations, which are termed as machining operation in this paper. The machining operation is the first process for block assembly which influences the remaining block assembly processes. Thus process planning and scheduling for machining operation to manufacture parts for block are very important to meet the assembly schedule in the shipyard. An integrating method for process plan- ning and scheduling is developed by introducing the concept of distributed process planning and scheduling composed of initial planning, alternative planning and final planning stages. In initial planning stage, nesting parts information and machining emthods are generated for each steel plate. In alternative plan- ning stage, machine groups are selected and workcenter dispatching information is generated. In final planning stage, cutting sequences are determined. The integrated system is tested by case study. The result shows that the integrated system is more efficient than existing manual planning system.