• 대한전기학회논문지
• /
• 제36권5호
• /
• pp.319-327
• /
• 1987

This paper presents a dynamic programming sucdessive approximation algorithm for scheduling pumped storage hydro plants and shows how this method can be coordinated with the commitment of the thermal units of the system. The general object of operation of pumped hydrostorage plants is the minimization of the overall production cost and the maximization of generation reserves. The basic procedure used to obtain a combined pumped storage-unit commitment schedule is to execute the pumped storage scheduler and unit commitment scheduler iteratively. A combined DPSA algorithm has been presented to coordinate the scheduling of the pumped storage with the scheduling of the thermal units.

• ETRI Journal
• /
• 제30권5호
• /
• pp.741-743
• /
• 2008

In this letter, a heuristic channel allocation and scheduling scheme is proposed. By comparing the size of the alternative-factor assessment, which is obtained by simple calculation, we can easily find the most appropriate channel for each user for overall throughput enhancement. Numerical results show that the downlink throughput of the proposed scheme is higher than that of proportional fairness and is almost the same as that of the maximum C/I scheme, while user fairness remains better than that of the maximum C/I scheme.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 추계학술대회 논문집 전력기술부문
• /
• pp.237-239
• /
• 2007

This paper focuses on maintenance scheduling using PSO algorithm for power plants from an economic (operating cost) and reliable(variance of operating reserve margin) point of view. We also apply regional reserve margin and transfer capability to maintenance scheduling problem. The proposed method has been applied to IEEE-RTS(1996) with 32-generators and a real -world large scale power system with 291 generators.

• 산업공학
• /
• 제9권2호
• /
• pp.143-158
• /
• 1996

This paper deals with the development of a software module for production planning and scheduling activities of an actual die-production management system. Scheduling problems, such as master schedule and detailed schedule, are the focal point of the whole article and they are considered in terms of operation procedures. Schedule-explosion module and load levelling module are the essential components of schedule management. The scheduling module allocates the resources, determines the process priority and the planned start and completion dates of processes. Rescheduling can be done to manipulate unforeseen situations that schedule is delayed owing to inducing defectives, machine breakdowns and lumpy demands. This study indicates a practical model for the die-producation management and helps to apply it for jobs in the real situation.

• 대한산업공학회지
• /
• 제32권3호
• /
• pp.163-171
• /
• 2006

This paper considers a scheduling problem to minimize the sum of the associated scheduling (production/delivery times) cost and the delivery cost for an integrated system of a single production machine and various transportation vehicles with transportation mode selection allowed. Each transportation mode is provided with a fixed number of vehicles at the associated delivery time and cost. The proposed problem is characterized as being NP-hard. Some solution properties are also characterized. Therewith, three heuristic algorithms (called SPT-based, LWF-based and WSPT-based heuristic) and a branch-and-bound algorithm are derived. In order to evaluate the effectiveness and efficiency of the proposed algorithms, computational experiments are made with some numerical instances.

• 대한산업공학회지
• /
• 제12권2호
• /
• pp.33-44
• /
• 1986

This research is concerned with group scheduling problems in multi-stage manufacturing system with dependent setup time. The objective of the research is to develop and evaluate a heuristic algorithm for determining group sequence and job sequence within each group to minimize total tardiness in multi-stage manufacturing systems with sequence dependent group setup time. The group scheduling heuristic algorithm is developed and evaluated by comparisons with twenty-seven problems with the known optimum solutions and 144,000 random schedules of a large variety problems. The results indicate that the proposed heuristic algorithm gets the same optimum solutions for the problems and also provides the good solutions in comparison with the random schedules of the large variety problems. A numerical example is given to illustrate the heuristic algorithm.

• 대한산업공학회지
• /
• 제30권2호
• /
• pp.159-164
• /
• 2004

Lot-streaming is the process of splitting a job (lot) into a number of smaller sublots and then scheduling these sublots in order to accelerate the completion of jobs in a multi-stage production system. Anew genetic algorithm (NGA) is proposed for an-job, m-machine, equal-size sublot lot-streaming flow shop scheduling problem with delivery windows in which the objective is to minimize the mean weighted absolute deviation of job completion times from due dates. The performance of NGA is compared with that of an adjacent pairwise interchange (API) method and the results of computational experiments show that NGA works well for this type of problem.

• Journal of Communications and Networks
• /
• 제11권1호
• /
• pp.36-41
• /
• 2009

The IEEE 802.16 wireless metropolitan area network (WMAN) standard is designed to correct expensive communication costs in CDMA-based mobile communication systems and limited coverage problems in wireless LAN systems. Thus, the IEEE 802.16e standard can provide mobile high-speed packet access between mobile stations and the Internet service provider through the base station with cheap communication fees. To efficiently accommodate voice over IP (VoIP) services in IEEE 802.16 systems, an uplink quality of service packet-scheduling scheme is proposed, and its performance is evaluated with an NS-2 network simulator in this paper. Numerical results show that this proposed scheme can increase the system capacity by 100% more than in the unsolicited rand service (UGS) scheme and 30% more than the extended real-time polling service (ertPS) scheme, respectively.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2008년도 한국컴퓨터종합학술대회논문집 Vol.35 No.1 (D)
• /
• pp.428-431
• /
• 2008

Recently, people have been interested in new intelligent transport system (ITS) architecture, so that vehicular networks are becoming an attractive research area. When vehicles try to access data through a roadside unit (RSU), data scheduling of RSU needs to improve service ratio due to limited bandwidth and service time. In this paper, we propose a service scheduling algorithm based on transmission delays and service deadlines of vehicles in order to improve the service ratio. In our algorithm, we assume the promiscuous operation of wireless nodes and it can make a single transmission of RSU serve multiple requests. We evaluated the performance of our scheme via simulations, and results show that our schemes have better performance than existing algorithms.

• 한국시뮬레이션학회논문지
• /
• 제5권2호
• /
• pp.41-58
• /
• 1996

The Discrete Event Systems Specification(DEVS) formalism specifies a discrete event system in a hierarchical, modular form. This paper presents a distributed simulation environment D-DEVSim++ for models specified by the DEVS formalism. D-DEVSim++ employs a new simulation scheme which is a hybrid algorithm of the hierarchical simulation and Time Warp mechanisms. The scheme can utilize both the hierarchical scheduling parallelism and the inherent parallelism of DEVS models. This hierarchical scheduling parallelism is investigated through analysis. Performance of the proposed methodology is evaluated through benchmark simulation on a 5-dimensional hypercube parallel machine. The performance results indicate that the methodology can achieve significant speedup. Also, it is shown that the analyzed speedup for the hierarchical scheduling time corresponds the experiment.