• Journal of applied mathematics & informatics
• /
• v.25 no.1_2
• /
• pp.305-314
• /
• 2007

This paper considers single machine scheduling problems where the processing time of a job increases as a function of its position in the sequence. In this model, the later a given job is scheduled in the sequence, the longer its processing time. It is shown that the optimal schedule may be very different from that of the classical version of the problem. We introduce polynomial solutions for the makespan minimization problem, the sum of completion times minimization problem and the sum of earliness penalties minimization problem. For two resource constrained problems, based on the analysis of the problems, the optimal resource allocation methods are presented, respectively.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2015.05a
• /
• pp.132-133
• /
• 2015

Efficient scheduling and resource management are the key factor to reduce construction project budget (e.g., labor cost, equipment cost, material cost, etc.). Resource-based line of balance (LOB) technique has been used to complement the limitations of time-driven scheduling techniques (e.g., critical-path method). Optimizing construction alternatives contributes cost savings while honoring the project deadline. However, existing LOB scheduling is lack of identifying optimal resource combination. This study presents a method which identifies the optimal construction alternatives, hence achieving resource minimization in a repetitive construction by using genetic algorithm (GA). The method provides efficient planning tool that enhances the usability of the system.

• International conference on construction engineering and project management
• /
• 2015.10a
• /
• pp.158-160
• /
• 2015

Efficient scheduling and resource management are the key factor to reduce construction project budget (e.g., labor cost, equipment cost, material cost, etc.). Resource-based line of balance (LOB) technique has been used to complement the limitations of existing time-driven scheduling techniques (e.g., critical-path method). Optimizing construction alternatives contributes to cost savings while honoring the project deadline. However, existing LOB scheduling is lack of identifying optimal resource combination. This study presents a method which identifies the optimal construction alternatives, hence achieving resource minimization in a repetitive construction by using genetic algorithm (GA). The method provides efficient planning tool that enhances the usability of the system.

• ETRI Journal
• /
• v.45 no.1
• /
• pp.45-59
• /
• 2023

In this paper, to optimize the average delay and power allocation (PA) for system users, we propose a resource scheduling scheme for wireless networks based on Cyclic Prefix Orthogonal Frequency Division Multiplexing (CP-OFDM) according to the first fifth-generation standards. For delay minimization, we solve a throughput maximization problem that considers CPOFDM systems with carrier aggregation (CA). Regarding PA, we consider an approach that involves maximizing goodput using an effective signal-to-noise ratio. An algorithm for jointly solving delay minimization through computation of required user rates and optimizing the power allocated to users is proposed to compose the resource allocation approach. In wireless network simulations, we consider a scenario with the following capabilities: CA, 256-Quadrature Amplitude Modulation, millimeter waves above 6 GHz, and a radio frame structure with 120 KHz spacing between the subcarriers. The performance of the proposed resource allocation algorithm is evaluated and compared with those of other algorithms from the literature using computational simulations in terms of various Quality of Service parameters, such as the throughput, delay, fairness index, and loss rate.

• Journal of the military operations research society of Korea
• /
• v.3 no.1
• /
• pp.123-136
• /
• 1977

This thesis presents a modification and extension to the Burgess and Killebrew heuristic resource leveling procedure for project networks. In contrast to previous algorithms appearing in the literature, the objective function of this algorithm. is the minimization of the sum of the squared errors in each time period (deviations around the mean usage) of all resources over the duration of the project. This objective function continues the search for an improved schedule beyond that of previous algorithms with their associated objective functions. One important feature is that the algorithm tends to reduce the number of periods that a resource is idle during its duration on the project.

• Journal of the Korea Organic Resources Recycling Association
• /
• v.8 no.1
• /
• pp.83-89
• /
• 2000

