• Journal of the Korean Operations Research and Management Science Society
• /
• v.20 no.3
• /
• pp.1-16
• /
• 1995

Group collaborative systems are recently emerging to support a group of users engaged in common tasks such as group decision making, engineering design, group scheduling, or collaborative writing. This paper provides an change management framework for the group collaborative system to facilitate managing dependency relationship between shared objects and dependent user views, and coordinating change and propagation activities between the two in distributed computing environments. Specifically, the framework adopts an object-oriented database paradigm and presents several object constructs capturing dependency management and change notification mechanisms. First, it introduces change management mechanisms with transient shared objects and secondly, it extends them into presistent object computing environment by integrating transaction management mechanisms and change notification mechanisms. A prototype change management framework is developed on a commercial object-oriented database management system.

• Journal of the Korean Society for Precision Engineering
• /
• v.32 no.1
• /
• pp.25-37
• /
• 2015

This paper suggests a decision tree based approach for flexible job shop scheduling with multiple process plans. The problem is to determine the operation/machine pairs and the sequence of the jobs assigned to each machine. Two decision tree based scheduling mechanisms are developed for static and dynamic flexible job shops. In the static case, all jobs are given in advance and the decision tree is used to select a priority dispatching rule to process all the jobs. Also, in the dynamic case, the jobs arrive over time and the decision tree, updated regularly, is used to select a priority rule in real-time according to a rescheduling strategy. The two decision tree based mechanisms were applied to a flexible job shop case with reconfigurable manufacturing cells and a conventional job shop, and the results are reported for various system performance measures.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.27 no.1
• /
• pp.47-50
• /
• 2004

This paper deals with the problem of batching and scheduling of jobs whose processing times are different respectively But, they are given as not the exact value but the range from the lower limits to the upper, which makes it possible to group jobs into batches. The grouping of jobs is desirable because of the capability of the batch processor to accommodate several jobs at once. The time required to process the jobs in any batch depends on their lower limit processing times. Once processing is initiated on a batch processor, the batch cannot be interrupted, nor can other jobs be started. And all jobs are assumed to be simultaneously available. This paper develops the model to describe these situation and a heuristic method to minimize its total tardiness.

• Korean Management Science Review
• /
• v.17 no.1
• /
• pp.41-54
• /
• 2000

in the real world situations that some jobs need be processed only on certain limited machines frequently occur due to the capacity restrictions of machines such as tools fixtures or material handling equipment. In this paper we consider n-job non-preemptive and m parallel machines scheduling problem having two machines group. The objective function is to minimize the sum of earliness and tardiness with different release times and due dates. The problem is formulated as a mixed integer programming problem. The problem is proved to be Np-complete. Thus a heuristic is developed to solve this problem. To illustrate its suitability and efficiency a proposed heuristic is compared with a genetic algorithm and tabu search for a large number of randomly generated test problems in ship engine assembly shop. Through the experimental results it is showed that the proposed algorithm yields good solutions efficiently.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.269-270
• /
• 2008

TD-SCDMA combines TDMA and CDMA components to provide more efficient use of radio resources, and includes a new feature called HSDPA (high-speed downlink packet access) in the R5 stage. The TD-HSDPA supports high-speed traffic with a shared channel, but the adopted mechanism causes feedback problem for scheduling. In this paper, we propose an improved mechanism that transmits channel quality indicator (CQI) more frequently, so that the TD-HSDPA scheduler can utilize all possible information about the downlink channel status.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.271-272
• /
• 2008

TD-SCDMA combines TDMA and CDMA components to provide more efficient use of radio resources, and includes a new feature called HSDPA (high-speed downlink packet access) in the R5 stage. The TD-HSDPA supports high-speed traffic with a shared channel, but its uplink mechanism causes feedback problem for scheduling. Since the base station of TD-SCDMA can estimate the location of mobile terminals precisely, it can also estimate the possible path loss. In this paper, the base station utilizes the estimated path loss for scheduling, which is related with CQI (channel quality indicator) values. The proposed mechanism can provide the TD-HSDPA scheduler with an intial CQI value for efficient transmission.

• Proceedings of the KIEE Conference
• /
• 2002.11c
• /
• pp.257-263
• /
• 2002

Test scheduling of SoC becomes more important because it is one of the prime methods to minimize the testing time under limited power consumption of SoCs. In this paper, a heuristic algorithm, in which test resources are selected for groups and arranged based on the size of product of power dissipation and test time together with total power consumption in core-based SoCs is proposed. We select test resource groups which has maximum power consumption but does not exceed the constrained power consumption and make the testing time slot of resources in the test resource group to be aligned at the initial position to minimize the idle test time of test resources.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.1
• /
• pp.27-41
• /
• 2005

This paper considers identical parallel machine scheduling problem. Each job has a processing time. due date. weight and family type. If a different type of job is followed by prior job. a family setup is incurred. A two phased heuristic is presented for minimizing the sum of weighted tardiness. In the first phase. using roiling horizon technique. group each job into same family and schedule each family. In the second phase. assign each job to machines using schedule obtained in the first phase. Extensive computational experiments and comparisons among other algorithms are carried out to show the efficiency of the proposed algorithm.

• Proceedings of the Safety Management and Science Conference
• /
• 2004.05a
• /
• pp.291-294
• /
• 2004

Last 2003, the CRM mayor was not lively glaringly. At beginning of the year, it may be said that gained result fewer than half of that is forecasted. Enterprises are seen that there are a lot of occasions that did not carry CRM project that planned very first time in practice or put off investment program until 2004 altogether. This can see that it is thing which CRM's accuracy of data analysis process drops up to now and investment of enterprises is unprepared. 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 Communications and Networks
• /
• v.7 no.1
• /
• pp.65-75
• /
• 2005

In this paper, we consider a scenario in which the source has been offered QoS guarantees subject to token-bucket regulation. The rate of the source should be controlled such that it conforms to the token-bucket regulation, and also the distortion obtained is the minimum. We have developed an optimal scheduling algorithm for offline (like pre-recorded video) sources with convex distortion function and which can not tolerate any delay. This optimal offline algorithm has been extended for the real-time online source by predicting the number of packets that the source may send in future. The performance of the online scheduler is not substantially degraded as compared to that of the optimal offline scheduler. A sub-optimal offline algorithm has also been developed to reduce the computational complexity and it is shown to perform very well. We later consider the case where the source can tolerate a fixed amount of delay and derive optimal offline algorithm for such traffic source.