• 국제학술발표논문집
• /
• The 3th International Conference on Construction Engineering and Project Management
• /
• pp.835-840
• /
• 2009

Lately, Building Information Modeling (BIM) emerges as the most promising technology, now is expected to bring a great deal of improvement of productivity in every aspect of the construction industry. One of the BIM based scheduling is to use BIM model as a base for applying to schedule analysis and simulation tools. This type of tools may incorporate a various types of information such as the building model, construction method information, resource information, productivity information, rules and constraints to optimize activity sequencing. This paper proposes a framework of BIM based simulating system which can be used to optimize construction processes, especially for the floor construction cycle. For the purpose, all of the necessary components of the system will be defined and represented, and next an algorithm will be introduced to demonstrate the principle of simulating operation. The benefits of this technique are basically two : to test and optimize construction methods in respect of the construction duration and to reduce the floor construction cycle.

• 한국소성가공학회:학술대회논문집
• /
• 한국소성가공학회 1996년도 춘계학술대회논문
• /
• pp.101-109
• /
• 1996

Mini-mill process which is one of the new steel -marking technologies to be able to produce the hot rolled coils by thin slab caster of ISP(In-Line Strip Production) type, will be completed in the Kwangyang Steel Works of POSCO in August, 1996, SEt-Up Model of finishing mill which consists of 5 stands is the most basic and essential in mini-mill plant. Therefore, the simulation program of Finishing-mill Set-Up model were developed in this research , using new temeprature prediction model, roll gap model and rolling physical model. Using the developed FSU program , pass schedules to produce the strips with target strip thickness of 1.8mm, 2.0mm, 2.3mm, 2.7mm an d3.0mm were also determined respectively.

• 산업경영시스템학회지
• /
• 제26권2호
• /
• pp.68-74
• /
• 2003

Modem automated manufacturing processes employ automated guided vehicles(AGVs) for material handling, which serve several machining centers(MCs) in a factory. Optimal scheduling of AGVs can significantly help to increase the efficiency of the manufacturing process by minimizing the idle time of MCs waiting for the raw materials. In this paper, we will analyse the requirements for an optimal schedule and then provide a mathematical framework for an efficient schedule of material delivery by an AGV. With this model, the optimal number of MCs to be utilized will also be determined. Finally, the material delivery schedule employing multiple journeys to the MCs by the AGV will be carried out. Through rigorous analysis and simulation experiments, we shall show that such a delivery strategy will optimize the overall performance.

• 한국정보처리학회논문지
• /
• 제7권4호
• /
• pp.1201-1210
• /
• 2000

In order to tolerate faults which may occur during the execution of distributed tasks in high-performance parallel computer systems, tasks are duplicated on different processors. In this paper, by utilizing the task duplication based scheduling algorithm, a new task scheduling algorithm which duplicates each task on more than two different processors with the minimum schedule length is presented, and the number of processors required for the duplication is analyzed with the ratio of communication cost to computation time and the workload of the system. A simulation with various task graphs reveals that the number of processors required for the full-duplex fault-tolerant task scheduling with the obtainable minimum schedule length increases about 30% to 75% when compared with that of the task duplication based scheduling algorithm.

• ETRI Journal
• /
• 제37권5호
• /
• pp.888-897
• /
• 2015

Group scheduling is an operation whereby control packets arriving in a time slot schedule their bursts simultaneously. Normally, those bursts that are of the same wavelength are scheduled on the same channel. In cases where the support of full wavelength converters is available, such scheduling can be performed on multiple channels for those bursts that are of an arbitrary wavelength. This paper presents a new algorithm for group scheduling on multiple channels. In our approach, to reach a near-optimal schedule, a maximum-weight clique needs to be determined; thus, we propose an additional algorithm for this purpose. Analysis and simulation results indicate that an optimal schedule is almost attainable, while the complexity of computation and that of implementation are reduced.

• 한국건축시공학회:학술대회논문집
• /
• 한국건축시공학회 2009년도 춘계 학술논문 발표대회 학계
• /
• pp.159-162
• /
• 2009