There is no simple method to solve livestock waste problems satisfactorily. For a successful solution, various methods should be well organized orderly depending upon the situation. Even in the livestock waste management, integrated waste management principle should be applied. Minimization of livestock waste generation is the first priority. It is also important to distribute fairly livestock farms throughout the nation. Efficient management of permit system is equally important. Permit should be given only when the farmer have enough grass-land on which the farmer can apply more than two thirds of livestock waste generated or when the farm have an anaerobic digestor in which store livestock waste generated for at least 3 months. In principle, livestock waste should be treated in the farm and it is desirable to operate composting facilities in the farm site too.

• Journal of the Korea Institute of Building Construction
• /
• v.4 no.1
• /
• pp.105-110
• /
• 2004

Resource procurement is an important management area because cost of resource covers 40％ of total construction project cost and resource delivery has direct relationship with project performance. Integration of cost provides various potentials for effective and efficient project control. This study investigates the usefulness of time in resource procurement management focused on materials. These days, construction projects have characterized manufacture because of industrialization and component. Therefore, application of systematic resource planning has been requested in the construction. There are many companies conducting procurement of resource on the web by applying MRP, ERP etc. in the construction. However, in applying them in the construction yet, there is obstruction. MRP has the character doing its function under accurate cost prediction of resource. But prediction of resource is difficult in industry mechanism of the construction. If accurate cost prediction of resource is possible in the construction, it will be expected to reduce cost of procurement of resource substantially by applying successful resource planning model in the manufacture. On the basis of recent current, the purpose of study is to present procurement of resource system that period observance of construction and minimization of stock is possible by reflecting accurate lead-time to apply proactive thought to be able to cope with alteration of construction schedule efficiently in analyzing resource planning of the construction site.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.2
• /
• pp.102-110
• /
• 2012

ZigBee networks developed for low power and short range communication are being used as home network solution for ubiquitous computing. However, as smart phones and tablet PCs have been widely used, WLANs which use same frequency with ZigBee networks have been increasingly used. Therefore, radio frequency interference causes many problems. To solve radio frequency interference problem among ZigBee networks and WLANs, many researches focus on designing interference minimization schemes in ZigBee networks. However, existing schemes have problems that have waste of resource for detecting interference, and have unnecessary time to avoid interference. In this paper, we propose an interference minimization scheme to solve radio frequency interference in ZigBee networks. The proposed scheme detects interference using ACK mechanism to reduce waste of resource, and avoids interference using table driven channel hopping scheme which is faster than existed schemes. The performance of proposed interference minimization scheme is evaluated by using OPNET simulator. Through the simulation result, we prove that proposed scheme has faster channel hopping than existing schemes.

• Industrial Engineering and Management Systems
• /
• v.9 no.2
• /
• pp.70-79
• /
• 2010

Makespan and cost minimization are two important factors in project investment. This paper considers a multi-mode resource-constrained project scheduling problem with the objective of minimizing costs, subject to a deadline constraint. A number of studies have focused on minimizing makespan or resource availability cost with a specified deadline. This problem assumes a fixed cost for the availability of each renewable resource per period, and the project cost to be minimized is the sum of the variable cost associated with the execution mode of each activity. The presented memetic algorithm (MA) consists of three features: (1) a truncated branch and bound heuristic that serves as effective preprocessing in forming the initial population; (2) a strategy that maintains two populations, which respectively store deadline-feasible and infeasible solutions, enabling the MA to explore quality solutions in a broader resource-feasible space; (3) a repair-and-improvement local search scheme that refines each offspring and updates the two populations. The MA is tested via ProGen generated instances with problem sizes of 18, 20, and 30. The experimental results indicate that the MA performs exceptionally well in both effectiveness and efficiency using the optimal solutions or the current best solutions for the comparison standard.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.38 no.2
• /
• pp.141-157
• /
• 2013

In this paper, we consider the minimization of the total weighted earliness-tardiness penalty of jobs, regarding the partial precedences between jobs. We present an optimal scheduling algorithm in O(n(n+m log m)) where n is the number of jobs and m is the number of partial precedences. In the algorithm, the optimal schedule is constructed iteratively by considering each group of contiguous jobs as a block that is represented by a tree.