The cell loss probability recommended in the B-ISDN is in the range . When a simulation technique is used to analyze the performance of the ATM node, an enormous amount of computer processing time is required. In this study, we derive an importance sampling simulation technique that can be used to evaluate the performance of the ATM node very quickly, that is, the probability that the queue size at the ATM node reaches some large value N. The simulation results show that the backlog probability obtianed by the importance saimpling simulation is very close to that obtained by the ordinary simulation and the computer time can be reduced drastically by the importance sampling simulation.

This paper considers the efficient design of routing path and wavelength assignment in the single-hop WDM optical transport networks. The connection demands between node-pairs are given and a connection between a pair of nodes must be made by only one lightpath. It is assumed that no wavelength conversion is allowed and the physical topology of the network and the number of available wavelengths of a physical link are also given. This paper proposes the method to route a path and assign a wavelength to the path, which guarantees fairness to every node pair. In order to guarantee fairness and maximize connections, an optimization model is established, which successively maximizes minimum connection ratio to the demand of each node pair. A heuristic algorithm with polynomial iterations is developed for the problem since the problem is NP-hard. The heuristic algorithm is implemented and applied to the networks with real problem sizes. The results of the application are compared with GAMS/OSL.

We consider the channel allocation problem for the earth orbit (LEO) satellite systems. This problm is known to be NP-complete and a couple of heuristic algorithms have been developed. In this paper, we convert the problem into a simpler form through the concept of pattern. And we suggest another algorithm based on Simulated Annealing for this simplified problem. The results of performance comparison show that our method works very well. Simulation results are reported.

Recently Lee et al[5] developed an approximation algorithm for the performance evaluation of the open queueing networks with blocking. This algorithm, which solves the exponential queueing networks with general configuration is developed based on the symmetrical decomposition approach and is reported to have many advantages over the previous algorithmsf. In addition to being very accurate, this algorithm is reported to be quite simple, pretty fast and solves very general configurations. In this study, we show that if a network has a tree-like configurations, the algorithm developed by Lee at al, always converges to the unique solution. To prove the theoretical results pertaining to the algorithm, some properties associated with symmetrical decomposition approach are exploited. The results obtained in this study such as the proofs of convergence of the algorithm as well as uniquences of the solution would contribute to the theoretical study for the non-tandem configurating of open queueing network.

In this paper, we consider with a market pioneering game among symmetric firms in highly competitive situation. To describe the puzzling situation of timing competition, we construct a dynamic game model and explore the equilibrium solution. As a result, we find a subgame perfect mixed strategy Nash equilibrium conceptually defined by 't + .elsilon. equilibrium'. Our major finding s include : i) market entry will be occurred in sequential manner even though the condition of each firm is symmetric ii) the optimal timing of market pioneering will be advanced until almost all of the monopolist's profit is dissipated, iii) as the market position of the pioneer is stronger, the timings of the pioneer and the follower are separated, iv) and as the slope of the profit flow is steeper, the entry timing of the two players will be pooled together.

The terminology such as ecology, environment problems, ecosystems, ecofactory, and others related to environmental problems have been recently used in manufacturing systems, since the modern industries have to consider a global ecological crisis. The indifference of recent environmental problems which may be faced now has been paid attention to all engineering areas. In this paper, manufacturing functional requirements such as disassembly, disposal, disposal, or recycling are considered in the integrated product design development, which have not been considered well in the preliminary design stage. Those functions will contribute to reduce the waste and to long the product life cycle, which also satisfies the business benefits and customer requirements. The concurrent design concepts should be applied to integrate all possible factors. Therefore, few practical concurrent engineering tools are presented in here. The objective of this paper is to develop a called green manufacturing systems for integrated product design development by concurrent design concept which can give the desirable result in product design.

