The observability of a variable and the redundancy of a measurement are basic information in designing process performance monitoring systems. In these papers an optimal algorithm is described which allows the classif...
详细信息
The observability of a variable and the redundancy of a measurement are basic information in designing process performance monitoring systems. In these papers an optimal algorithm is described which allows the classification of the operation variables of chemical plants. The results of this procedure are used to reduce the size of the reconciliation problem.
This paper investigates the semi-online scheduling problems on m parallel identical machines with non-simultaneous machine available *** objective is to maximize the minimum machine completion *** the semi-online vers...
详细信息
This paper investigates the semi-online scheduling problems on m parallel identical machines with non-simultaneous machine available *** objective is to maximize the minimum machine completion *** the semi-online version with jobs arrived in non-increasing processing time order,LS is showed an optimal algorithm for three and four machines cases and the lower bound 10/7 is presented when m is greater than or equal to five.
Dynamic programming, the ordinary adaptive compensation in the operational research, is used to resolve extremum of functions under the constraint condition. In this paper, it is introduced that, fund
Dynamic programming, the ordinary adaptive compensation in the operational research, is used to resolve extremum of functions under the constraint condition. In this paper, it is introduced that, fund
In this paper, we study Moving Checkers Game, an interesting shifting checkers game consisting of n black checkers and 1 white checkers. We have proved that the minimum number of steps needed to play the game for gene...
详细信息
In this paper, we study Moving Checkers Game, an interesting shifting checkers game consisting of n black checkers and 1 white checkers. We have proved that the minimum number of steps needed to play the game for general n is 2n+1. We have also presented an optimal algorithm to generate all of the optimal solutions in linear time for very large size. The number of solutions for the game of size n is the(n+2)th Fibonacci number.
暂无评论