• 산업경영시스템학회지
• /
• 제37권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.

• 한국산업정보학회:학술대회논문집
• /
• 한국산업정보학회 1999년도 춘계학술대회 발표논문집
• /
• 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.

• 산업경영시스템학회지
• /
• 제38권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.

• 한국신뢰성학회지:신뢰성응용연구
• /
• 제17권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.

• 한국경영과학회지
• /
• 제4권1호
• /
• pp.51-67
• /
• 1979

This paper considers the problem of determining an optimal dynamic operating policy for a two-stage tandem queueing service system in which the service facilities (or stages) can be operated at more than one service rate. At each period of the system's operation, the system manager must specify which of the available service rates is to be employed at each stage. The cost structure includes an operating cost for running each stage and a service facility profit earned when a service completion occurs at Stage 2. We assume that the system has a finite waiting capacity in front of each station and each customer requires two services which must be done in sequence, that is, customers must pass through Stage 1 and Stage 2 in that order. Processing must be in the order of arrival at each station. The objective is to minimize the total discounted expected cost in a two-stage tandem queueing service system, which we formulate as a Discrete-Time Markov Decision Process. We present analytical and numerical results that specify the form of the optimal dynamic operating policy for a two-stage tandem queueing service system.

• 대한안전경영과학회지
• /
• 제19권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.

• 산업경영시스템학회지
• /
• 제39권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.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1992년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 19-21 Oct. 1992
• /
• pp.303-308
• /
• 1992

In this study, we propose a shared storage system which is more efficient policy than MIS(Mixed Intermediate Storage) policy for relatively rare storage system and can be called CIS(Common Intermediate Storage) policy. Using this strategy, we develop a new completion time algorithm and apply it to two kinds of optimal or near optimal scheduling method; combinatorial search and simulated annealing method. We also extend this strategy to other storage policy, for example MIS policy, with PLC(Programmable Logic Controller) logic and on/off action of electronic valves. It thus can be accepted as a basic form of FMS(Flexible Manufacturing System) for operating various storage policies. Finally we suggest the interlocking block to compansate for the shortcoming of CIS policy, i.e, complication of operation and safety, resulting in a basic batch process automation mode.

• Journal of the Korean Statistical Society
• /
• 제26권1호
• /
• pp.147-154
• /
• 1997

An infinite dam with a compound Poisson input having exponential jumps is considered. As an output policy, we adopt the $P_{\lambda}$$^{M}$ Policy. After assigning costs to the dam we obtain the long-rum average cost per unit time of operating the dam and find the optimal values of .lambda. and M which minimize the long-run average cost.t.

• 대한전자공학회논문지
• /
• 제27권4호
• /
• pp.571-579
• /
• 1990

A dynamic relocation algorithm for non-deterministic process graph in distributed computer systems is proposed. A method is represented for determining the optimal policy for processing a process tree. A general database query request is modelled by a process tree which represent a set of subprocesses together with their precedence relationship. The process allocation model is based on operating cost which is a function fo selection of site for processing operation, data reduction function and file size. By using expected values of parameters for non-deterministic process tree, the process graph and optimal policy that yield minimum operating cost are determined. As process is relocated according to threshold value and new information of parameters after the execution of low level process for non-deterministic process graph, the assigned state that approximate to optiaml solution is obtained. The proposed algorihtm is heuristic By performing algorithm for sample problems, it is shown that the proposed algorithm is good in obtaining optimal solution.