FMS operating system consists of several subsystems in general. i.e. tool grouping subsystem. tool/job assignment subsystem. job dispatching subsystem, and papers dealing with each subsystem were published by many researchers [1], [4], [6], [8], [9], [10], [11], [12], [13], [14], [15], [16]. This paper mainly discusses about tool/job assignment subsystem as a job loading procedure. that occupies the kernel position of overall FMS operating system. Its performance is evaluated through simulation experiments of an integrated operating system under a typical FMS hardware configuration implemented in many machining factories, which is composed of the proposed procedure as well as a job dispatching procedure including several heuristic dispatching rules in terms of rule-base.

We suggest a distributed framework for task assignment in the computer-controlled shop floor where each of the resource agents and part agents acts like an independent profit maker. The job allocation problem is formulated as a linear programming problem. The LP formulation is analyzed to provide a rationale for the distributed task assignment procedure. We suggest an auction based negotiation procedure including a price-based bid construction and a price revising mechanism. The performance of the suggested procedure is compared with those of an LP formulation and conventional dispatching procedures by simulation experiments.

In the literature, it is pointed that distributive justice explains pay satisfaction and job satisfaction better than procedural justice, and procedural justice explains organizational commitment and researcher's evaluation about the supervisor better than distributive justice. We empirically tested if these findings are valid in R＆D institutes with the data collected from Korean R＆D professionals. It is found that the relations between the justices and the outcome variables are more complicated. The result of the analysis shows that distributive justice is also significantly related to organizational commitment, but not to job satisfaction, and procedural justice is also significantly related to pay satisfaction, and job satisfaction. Implications of the findings and possible influence of the R＆D setting are discussed.

We show assets can be classified into diversifiable risks and non-diversifiable risks based on aggregate endowment and spanning so that in equilibrium agents eliminate diversifiable risks which must have zero values. Consequently, the benchmark portfolio that represents a pricing operator should have only a non-diversifiable risk, aggregate endowment should earn a positive risk premium over a riskless asset, and, even in incomplete markets, there should be a pricing operator represented by a function of aggregate endowment if any asset mean-independent of aggregate endowment is diversifiable. These results apply to both the CAPM and a representative agent model.

This paper presents an easily used graphical procedure for simultaneous estimation of the index, skewness, scale, and location parameters of the stable laws. First, the index $\alpha$ and skewness $\beta$ are estimated through the joint use of a tail length statistic $\widetilde{K_t}$ and a skewness statistic $\widetilde{K_s}$, both of which are functions of order statistics. Next, the function of order statistics needed for estimation of scale $\sigma$ and location $\mu$ are determined from a nomogram indexed on the estimates of $\alpha$ and $\beta$. Some applications and examples are provided.

We consider a priority-based multiclass queue with probabilistic feed-back. There are J service stations. Each customer belongs to one of the several priority classes, and the customers of each class arrive at each station in a Poisson process. A single server serves queued customers on a priority basis with a nonpreemptive scheduling discipline. The customers who complete their services feed back to the system instantaneously and join one of the queues of the stations or depart from the system according to a given probability. In this paper, we propose a new method to simplify the analysis of these queueing systems. By the analysis of busy periods and regenerative processes, we clarify the underlying system structure, and systematically obtain the mean for the sojourn time, i.e., the time from the arrival to the departure from the system, of a customer at every station. The mean for the number of customers queued in each station at an arbitrary time is also obtained simultaneously.

The main objective of this study is to uncover the differences in the programming behavior between methodology creators and methodology users. We conducted an experiment with methodology creators who have invented one of the major object-oriented methodologies and with professional programmers who have used the same methodology for their software-development projects. In order to explain the difference between the two groups, we propose a theoretical framework that views programming as search in four problem spaces: representation, rule, instance and paradigm spaces. The main problem spaces in programming are the representation and rule spaces, while the paradigm and instance spaces are the supporting spaces. The results of the experiment showed that the methodology creators mostly adopted the paradigm space as their supporting space, while the methodology users chose the instance space as their supporting space. This difference in terms of the supporting space leads to different search behaviors in the main problem spaces, which in turn resulted in different final programs and performance.