• Journal of Applied Reliability
• /
• v.17 no.1
• /
• pp.58-65
• /
• 2017

Different from general operating policies applied for various waiting line situations, two complementary dyadic operating policies are applied alternatingly to a single server maintenance service center model. That is, either of the two dyadic Min (N, T) or Max (N, T) policy is applied to operate such center first and the other operating policy should be applied later, and then the same sequence of both operating policies is followed repeatedly. This operating policy is denoted by the Minimax (N, T) policy. Purpose: Because of the newly introduced operating policy, important system characteristics of the considered service center model such as the expected busy and idle periods, the expected number of customers in the service center and so on should be derived to provide necessary information for determination of the optimal operating policy. Methods: Based on concepts of the newly introduced Minimax (N, T) policy, all necessary system characteristics should be redefined and then derived by constructing appropriate relations between complementary two dyadic operating policies. Results: Desired system characteristics are obtained successfully using simple procedures developed by utilizing peculiar structure of the Minimax (N, T) policy. Conclusion: Applying Minimax (N, T) operating policy is equivalent to applying the simple N and T operating policies alternatingly.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.39 no.1
• /
• pp.81-90
• /
• 2016

Different from general operating policies to be applied for controllable queueing models, two of three well-known simple N, T and D operating policies are applied alternatingly to the single server controllable queueing models, so called alternating (NT), (ND) and (TD) policies. For example, the alternating (ND) operating policy is defined as the busy period is initiated by the simple N operating policy first, then the next busy period is initiated by the simple D operating policy and repeats the same sequence after that continuously. Because of newly designed operating policies, important system characteristic such as the expected busy and idle periods, the expected busy cycle, the expected number of customers in the system and so on should be redefined. That is, the expected busy and idle periods are redefined as the sum of the corresponding expected busy periods and idle periods initiated by both one of the two simple operating policies and the remaining simple operating policy, respectively. The expected number of customers in the system is represented by the weighted or pooled average of both expected number of customers in the system when the predetermined two simple operating policies are applied in sequence repeatedly. In particular, the expected number of customers in the system could be used to derive the expected waiting time in the queue or system by applying the famous Little's formulas. Most of such system characteristics derived would play important roles to construct the total cost functions per unit time for determination of the optimal operating policies by defining appropriate cost elements to operate the desired queueing systems.

• Journal of the Korea Safety Management & Science
• /
• v.19 no.3
• /
• pp.89-95
• /
• 2017

This paper presents another maintenance policy for a group of units under finite operating horizon. A group of identical units are subject to random failures. Group maintenances are performed to all units together at specified intervals, and the failed units during operation are remained idle until the next group maintenance set-up. Unlike the traditional assumption of infinite operating horizon, we adopt the assumption of the finite operating horizon which reflect the rapid industrial advance and short life cycle of modern times. The units are under operation until the end of the operating horizon. Further, the operation of units are extended to the first group maintenance time after the end of the horizon. The total cost under the proposed maintenance policy is derived. The optimal group maintenance interval and the expected number of group maintenances during the horizon are found. It is shown that the proposed policy is better than the classical group maintenance policy in terms of total cost over the operating horizon. Numerical examples are presented for illustrations.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.34 no.4
• /
• pp.162-168
• /
• 2011

The most generalized form of the triadic operating policy for a controllable M/G/I queueing model is analyzed to obtain fundamental relations among the other forms of operating policies based on its corresponding expected busy period. Since it consists of three decision variables N, T and D, it could be possible to decompose into the simple, the dyadic and other forms of the triadic operating policies. The procedures to decompose the most generalized triadic policy into other forms of operating policies could provide a general methodology to identify each element associated with it.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.1
• /
• pp.21-29
• /
• 2015