Today's construction is more various and more complex. Because of that, a lot of uncertain factors are occurred and they related uncertain construction duration. For management complex architecture project, importance of construction schedule management also increased. In previous studies, one of solutions to overcome those problems is suggested. It was BIM based construction simulation process which focused on construction schedule and construction schedule management. But latest process had limited point which has no duration estimation function. So this paper suggested duration estimation method and developed duration estimation module. Duration estimation module developed with current scheduling tool MS Project and their macro function. However, this module has just developed Reinforced Concrete Structure and has to do more development and research.

• Journal of Communications and Networks
• /
• 제18권2호
• /
• pp.227-237
• /
• 2016

Data collection is a key function for wireless sensor networks. There has been numerous data collection scheduling algorithms, but they fail to consider the deep and complex relationship among network lifetime, sink aggregated information and sample cycle for wireless sensor networks. This paper gives the upper bound on the sample period under the given network topology. An optimal schedule algorithm focusing on aggregated information named OSFAI is proposed. In the schedule algorithm, the nodes in hotspots would hold on transmission and accumulate their data before sending them to sink at once. This could realize the dual goals of improving the network lifetime and increasing the amount of information aggregated to sink. We formulate the optimization problem as to achieve trade-off among sample cycle, sink aggregated information and network lifetime by controlling the sample cycle. The results of simulation on the random generated wireless sensor networks show that when choosing the optimized sample cycle, the sink aggregated information quantity can be increased by 30.5%, and the network lifetime can be increased by 27.78%.

• 한국항해학회지
• /
• 제14권1호
• /
• pp.21-38
• /
• 1990

This paper discusses the various modes of operations of cargo ships which are liner operations, tramp shipping and industrial operations, and mathematical programming, simulation , and heuristic method that can be used to solve ships routing and scheduling problems for each of these operations. In particular, this paper put emphasis on a crude oil tanker scheduling problem. The problem is to achieve an optimal sequence of cargoes or an optimal schedule for each ship in a given fleet during a given period. Each cargo is characterized by its type, size, loading and discharging ports, loading and discharging dates, cost, and revenue. Our approach is to enumerate all feasible candidate schedate schedules for each ship, where a candidate schedule specifies a set of cargoes that can be feasibly carried by a ship within the planning horizon , together with loading and discharging dates for each cargo in the set. Provided that candidate schedules have been generated for each ship, the problem of choosing from these an optimal schedule for each ship is formulated as a set partitioning problem, a set packing problem, and a integer generalized network problem respectively. We write the PASCAL programs for schedule generator and apply our approach to the crude oil tanker scheduling problem similar to a realistic system.

• 산업경영시스템학회지
• /
• 제36권4호
• /
• pp.116-122
• /
• 2013

This study develops a dynamic scheduling model for parallel machine scheduling problem based on genetic algorithm (GA). GA combined with discrete event simulation to minimize the makespan and verifies the effectiveness of the developed model. This research consists of two stages. In the first stage, work sequence will be generated using GA, and the second stage developed work schedule applied to a real work area to verify that it could be executed in real work environment and remove the overlapping work, which causes bottleneck and long lead time. If not, go back to the first stage and develop another schedule until satisfied. Small size problem was experimented and suggested a reasonable schedule within limited resources. As a result of this research, work efficiency is increased, cycle time is decreased, and due date is satisfied within existed resources.

• 소성∙가공
• /
• 제25권1호
• /
• pp.43-48
• /
• 2016

H-beams are generally produced by hot rolling composed of a Break Down Mill (BDM) and a Finishing Mill (FM). The goal of the current study was to develop BDM rolling of H300ｘ300 beams from blooms slit from slabs. In order to manufacture H300ｘ300 beams, the caliber design and the pass schedule of BDM rolling were proposed for a bloom instead of a beam blank. The proposed BDM caliber design and pass schedule were tested using FE-simulation and pilot tests. For the major shape dimensions, such as flange width, web height, web thickness, as well as BDM rolling loads, a comparative analysis between the FE-simulation and the pilot rolling tests was conducted. The results of FEM analysis and pilot rolling tests showed good consistency. Moreover, BDM rolling loads were predicted to be in the range of allowable rolling loads. It was concluded that the designed BDM rolling is suitable for implementation within current manufacturing capacity.