• IE interfaces
• /
• v.10 no.1
• /
• pp.47-55
• /
• 1997

This paper deals with an assembly process of the TFT glasses and the color filters in LCD manufacturing. Two specific problems are presented and solved. One is a matching problem to find the best matches between a set of TFT glasses and a set of color filters, which result in the maximum number of good LCD assemblies. A simple mathematical model is constructed for this problem and an optimal solution can be obtained using an existing algorithm. The other is a main problem that requires a determination of an economic lot size of the color filters which are going to be assembled with a given set of TFT glasses. A Bayesian dynamic forecasting model is developed to predict the defective patterns of color filters. Based on the predicted defective rate of color filters, the minimum lot size of the color filters can be determined to minimize the probability of losing good TFT glasses and color filters.

• International Journal of Aeronautical and Space Sciences
• /
• v.17 no.3
• /
• pp.401-408
• /
• 2016

During daylight, the solar array of low earth orbit satellites harvests electrical power to operate satellites. The power conversion of the solar array is carried out by control of the operation point using the solar array regulator when the solar array faces the sunlight. Thus, the design of the solar array should comply with not only the power requirement of satellite system but also the input voltage requirement of the solar array regulator. In this paper, the design requirements of the solar array for low earth orbit satellites are defined, and the means of satisfying these requirements are described. In addition, the architecture of a multi-distributed interface is suggested to maximize the power harvested from a solar array having high temperature deviation between each panel. The power analysis in this paper shows the optimal number of multi-distributed interfaces with a converter.

• IE interfaces
• /
• v.19 no.2
• /
• pp.168-173
• /
• 2006

In the Reporting Cell Location Management (RCLM) system, a subset of cells in the network is designated as the reporting cells. Each mobile terminal performs location update only when it enters one of these reporting cells. When a call arrives, the paging is confined to the reporting cell the user last reported and the neighboring bounded non-reporting cells. Frequent location update may result in degradation of quality of service due to interference. Miss on the location of a mobile terminal will necessitate a search operation on the network when a call comes in. We must decide the number of reporting cells and which cell should be reporting cell to balance the registration (location update) and search (paging) operations to minimize the cost of RCLM system. This paper proposes a ranking ant colony system (RACS) for optimization of RCLM system.

• IE interfaces
• /
• v.16 no.1
• /
• pp.27-33
• /
• 2003

The maintenance cost in K Steelworks has been continuously increased in proportion to the production cost. However, there seems to be a possibility of reducing cost through the optimization of maintenance actions. The failure types of the equipment in steelworks ate various with different failure cost. Thus the failure rate and cost of each type of failures should be considered simultaneously when the optimum maintenance period is to be determined. It is considered that the equipment undergoes periodic replacement and a specified number of incomplete preventive maintenance actions are performed during a replacement period. Assuming that the time to failure follows a Weibull distribution, the parameters of the failure rate are estimated using the maximum likelihood estimation. The optimal replacement period is determined to minimize the average cost per unit time. As the result of analysis it is suggested that the existing maintenance period for a hot-rolling equipment can be extended significantly.

• IE interfaces
• /
• v.19 no.4
• /
• pp.270-280
• /
• 2006

The shipping plan for an efficient augmentation of terminal is NP-hard problem which is subordinate to a shipping quantity. The load location problem and stowage planning problem are two important tactical problems for the efficient operations of container terminals. This paper is concerned with reduction of feasible region in constraints for stowage planning. After designing model which minimizes the number of shifting and the travel distance of the transfer crane, the simulated annealing algorithm is employed to search optimal solution quickly and accurately. In order to apply more realistic approach, the partial restriction through adding hatch is complemented to stowage planning decision problem applied in cluster. A variety of numerical experiments demonstrated that solutions by simulated annealing algorithm are useful and applicable in practice.

• IE interfaces
• /
• v.24 no.4
• /
• pp.274-280
• /
• 2011

Delayed access to surgery may lead to deterioration in the patient condition, poor clinical outcomes, increase in the probability of emergency admission, or even death. The purpose of this work is to decide the number of patients selected from a waiting list and to schedule them in accordance with the operating room capacity in the next period. We formulate the problem as an infinite horizon Markov Decision Process (MDP), which attempts to strike a balance between the patient waiting times and overtime works. Structural properties of the proposed model are investigated to facilitate the solution procedure. The proposed procedure modifies the conventional value iteration method along with the binary search technique. An example of the optimal policy is provided, and computational results are given to show that the proposed procedure improves computational efficiency.

• IE interfaces
• /
• v.23 no.2
• /
• pp.89-99
• /
• 2010

Containers are commonly used as an effective and relatively inexpensive method for transporting goods. Unfortunately, there are often imbalances between the number of import and export containers, and some ports have a surplus of empty containers while others have a deficit. The Empty Container Simulation Game was developed to address these problems. The game is a computer role playing simulation that simulates the distribution of empty containers in order to solve empty container imbalances among ports. An optimal solution is obtained by the computer using linear programming (LP). Upon completion of the game, a player's game results are displayed along with the LP solution. The game interface was designed to provide easy access and operation. This game will serve to provide an easy understanding and planning for empty container management.

• IE interfaces
• /
• v.21 no.2
• /
• pp.170-176
• /
• 2008

Consider a multi-floor facility with multiple rooms of unequal size on each floor. Students come from many organizations to attend the conference to be held at this facility. In assigning the rooms to the students, several constraints must be met; such as boys and girls must not be assigned to the rooms on the same floor. Given the capacity of each room and the number of students from each organization, the problem is assigning students to rooms under a set of constraints and various objectives. We present six models with different objective functions; and formulate them as binary integer programming problems. A numerical example and a case study follow to illustrate the proposed models.

• IE interfaces
• /
• v.5 no.2
• /
• pp.39-52
• /
• 1992

This paper presents alternatives for facilities planning and analyses them using simulation approach. For this purpose, hydro-cylinder production line was sampled as a case study. Several facilities planning alternatives are evaluated based on the several factors such as line balancing, equipment utilization, optimum number of equipments, inventory size, flow time, bottleneck machine, and productive capacity. An optimal facilities planning is proposed based on the degree of meeting with the all factors evaluated. The simulation language employed in this study is SIMAN and the data used for simulation are provided by hydro-cylinder shop.

• IE interfaces
• /
• v.8 no.2
• /
• pp.161-169
• /
• 1995

In this paper, a threshold policy is considered for the Markovian queueing system with server vacations. The threshold policy considered in this paper has the following form: "when the number of customers present in the system increases to N, the server is turned on and serves customers until the system becomes empty". In this paper, we show how the finite capacity or finite population queueing system under a threshold policy can be modeled by the stochastic Petri net. The performance evaluation of the model is carried out using the software called "SPNP". Some examples are also presented in which it is shown that how the optimal threshold policies can be obtained under a linear cost structure.