A steady-state controllable M/G/1 queueing model operating under the {T:Min(T,N)} policy is considered where the {T:Min(T,N)} policy is defined as the next busy period will be initiated either after T time units elapsed from the end of the previous busy period if at least one customer arrives at the system during that time period, or after T time units elapsed without a customer' arrival, the time instant when Nth customer arrives at the system or T time units elapsed with at least one customer arrives at the system whichever comes first. After deriving the necessary system characteristics including the expected number of customers in the system, the expected length of busy period and so on, the total expected cost function per unit time for the system operation is constructed to determine the optimal operating policy. To do so, the cost elements associated with such system characteristics including the customers' waiting cost in the system and the server's removal and activating cost are defined. Then, procedures to determine the optimal values of the decision variables included in the operating policy are provided based on minimizing the total expected cost function per unit time to operate the queueing system under considerations.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.37 no.1
• /
• pp.96-103
• /
• 2014

A steady-state controllable M/G/1 queueing model operating under the (TN) policy is considered where the (TN) policy is defined as the next busy period will be initiated either after T time units elapsed from the end of the previous busy period if at least one customer arrives at the system during that time period, or the time instant when Nth customer arrives at the system after T time units elapsed without customers' arrivals during that time period. After deriving the necessary system characteristics such as the expected number of customers in the system, the expected length of busy period and so on, the total expected cost function per unit time in the system operation is constructed to determine the optimal operating policy. To do so, the cost elements associated with such system characteristics including the customers' waiting cost in the system and the server's removal and activating cost are defined. Then, the optimal values of the decision variables included in the operating policies are determined by minimizing the total expected cost function per unit time to operate the system under consideration.

• Journal of the Korea Society for Simulation
• /
• v.8 no.3
• /
• pp.67-76
• /
• 1999

The study of the optimization of operating policy of AGV system, which is used in many factory automation environments has been proceeded by many researchers. The major operating policy of AGV system consists of routing and scheduling policy. AGV routing is composed with collision avoidance and minimal cost path find algorithm. To allocate jobs to the AGV system, AGV scheduling has to include AGV selection rules, parking rules, and recharging rules. Also in these rules, the key time parameters such as processing time of the device, loading/unloading time and charging time should be considered. In this research, we compare and analyze several operating policies of multiple loop-multiple AGV system by making a computer model and simulating it to present an appropriate operating policy.

• Journal of Korea Water Resources Association
• /
• v.31 no.4
• /
• pp.407-413
• /
• 1998

This study reviewed the recent studies for the climate change impact on water resource systems and applied one of the techniques to a real reservoir system - the Skagit hydropower system in U.S.A. The technique assumed that the climate change results in ±5% change in monthly average and/or standard deviation of the observed inflows for the Skagit system. For each case of the altered average and standard deviation, an optimal operating policy was derived using s SDP(Stochastic Dynamic Programming) model and compared with the operating policy for the non-climate change case. The results showed that the oparating policy of the Skagit system is more sensitive to the change in the streamflow average than that in the streamflow standard deviation. The derived operating policies were also simulated using the synthetic streamflow scenarios and their average annual gains were compared as a performance index. To choose the best operating policy among the derived policies, a Bayesian decision strategy was also presented with an example. Keywords : climate change, reservoir operating policy, stochastic dynamic programming, Bayesian decision theory.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.34 no.1
• /
• pp.67-73
• /
• 2011

Using the known result of the expected busy period for a controllable M/G/1 queueing model operating under the triadic Max (N, T, D) policy, its upper and lower bounds are derived to approximate its corresponding actual value. Both bounds are represented in terms of the expected busy periods for the dyadic Min (N, T), Min (N, D) and Min (T, D) and simple N, T and D operating policies. All three input variables N, T and D are equally contributed to construct such bounds for better estimation.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1999.05a
• /
• pp.145-153
• /
• 1999

We consider a Direct Input Output Manufacturing System(DIOMS) which has a munber of machine centers placed along a built-in Automated Storage/Retrieval System(AS/RS). The Storage/Retrieval (S/R) machine handles parts placed on pallets for the machine centers located at either one or both sides of the As/Rs. This report studies the operational aspect of DIOMS and determines the optimal operating policy by combining computer simulation and genetic algorithm. The operational problem includes: input sequencing control, dispatching rule of the S/R machine, machine center-based part type selection rule, and storage assignment policy. For each operating policy, several different policies are considered based on the known research results. In this report, using the computer simulation and genetic algorithm we suggest a method which gives the optimal configuration of operating policies within reasonable computation time.