• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1993.04a
• /
• pp.343-352
• /
• 1993

In this study, a modified algorithm for the exchange heuristic is developed and applied to a resource-constrained scheduling problem. The problem involves multiple projects and multiple resource categories and allows flexible resource allocation to each activity. The objective is to minimize the maximum completion time. The exchange heuristkc is a multiple pass algorithm which makes improvements upon a given initial feasible schedule. Four different modified algorithms are proposed. The original algorithm and the new algorithms were compared through an experimental investigation. All the proposed algorithms reduce the maximum completion time much more effectively than the original algorithm. Especially, one of four proposed algorithms obviously outperforms the other three algorithms. The algorithm of the best performance produces significantly shorter schedules than the original algorithm, though it requires up to three times more computation time. However, in most situations, a reduction in schedule length means a significant reduction in the total cost.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.431-432
• /
• 2008

We propose a DVS technique for multiprocessor systems considering the energy consumed when translating voltage. We schedule periodic applications on two identical processors throughout a three-stage process; firstly, the computation energy consumption is minimized then the number of voltage translations is minimized. Finally, the result is compared with the schedule with no voltage translation and the one with smaller energy consumption is chosen. Overall, 10.6% energy reduction was achieved.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.29 no.1
• /
• pp.109-115
• /
• 2006

Exact solutions for practical-size problems in job shop will be highly inefficient. Scheduling heuristics, therefore, are typically found in the literature. If we consider real-life situations such as machine breakdowns, the existing scheduling methods will be even more limited. Scheduling against due-dates addresses one of the most critical issues in modern manufacturing systems. In this paper, the method for weighted tardiness schedule using a graph theoretic decomposition heuristic is presented. It outstands the efficiency of computation as well as the robustness of the schedule.

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.2
• /
• pp.158-168
• /
• 2001

We present a tabu search (TS) algorithm to minimize maximum lateness on a single machine in the presence of sequence dependent setup times and dynamic job arrivals. The TS algorithm starts with a feasible schedule generated by a modified ATCS (Apparent Tardiness Cost with Setups) rule, then through a series of search steps it improves the initial schedule. Results of extensive computational experiments show that the TS algorithm significantly outperforms a well-known RHP heuristic by Ovacik and Uzsoy, both on the solutions quality and the computation time. The performance advantage is particularly pronounced when there is high competition among jobs for machine capacity.

• Journal of Korean Institute of Industrial Engineers
• /
• v.18 no.1
• /
• pp.91-104
• /
• 1992

Flowshop scheduling problem is known to be NP-complete. Since the optimization apporach like branch-and-bound is limited by exponentially growing computation time, many heuristic methods have been developed. Total tardiness is one of the criteria that the researchers have recently considered in flowshop scheduling. There, however, are few literatures which studied the general (m machine)-flowshop scheduling under the total tardiness criterion. In this paper, a heuristic scheduling method to minimize total tardiness at the (m machine, n job)-flowshop is presented. A heuristic value function is proposed to be used as a dispatching criterion in initial schedule generation. And the schedule improving procedure, by pairwise interchange of tardy job with the job right ahead of it, is introduced. Illustrative examles and simulated results are presented.

• Journal of Information Processing Systems
• /
• v.10 no.2
• /
• pp.193-214
• /
• 2014

Load balancing is the major benefit of any distributed system. To facilitate this advantage, task duplication and migration methodologies are employed. As this paper deals with dependent tasks (DAG), we used duplication. Task duplication reduces the overall schedule length of DAG along-with load balancing. This paper proposes a new task duplication algorithm at the time of tasks assignment on various processors. With the intention of conducting proposed algorithm performance computation; simulation has been done on the Netbeans IDE. The mesh topology of a distributed system is simulated at this juncture. For task duplication, overall schedule length of DAG is the main parameter that decides the performance of a proposed duplication algorithm. After obtaining the results we compared our performance with arbitrary task assignment, CAWF and HEFT-TD algorithms. Additionally, we also compared the complexity of the proposed algorithm with the Duplication Based Bottom Up scheduling (DBUS) and Heterogeneous Earliest Finish Time with Task Duplication (HEFT-TD).

• Korean Journal of Construction Engineering and Management
• /
• v.13 no.2
• /
• pp.120-127
• /
• 2012

Today, most construction projects have been higher, bigger, and more complicated gradually. So the domestic construction companies have been trying to understand overall construction process and relationships between activities, and adopted various management techniques and tools in order to perform a systematic and effective scheduling. However numerous problems have been occurred on the practical applications because most existing scheduling softwares adapt ADM and PDM techniques. One of them, PDM, is so uneffective because it represents the overlapping relationships between two consecutive activities only by the combinations of start and finish points between two activities. In order to supplement the demerit of PDM, Beeline Diagramming Method(BDM) is proposed as a new networking technique, it can represent two-way multiple overlapping relationships between two activities directly. However there are occurring a loop phenomenon on applying two-way multiple overlapping relationships. This research proposes and verifies the schedule computation method of two-way multiple overlapping relationships on the BDM network.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.46-49
• /
• 1996

This paper presents a multi-pass heuristic for job shop scheduling with due dates. The proposed heuristic iteratively improves solutions based on operation due dates. To find a good solution efficiently, a method for searching the neighborhood of current schedule is developed. The heuristic is compared with two existing heuristics as well as several dispatching rules in terms of solution quality and computation time. The experimental results show that the proposed approach is promising.

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

• 연구논문집
• /
• s.30
• /
• pp.5-13
• /
• 2000

The computation scheme of simulating gas turbine transient behavior was developed. The basic principles of this scheme and main input data required are described. Calculation results are presented in terms of whole operating regime of the cycle. The influence of main initial parameters such as starting engine power, moment of inertia of the rotor, fuel supplying schedule etc. on performance characteristics of has turbine during transient operation is studied In addition, bleeding air influence on transient behavior was also considered For validation of the developed code, comparison of present calculation with that of measurement data of the experimental data for the range of operating period studied.