• Industrial Engineering and Management Systems
• /
• v.10 no.1
• /
• pp.15-23
• /
• 2011

This research considers scheduling problems with jobs which can be divided into sub-jobs and do not required to be processed immediately following one another. Heuristic algorithms considering how to divide jobs are proposed in an attempt to find near-optimal solutions within reasonable run time. The algorithms contain two phases which are executed recursively. Phase 1 of the algorithm determines how jobs should be divided while phase 2 solves the scheduling problem given the sub-jobs established in phase 1. Simulated annealing and genetic algorithms are applied for the two phases and four heuristic algorithms are established. Numerical experiment is conducted to determine the best parameter values for the heuristic algorithms. Examples with different sizes and levels of complexity are generated. Performance of the proposed algorithms is evaluated. It is shown that the proposed algorithms are able to efficiently and effectively solve the considered problems.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.6
• /
• pp.1843-1850
• /
• 2014

In this paper, we investigate a group building based power consumption scheduling to minimize the electricity cost. We consider the demand shift to reduce the peak load and suggest the compensation function reflecting the relationship between the change of the building demand and the occupants' comfort. Using that, the electricity cost minimization problem satisfied the convexity is formulated, and the optimal power consumption scheduling algorithm is proposed based on the iterative method. Extensive simulations show that the proposed algorithm achieves the group management gain compared to the individual building operation by increasing the degree of freedom for the operation.

• Journal of Communications and Networks
• /
• v.8 no.4
• /
• pp.401-409
• /
• 2006

Orthogonal frequency division multiplexing (OFDM) and multiple input multiple output (MIMO) technologies provide additional dimensions of freedom with spectral and spatial resources for radio resource management. Multi-dimensional radio resource management has recently been identified to exploit the full dimensions of freedom for more flexible and efficient utilization of scarce radio spectrum while provide diverse quality of service (QoS) guarantees. In this work, a multi-dimensional radio resource scheduling scheme is proposed to achieve above goals in hybrid orthogonal frequency division multiple access (OFDMA) and space division multiple access (SDMA) systems. Cochannel interference (CCI) introduced by frequency reuse under SDMA is eliminated by frequency division and time division between highly interfered users. This scheme maximizes system throughput subjected to the minimum data rate guarantee. for heterogeneous users and transmit power constraint. By numerical examples, system throughput and fairness superiority of the our scheduling scheme are verified.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.21 no.2
• /
• pp.171-186
• /
• 1996

This paper comes from an observation that overemphasis on capacity utilization meausre, which is usual under capacity shortage, can seriously hurt the firm's profit and potential process improvement. We suggest a model that can be used in designing a coordination scheme for decentralized marketing and manufacturing activities. Using a price and time-sensitive demand and capacitated lotsizing model, we derive an effective communication medium betwen marketing and manufacturing. This Balance Indicator of process capacity and flexibility also implies that the increase in capacity availability and setup time reduction should be balanced by its market requirements. This is particularly important when a firm tries to improve its process capability by kaizen. Further, the model can be used to show the comparative performances of scheduling policies under capacity imbalnce. We show the shortening the scheduling cycle can improve the firm profit without changing the simple scheduling rule.

• Korean Journal of Construction Engineering and Management
• /
• v.6 no.1 s.23
• /
• pp.73-79
• /
• 2005

This paper, introduces a Stochastic Project Scheduling Simulation system (SPSS III) developed by the author to predict a project completion probability in a certain time. The system integrates deterministic CPM, probabilistic PERT, and stochastic Discrete Event Simulation (DES) scheduling methods into one system. It implements automated statistical analysis methods for computing the minimum number of simulation runs, the significance of the difference between independent simulations, and the confidence interval for the mean project duration as well as sensitivity analysis method in What-if analyzer component. The SPSS 111 gives the several benefits to researchers in that it (1) complements PERT and Monte Carlo simulation by using stochastic activity durations via a web based JAVA simulation over the Internet, (2) provides a way to model a project network having different probability distribution functions, (3) implements statistical analyses method which enable to produce a reliable prediction of the probability of completing a project in a specified time, and (4) allows researchers to compare the outcome of CPM, PERT and DES under different variability or skewness in the activity duration data.

• Korean Journal of Construction Engineering and Management
• /
• v.8 no.6
• /
• pp.235-245
• /
• 2007

This research study presents the development and application of an Elitist Genetic Algorithm (Elitist GA) for solving the resource-constrained project scheduling problem, which is one of the most challenging problems in construction engineering. Main features of the developed algorithm are that the elitist roulette selection operator is developed to preserve the best individual solution for the next generation so as to obtain the improved solution, and that parallel schedule generation scheme is used to generate a feasible solution to the problem. The experimental results on standard problem sets indicate that the proposed algorithm not only produces reasonably good solutions to the problems over the heuristic method and other GA, but also can find the optimal and/or near optimal solutions for the large-sized problems with multiple resources within a reasonable amount of time that will be applicable to the construction industry. This paper will help researchers and/or practitioners in the construction project scheduling software area with alternative means to find the optimal schedules by utilizing the advantages of the Elitist GA.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.2
• /
• pp.33-46
• /
• 2000

The problem of scheduling n independent jobs on serial stages with identical parallel machines at each stage is considered. Each job lot is allocated evenly to all machines at each stage for processing and moved in transfer batches between states., This scheduling strategy is called an identical production pattern. The objective is to find a permutation schedule that minimizes makespan. A branch and bound algorithm is suggested to find an optimal permutation schedule for a transformed problem A number examples is presented to illustrate the branch and bound algorithm, Computational results for 640 problems generated randomly show that within a resonable time the suggested algorithm can be used for transfer batch scheduling in a flexible flowshop.

• Journal of the Korea Society for Simulation
• /
• v.12 no.2
• /
• pp.13-24
• /
• 2003

In this study, we propose a scheduling analysis method of the Flexible management system using the transitive matrix. The Scheduling problem is a combination-optimization problem basically, and a complexity is increased exponentially for a size of the problem. To reduce an increase of a complexity, we define that the basic unit of concurrency (short BUC) is a set of control flows based on behavioral properties in the net. And we propose an algorithm to divide original system into some BUC. To sum up, we divide a petri net model of the Flexible management system Into the basic unit of concurrency through the division algorithm using the transitive matrix. Then we apply it to the division-scheduling algorithm to find an efficient scheduling. Finally, we verify its efficiency with an example.

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

• Industrial Engineering and Management Systems
• /
• v.11 no.1
• /
• pp.114-122
• /
• 2012

This paper considers a non-identical parallel machine scheduling problem with sequence and machine dependent setup times. The objective of this problem is to determine the allocation of jobs and the scheduling of each machine to minimize makespan. A mathematical model for optimal solution is derived. An in-depth analysis of the model shows that it is very complicated and difficult to obtain optimal solutions as the problem size becomes large. Therefore, two meta-heuristics, genetic algorithm (GA) and a new population-based evolutionary meta-heuristic called self-evolution algorithm (SEA), are proposed. The performances of the meta-heuristic algorithms are evaluated through compare with optimal solutions using randomly generated several examples.