The family disaggregation model of hierarchical production planning (HPP) is the problem of (0 -1) mixed integer programming that minimizes the total sum of setup costs and inventory holding costs over the planning horizon. This problem is hard in a practical sense since optimal solution algorithms have failed to solve it within reasonable computation times. Thus effective familoy disaggregation algorithm should be developed for HPP. The family disaggregation algorithm developed in this paper consists of the first stage of finding initial solutions and the second stage of improving initial solutions. Some experimental results are given to verify the effectiveness of developed disaggregation algorithm.

A completely separated functional FMS (Flexible Manufacturing Systems), or a partly separated functional FMS, should be constructed because a fully functional FMS, where each machine has all of the tools required for procesing various kinds of jobs, is superflous and wasteful in meeting the multiform and changeable demands of comsumers in a flexible manner. The effective methods are presented in this study for allocating the tools to each machine in a two-machine flow shop type FMS to meet the above demands and to maximize the utilization of the FMS. The methods for a completely separated functional FMS having no duplicated tools and a partly separated functional FMS having some duplicated tools are proposed in this paper. Some simulation results clarify that utilization of the FMS by this methods is as high as the fully functional FMS when the number of jobs is large.

This paper condisers a problem of determining arc capacities for a communication network with fixed-charged linear arc-cost functions, which is known to be NP-hard. For the problem, an efficient heuristic solution procedure is derived. The procedure is further shown working well for designing arc capacities of a network in a situation where the network needs to be extended by connecting its nodes to some new nodes or where the network needs to be extended by expanding its arc capacities.

Monitoring processor in a circuit switched network is considered. Monitoring processor monitors communication links offers a grade of service in each link to controller. Such an information is useful for an effective maintenance of system. Two links with asymmetric system parameters and multi-symmetric links are respectively considered. Each links is to be an independent M /M/ 1/ 1/ type. Markov modeling technique is used to represent a model of monitoring processor with FCFS steering protocol. Performance measures considered are ratio of monitored jobs in each link, availability of minitoring processor and throughput of virtual processor in each link. The value of the performance meausres are compared with existing and simulation results.

The tests in a battery can be performed in different sequences, and different sequential testing strategies will have exactly the same overall performances for that battery, but at different expected total costs and expected time consumptions. By using a multiobjective dynamic programming model, we are able to find all noninferior testing strategies for a given battery of tests and a stopping rule.

A Baysian approach is proposed is estimating the mission failure rates by criticalities. A mission failure which occurs according to a Poisson process with unknown rate is assumed to be classified as one of the criticality levels with an unknown probability. We employ the Gamma prior for the mission failure rate and the Dirichlet prior for the criticality probabilities. Posterior distributions of the mission rates by criticalities and predictive distributions of the time to failure are derived.

MARKAL (MARKet ALlocation) Model, one of the most sophisticated energy technology assessment model is applied to finding the optimum mix of energy sources and evaluating energy technology competitiveness in Korea. The model is capable of handling Multiple Objective Linear Programming to test the related cost minimization and environmental control function. In this paper three environmental regulation scenarios are observed including 10% and 20% reduction of carbon dioxide emission level. For the purpose of establishing the basic data base, Korea Reference Engergy System is also developed on the base of the year 1989 with technology utilization and energy flow analysis.

This paper considers inspection station location problem for a flexible assembly line that consists of multiple stages. By considering the trade-off between locating an station at an "early" stage and at a "late" stage, we have developed some dominance relations on a graph. Based on the dominance relations, we then present an algorithm that finds an optimal inspection plan and a heuristic approach that finds a near-optimal inspection plan. The effectiveness of these two algorithms is demonstrated by two numerical examples. numerical examples.

We study a manufacturing process that is quite common in semiconductor wafer fabrication of semiconductor chip production. A machine is used to process a job consisting of J wafers. Each job requires a setup, and the i$_{th}$ setup for a job is sucessful with probability P$_{i}$. The setup is prone to failure, which results in the loss of expensive wafers. Therefore, a tiral run is first conducted on a small batch. If the set up is successful, the test is passed and the balance of the job can be processed. If the setup is unsuccessful, the exposed wafers are lost to scrap and the mask is realigned. The process then repeats on the balance of the job. We call this as send-ahead policy and consider general policies in which the number of wafers that are sent shead depend on the cost of the raw wafer, the sequence of success probabilities, and the balance of the job. We model this process and determine the expected number of good wafers per job,the expected time to process a job, and the long run average throughput. An algorithm to minimize the cost per good wafer subject to a demand constraint is provided.d.d.

The Production Switching Heuristic (PSH) develope dby Mellichamp and Love (1978) has been suggested as a more realistic, practical and intuitively appealing approach to aggregate production planning (APP). In this researh, PSH has been modified to present a more sophisticated open grid search procedure for solving the APP problem. The effectiveness of this approach has been demonstrated by determining a better near-optimala solution to the classic paint factory problem. The performance of the modified production switching heuristic is then compared in the context of the paint factory problem with results obtained by other prominent APP models including LDR, PPP, and PSH to conclude that the modified PSH offers a better minimum cost solution than the original PSH model.

This paper presents possibilistic job scheduling based on the membership function as an alternative to probabilistic job scheduling and illustrates a methodology for solving job sequencing problem which the opinions of experts greatly disagree in each processing time. Triangular fuzzy numbers are used to represent the processing times of experts. Here, the comparison method is based on the dominance property. The criteria for dominance are presented. By the dominance criteria, for each job, a mojor TFN and a minor TFN are selected and apessimistic sequence with mojor TFNs and an optimistic sequence with minor TFNs are computed. The three-machine flow shop problem is considered as an example to illustrate the approach.