• KIISE Transactions on Computing Practices
• /
• v.23 no.6
• /
• pp.392-396
• /
• 2017

Although mobile device-related technologies have developed rapidly, many problems arising from resource constraints have not been solved. Computation offloading that uses resources of cloud servers over the Internet was proposed to overcome physical limitations, and many studies have been conducted in terms of energy saving. However, completing tasks within their deadlines is more important than saving energy in real-time applications. In this paper, we proposed an offloading decision scheme considering the scheduling latency in the cloud to support real-time applications. The proposed scheme can improve the reliability of real-time tasks by comparing the estimated laxity of offloading a task with the estimated laxity of executing a task in a mobile device and selecting a more effective way to satisfy the task's deadline.

• International Journal of Automotive Technology
• /
• v.5 no.4
• /
• pp.269-276
• /
• 2004

There has been considerable activity in recent years in developing timing analysis algorithms for distributed real-time control systems. However, it is difficult for control engineers to analyze the timing behavior of distributed real-time control systems because the algorithms was developed in a software engineer's position and the calculation of the algorithm is very complex. Therefore, there is a need to develop a timing analysis tool, which can handle the calculation complexity of the timing analysis algorithms in order to help control engineers easily analyze or develop the distributed real-time control systems. In this paper, an interactive timing analysis tool, called RAT (Response-time Analysis Tool), is introduced. RAT can perform the schedulability analysis for development of distributed real-time control systems. The schedulability analysis can verify whether all real-time tasks and messages in a system will be completed by their deadlines in the system design phase. Furthermore, from the viewpoint of end-to-end scheduling, RAT can perform the schedulability analysis for series of tasks and messages in a precedence relationship.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.6
• /
• pp.337-343
• /
• 2006

The Stack Resource Policy (SRP) is a real-time synchronization protocol with some distinct properties. One of such properties is early blocking; the execution of a job is delayed instead of being blocked when requesting shared resources. If SRP is used with dynamic priority scheduling such as Earliest Deadline First (EDF), the early blocking requires that a scheduler should select the highest-priority job among the jobs that will not be blocked, incurring runtime overhead. In this paper, we analyze the runtime overhead of EDF scheduling when SRP is used. We find out that the overhead of job search using the conventional implementations of ready queue and job search algorithms becomes serious as the number of jobs increases. To solve this problem, we propose an alternative data structure for the ready queue and an efficient job-search algorithm with O([log$_2n$]) time complexity.

• Journal of the Korea Safety Management & Science
• /
• v.6 no.1
• /
• pp.219-228
• /
• 2004

We can be acquire the conformation about on the due date of supplier by using the A TP(A vail able to Promise) function of management about real and concurrent access on the supply chain, also decide the affect about product availability due to forecasting or customer's orders through the A TP. Under the these environments, defines the A TP rule that can improve the customer value and data flow related the LTV(Life Time Value) and builds on a algorithm. In this paper, It consolidates the necessity on a LTV (Life Time Value) and analyzes data which is concerned of Customer Value. Under the these environments, defines the LTV rule that can improve the customer value. And then, Scheduling plays an important role in shop floor planning. Therefore, this study tries to proposed that Scheduling by customer needs group for minimizing the problem.

• Journal of Korean Institute of Industrial Engineers
• /
• v.36 no.4
• /
• pp.219-229
• /
• 2010

The PERT/CPM are considered as the base procedures for the most successful project scheduling programs. Unfortunately, it is not easy to apply these procedures to real-life projects. This is due to the fact that PERT/CPM assume an infinite number of resources for each activity in project networks. Obviously, the completion time under no constraints is less than when constraints are imposed. One way of approaching this problem is to use heuristic solution techniques. In this paper, we present three heuristics; MRU (Maximum Resource Use) rule, STU (Shortest Time Use) rule, MRUP (Max Resource Use and Period) rule for allocating resources to activities of projects under multiple resource constraints. Comparisons of the project durations show that these heuristic rules are superior to AG3 rule that has been widely used in practice (Elsayed and Boucher, 1994).

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.249-252
• /
• 2004

The automatic determination of vehicle operation status as well as continuous tracking of vehicle location with intelligent management is one of major elements to achieve the goals. Especially, vehicle operation status can only be analyzed in terms of expert experiences with real-time location data with scheduling information. However the scheduling information of individual vehicle is very difficult to be interpreted immediately because there are hundreds of thousand vehicles are run at the same time in the national wide range workplace. In this paper, we propose the location-based knowledge management system(LKMs) using the active trajectory analysis method with routing and scheduling information to cope with the problems. This system uses an inference technology with dispatching and geographic information to generate the logistics knowledge that can be furnished to the manager in the central vehicle monitoring and controlling center.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.15 no.2
• /
• pp.17-31
• /
• 1990

This problem analyzed in this paper is to specify a schedule for thesis committee allowing maximum committee members' preference over thesis topics and meeting time-slots while satisfying other related scheduling requirements such as prohibiting simultaneous assignment of a committee member to more than one committee at a time. Two mathematical programming applroaches are presented to solve the thesis committee scheduling problem in a professional graduate school. They include LP-based branch-and-bound approach with network subproblems. Characterization of the problem is analyzed to develop an efficient solution algorithm. Implementation and computational experiments are also performed for real size problems on an IBM PC/AT to show the relative performance of the propsoed approaches along with an ordinary ILP solution approach.

• Management Science and Financial Engineering
• /
• v.17 no.1
• /
• pp.95-116
• /
• 2011

This paper considers a flowshop scheduling problem where a customer orders multiple products (jobs) from a production facility. The objectives are to minimize makespan and to minimize the sum of order (batch) completion times. The order cannot be shipped unless all the products in the order are manufactured. This problem was motivated by numerous real world problems encountered by a variety of manufacturers. For the makespan objective, we develop an optimal solution procedure which runs in polynomial time. For the sum of order completion time objective, we establish the complexity of the problem including several special cases. Then, we introduce a simple heuristic and find an asymptotically tight worst case bound on relative error. Finally, we conclude the paper with some implications.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.322-325
• /
• 2000

In a batch scheduling policy being different from real video system, the requests are not served immediately due to grouping user's requests upon every scheduling points. Such waiting delays by inefficient managements makes an unfair service to users and increases the possibility of higher reneging rates. This paper proposes an adaptive batch scheduling scheme which reduces the average waiting time of user’s requests and reduces the starvation problem for requesters of less popular movies. The proposed scheme selects dynamically multiple videos in given intervals based on the service patterns which reflect the popularity distribution and resource utilizations. Experimental simulation shows that proposed scheme improves about 20-30 percent of average waiting time and reduces significantly the starving requesters comparing with those of conventional methods such as FCFS and MQL.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.12
• /
• pp.17-27
• /
• 2022

In this paper, ED-H algorithm, an optimal real-time scheduling algorithm dealing with the characteristics of the integrated energy harvester system with a capacitor, is extended to satisfy the time constraint under the blackout state which is a deliberate power-off state by an intelligent power management unit adopted in the system. If the power supply system does not have enough energy, it temporarily shuts off the power supply to protect the circuit and capacitor and resumes the supply again when the capacitor is fully charged, which may delay the task execution during these blackout states by calculating the time according to the occurrence of the events. To mitigate the problem, even if task execution is delayed by the original ED-H algorithm, the remaining time of the subsequent time units no longer can afford to delay the execution of the task is predicted in the extended algorithm and the task is forced to be scheduled to meet the time deadline. According to the simulation results, it is confirmed that the algorithm proposed in this paper has a high scheduling performance increase of 0.4% to 7.7% depending on the characteristics of the set of tasks compared to the ED-H.