In studying an EOQ-like inventory model for a manufacturing process, a number of findings were made. The system can "go out of control" resulting in a relatively minor problem state or "break-down". When the production system is in the minor problem statei produces a number of defective items. It is assumed that each defective piece requires rework cost and related operations. Once the machine breakdown takes place, the production system produces severely defective items that are completely unusable. Each completely unusuable item is immediately discarded and incurs handling cost, scrapped raw material cost and related operations. Two investment options in improving the production process are introduced : (1) reducing the probability of machine breakdown, breakdowns, and (2) simultaneously reducing the probability of machine breakdowns and setup costs. By assuming specific forms of investment cost function, the optimal investment policies are obtained explicitly. Finally, to better understand the model in this paper, the sensitivity of these solutions to changes in parameter values and numerical examples are provided.amples are provided.

The problem addressed in this paper is to minimize the deviations of workloads assigned to worker and to maximize the total utilizations(degree of skill) between workers and machines simultaneously. Each worker can handle the set of machines with the different degree of skill and each machine has the workloads needed to be processed. Also, each worker has to be assigned to at least one machine with the minimum workload deviation. This problem can be formulated as a preemptive goal programming with generalized assignment constraints. The proposed algorithm consists of two phases. First, a capacitated circulation network is constructed to assign the workers to machines with the maximum total utilizations while considering workloads balance. Then, a refinement process is applied to the split machines to satisfy the feasibility condition. The real industrial application in a plastic extrusion manufacturer is included along with several computational experiments.

The major two steps required to design a cellular layout are cell formation and cell layout. Because of the differences between manufacturing and assembly operations, the logic of cell formation and cell layout between an FMS and an FAS is not the same. Since the time for the assembly operations is usualaly relatively short, the transfer time is thus very crucial for the performance of assembly systems. Transfore in a cellular FAS it is more important to eliminate backtracking operations in assembly planning, not to allow intercellular movements in cell formation, and to arrange machines according to assembly sequence in cell layout. This study presents a method for the integrated layout design in cellular FASs considering the characteristics of FAS, layout, and production factors.

We propose a method for estimating the probability of perfect PM from successive failure times of a repairable system. The system under study is maintained preventively at periodic times, and it undergoes minimal repair at failure. We consider Brown-Proschan imperfect PM model in which the system is restored to a condition as good as new with probability P and is otherwise restored to its condition just prior to failure. We discuss the identifiability problem when the PM modes are not recorded. The expectation-maximization principle is employed to handle the incomplete data problem. We assume that the lifetime distribution belongs to a parametric family with increasing failure rate. For the two parameter Weibull lifetime distribution, we propose a specific algorithm for finding the maximum lifelihood estimates of the reliability parameters : the probability of perfect PM (P), as well as the distribution parameters. The estimation method will provide useful results for maintaining real systems.

We present a procedure which finds the probability distribution of number of customers accumulated when the server ends a vacation in the Geo/G/1 gated queueing system, where the service for a customer and the vacation, respectively, takes one slot time. The pp. g. f. for the number of customers accumulated at the gate closing epoch is obtained as a recursive form. The full probabilities, then, are derived using an iterative procedure. This system finds an application in a packet transmitting telecommunications system where the server transmits(serves) packets(customers) accumulated at a gate closing epoch, and takes one slot time vacation thereafter.

In this paper, an efficient dynamic channel assignment scheme is suggested, which consists of two types of channel allocation strategies : ordinary channel allocation strategy and channel reallocation strategy. An analysis on the handoff probabilities of handoff and new calls is also performed, and using the analyzed handoff probability, the presented scheme is compared with other existing schemes in terms of three types of blocking probabilities- new call blocking probability, handoff call blocking probability, and network blocking probability (incomplete service probability). Simulation results show that the presented scheme significantly reduces those blocking probabilities over the existing schemes. Furthermore, the scheme has much smaller number of reallocation than other schemes.

In this research, the intensity of solar energy, which was injected to the different angle plane every hour day by day, was technically documented and quantitatively analyzed through actual observations. In order to group every days into days with similar intensity, graph was drawn with respect to time for every dary and each area value under the curve was calculated. Then, the search for grouped days having similar intensity curve patterns was carried out. In order to maximize the efficiency of solar energy systems, the optimum incident angle of absorber plate was derived.