• Management & Information Systems Review
• /
• v.14
• /
• pp.67-77
• /
• 2004

Although project management for new product development is a very important issue, only a few approach from project scheduling has been made. The traditional project scheduling research has focused on the project network with certainty, but the new product development project has some uncertainties in network; Some activities may not need to be peformed, and/or some precedent relationships between activities may not need to be kept. In this paper, a simulation model is introduced in order to reflect uncertainties in project network for new product development. This simulation model can be used as a project scheduling technique for product development. By repeating the simulation, the degree of the risk and the feasibility of the project can be assessed.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.43
• /
• pp.81-89
• /
• 1997

This study is concerned with the scheduling problems in flexible manufacturing systems(FMSs). The scheduling problem in FMSs is a complex one when the number of machines and jobs are increased. Thus, a heuristic method is recommended in order to gain near-optimal solutions in a practically acceptable time. The purpose of this study is to develope a machine and AGV dispatching algorithm. The proposed dispatching algorithm is a on-line scheduling algorithm considering the due date of parts and the status of the system in the scheduling process. In the new machine and AGV dispatching algorithm, a job priority is determined by LPT/LQS rules considering job tardiness. The proposed heuristic dispatching algorithm is evaluated by comparison with the existing dispatching rules such as LPT/LQS, SPT/LQS, EDD/LQS and MOD/LQS. The new dispatching algorithm is predominant to existing dispatching rules in 100 cases out of 100 for the mean tardiness and 89 cases out of 100 for the number of tardy jobs.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.39 no.5
• /
• pp.527-537
• /
• 1990

This paper describes an intelligent control-based job scheduler, named ESIJOBS, for flexible manufacturing system. In order to construct rulebase of this system, traditional rules of job scheduling in FMS are examined and evaluated. This result and the repetitional simulations with graphic monitoring system are used to form the rulebase of ESIJOBS, which is composed of three parts:six part selection rules, four machine center selection rules, and twenty-one metarules. Appropriate scheduling rule sets are selected by this rulebase and manufacturing system status. The performances of all simulations are affected by random breakdowns of major FMS components during each simulation. Six criteria are used to evaluate the performance of each scheduling. The two modes of ESIJOBS are simulated and compared with combinational 24 rule-set simulations. In this comparison ESIJOBS dominated the other rule-set simulations and showed the most excellent performance particularly in three criteria.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.7
• /
• pp.1314-1323
• /
• 2011

The maintenance of generating units is implicitly related with power system reliability and has a tremendous bearing on the operation of the power system. A technique using a fuzzy search method which is based on fuzzy multi-criteria function has been proposed for GMS (generator maintenance scheduling) in order to consider multi-objective function. In this study, a new technique using combined fuzzy set theory and genetic algorithm(GA) is proposed for generator maintenance scheduling. The genetic algorithm(GA) is expected to make up for that fuzzy search method might search the local solution. The effectiveness of the proposed approach is demonstrated by the simulation results on a practical size test systems.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.25 no.8
• /
• pp.48-59
• /
• 2011

This paper presents a new gain scheduling speed controller of permanent magnet synchronous generators(PMSG) for MW-class direct-driven wind turbine systems. The proposed gain scheduling speed controller performs the speed tracking at more than one operating point, and the first-order torque observer estimates the turbine torque which is needed to precisely control the speed of PMSG. The proposed speed controller verifies that the PMSG can successfully follow the reference speed which is determined via the maximum power point tracking(MPPT) control and pitch control under turbulent wind conditions. The proposed speed control algorithm is simulated using Simulink and its performance is confirmed through comparison with the results by PI control method.

• Journal of Electrical Engineering and Technology
• /
• v.5 no.1
• /
• pp.8-15
• /
• 2010

A new technique using a search method which is based on fuzzy multi-criteria function is proposed for GMS(generator maintenance scheduling) in order to consider multi-objective function. Not only minimization of probabilistic production cost but also maximization of system reliability level are considered for fuzzy multi-criteria function. To obtain an optimal solution for generator maintenance scheduling under fuzzy environment, fuzzy multi-criteria relaxation method(fuzzy search method) is used. The practicality and effectiveness of the proposed approach are demonstrated by simulation studies for a real size power system model in Korea in 2010.

• Journal of the Korea Computer Industry Society
• /
• v.9 no.2
• /
• pp.63-68
• /
• 2008

The purpose of a parallel scheduling is to carry out the scheduling with the minimum synchronization overhead and bottleneck under a multiprocessor environment and to perform load balance for a parallel iteration. In this paper, analyse the conventional parallel scheduling methods and drive the problems from each method in order to achive the minimum scheduling overhead and load balance. These problems will go far toward solving the design of effective algorithm.

• International conference on construction engineering and project management
• /
• 2005.10a
• /
• pp.902-907
• /
• 2005

This study was undertaken to develop a comprehensive scheduling method which applied the core concept(DBR) of TOC to PERT, and to combine Monte Carlo Simulation to revise the uncertainties of activities then to eliminate project duration uncertainty. Most of the project duration overlooks the fact that in spite of minimizing the project duration, the uncertainty of constrained resources still puts the reliability of project duration in jeopardy. For the contractor, however, the most important thing is to comply the project scheduling with the planning to reduce the uncertainty of the project activities, operational interaction and project duration. In order to demonstrate that the model can be used in construction project, the scheduling of a steel-structure project was used as a case study to verify the validity of this model.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.8
• /
• pp.619-630
• /
• 2003

We present a method of runtime configuration scheduling in reconfigurable SoC design. As a model of computation, we use a popular formal model of computation, hierarchical FSM (HFSM) with synchronous dataflow (SDF) model, in short, HFSM-SDF model. In reconfigurable SoC design with HFSM-SDF model, the problem of configuration scheduling becomes challenging due to the dynamic behavior of the system such as concurrent execution of state transitions (by AND relation), complex control flow (HFSM), and complex schedules of SDF actor firing. This makes it hard to hide configuration latency efficiently with compile-time static configuration scheduling. To resolve the problem, it is necessary to know the exact order of required configurations during runtime and to perform runtime configuration scheduling. To obtain the exact order of configurations, we exploit the inherent property of HFSM-SDF that the execution order of SDF actors can be determined before executing the state transition of top FSM. After obtaining the order information and storing it in the ready configuration queue (ready CQ), we execute the state transition. During the execution, whenever there is FPGA resource available, a new configuration is selected from the ready CQ and fetched by the runtime configuration scheduler. We applied the method to an MPEG4 decoder and IS95 design and obtained up to 21.8% improvement in system runtime with a negligible overhead of memory usage.

• Management Science and Financial Engineering
• /
• v.13 no.2
• /
• pp.47-77
• /
• 2007

This paper considers a scheduling problem where a customer orders multiple products(jobs) from a production facility. The objective is to minimize the sum of the order(batch) completion times. While a machine can process only one job at a time, multiple machines can simultaneously process jobs in a batch. Although each job has a unique processing time, we consider the case where batch processing times are identical. This simplification allows us to develop heuristics with improved performance bounds. This problem was motivated by a real world problem encountered by foreign electronics manufacturers. We first establish the complexity of the problem. For the two parallel machine case, we introduce two simple but intuitive heuristics, and find their worst case relative error bounds. One bound is tight and the other bound goes to 1 as the number of orders goes to infinity. However, neither heuristic is superior for all instances. We extend one of the heuristics to an arbitrary number of parallel machines. For a fixed number of parallel machines, we find a worst case bound which goes to 1 as the number of orders goes to infinity. Then, a tighter bound is found for the three parallel machine case. Finally, the heuristics are empirically evaluated.