共查询到17条相似文献，搜索用时 140 毫秒
1.
This paper considers a reentrant scheduling problem on parallel primary machines with a remote server machine, which is required to carry out the setup operation. In this problem, each job has three operations. The first and last operations are performed by the same primary machine, implying the reentrance, and the second operation is processed on the single server machine. The order of jobs is predetermined in our context. The challenge is to assign jobs to the primary machines to minimize the makespan. We develop a genetic algorithm（GA） to solve this problem. Based on a simple strategy of assigning jobs in batches on the parallel primary machines, the standardized random key vector representation is employed to split the jobs into batches. Comparisons among the proposed algorithm, the branch and bound（BB） algorithm and the heuristic algorithm, coordinated scheduling（CS）, which is only one heuristic algorithm to solve this problem in the literature, are made on the benchmark data. The computational experiments show that the proposed genetic algorithm outperforms the heuristic CS and the maximum relative improvement rate in the makespan is 1.66%. 相似文献
2.
Batch process monitoring based on multilevel ICA-PCA 总被引：1，自引：0，他引：1
In this paper, we describe a new batch process monitoring method based on multilevel independent component analysis and principal component analysis （MLICA-PCA）. Unlike the conventional multi-way principal component analysis （MPCA） method, MLICA-PCA provides a separated interpretation for multilevel batch process data. Batch process data are partitioned into two levels： the within-batch level and the between-batch level. In each level, the Gaussian and non-Gaussian components of process information can be separately extracted.I^2 T^2 and SPE statistics are individually built and monitored. The new method facilitates fault diagnosis. Since the two variation levels are decomposed, the variables responsible for faults in each level can be identified and interpreted more easily. A case study of the Dupont benchmark process showed that the proposed method was more efficient and interpretable in fault detection and diagnosis, compared to the alternative batch process monitoring method. 相似文献
3.
关于简单线性恶化问题的平行机排序的一个全多项式逼近算法 总被引：1，自引：0，他引：1
In this paper, a parallel machine scheduling problem was considered , where the processing time of a job is a simple linear function of its starting time. The objective is to minimize makespan. A fully polynomial time approximation scheme for the problem of scheduling n deteriorating jobs on two identical machines was worked out. Furthermore, the result was generalized to the case of a fixed number of machines. 相似文献
4.
The combination of online or semi-online with deterioration jobs has never been researched in scheduling problems. In this paper, two semi-online parallel machine scheduling problems with linear deterioration processing time are considered. In the first problem, it is assumed that the deterioration rates of jobs are known in an interval, that is, bj ∈[0, α], where 0 〈α≤ 1 and bj denotes the linear deterioration rate. In the second problem, it is assumed that the largest deterioration rate of jobs is known in advance, that is, b = max1≤j≤n {bj }. For each of the two problems, a heuristic MBLS algorithm is worked out and its worst-case ratio is analyzed. At the same time, the worst-case ratio of the list （LS） algorithm is investigated and it is proved that all the ratios are tight. 相似文献
5.
TIRF microscopy has provided a means to view mobile granules within 100 nm in size in two dimensions. However quantitative analysis of the position and motion of those granules requires an appropriate tracking method. In this paper, we present a new tracking algorithm combined with the unique features of TIRF. Firstly a fluorescence correction procedure was processed to solve the problem of fluorescence bleaching over time. Mobile granules were then segmented from a time-lapse image stack by an adaptive background subtraction method. Kalman filter was introduced to estimate and track the granules that allowed reducing searching range and hence greater reliability in tracking process. After the tracked granules were located in x-y plane, the z-position was indirectly inferred from the changes in their intensities. In the experiments the algorithm was applied in tracking GLUT4 vesicles in living adipose cells. The results indicate that the algorithm has achieved robust estimation and tracking of the vesicles in three dimensions. 相似文献
6.
A parallel system with two active components and a cold standby unit is studied in this paper. The two simultaneously working components are dependent and the copula function is used to model their dependence. An explicit expression is obtained for the mean time to failure of the system in terms of the copula function and marginal lifetime distributions in two different cases As an application, numerical calculations are presented corresponding to two different copula functions and marginal lifetime distributions. 相似文献
7.
When an emergency happens, the scheduling of relief resources to multiple emergency locations is a realistic and intricate problem, especially when the available resources are limited. A non-cooperative games model and an algorithm for scheduling of relief resources are presented. In the model, the players correspond to the multiple emergency locations, strategies correspond to all resources scheduling and the payoff of each emergency location corresponds to the reciprocal of its scheduling cost. Thus, the optimal results are determined by the Nash equilibrium point of this game. Then the iterative algorithm is introduced to seek the Nash equilibrium point. Simulation and analysis are given to demonstrate the feasibility and availability of the model. 相似文献
8.
保险中小样本信息处理的非均匀信息扩散法 总被引：1，自引：0，他引：1
When analyzing and evaluating risks in insurance, people are often confronted with the situation of incomplete information and insufficient data, which is known as a small-sample problem. In this paper, a one-dimensional small-sample problem in insurance was investigated using the kernel density estimation method （KerM） and general limited information diffusion method （GIDM）. In particular, MacCormack technique was applied to get the solutions of GIDM equations and then the optimal diffusion solution was acquired based on the two optimization principles. Finally, the analysis introduced in this paper was verified by treating some examples and satisfying results were obtained. 相似文献
9.
The batch extractive distillation (BED) process has the advantages of both batch and extractive distillation. It is one of the most promising means for the separation of azeotropic and close-boiling point systems. However, so far this process has not been applied in industry due to its over-complexity. A new shortcut model was proposed to simulate the operation of the batch extractive distillation operations. This algorithm is based on the assumption that the batch extractive distillation column can be considered as a continuous extractive distillation column with changing feed at any time. Namely, the whole batch process is simulated as a succession of a finite number of steady states of short duration, in which holdup is considered as constant mole. For each period of time the batch extractive distillation process is solved through the algorithm for continuous extractive distillation. Finally, the practical implementation of the shortcut model is discussed and data from the laboratory and literature are presented. It is found that this model has better adaptability, more satisfactory accuracy and less calculative load than previous rigorous model. Hence the algorithm for simulating BED is verified. 相似文献
10.
We consider a scheduling problem involving a single processor utilized by two customers with constant deteriorating jobs,i.e.,jobs whose processing times are an increasing function of their starting times.Traditionally,such scenarios are modeled by assuming that each customer has the same criterion.In practice,this assumption may not hold.Instead of using a single criterion,we examine the implications of minimizing an aggregate scheduling objective function in which jobs belonging to different customers are evaluated with their individual criteria.We examine three basic scheduling criteria:minimizing makespan,minimizing maximum lateness,and minimizing total weighted completion time.We demonstrate all the scheduling problems considered are polynomially solvable. 相似文献
11.
曹国梅 《常熟理工学院学报》2009,23(4):22-24
考虑极小化加权总完工时间的一类无界的不相容工件族分批排序问题,给出了最优排序的性质和算法,并加以证明．对工件有k个到达时间的情形,给出了一个复杂性为D（2^k-1nlogn）的启发式算法． 相似文献
12.
考虑了两台同类机极小化总完工时间的分批排序问题,给出了计算复杂性为O(n3)的动态规划算法,并将此算法推广到了工件具有学习效应的情况. 相似文献
13.
与开工时间有关的加工时间的超前有奖迟后受罚的排序问题的动态规划算法 总被引：1，自引：0，他引：1
In this paper, a single-machine scheduling model with a given common due date is considered. Job processing time is a linear decreasing function of its starting time. The objective function is to minimize the total weighted earliness award and tardiness penalty. Our aim is to find an optimal schedule so as to minimize the objective function. As the problem is NP-hard, some properties and polynomial time solvable cases of this problem are given. A dynamic programming algorithm for the general case of the problem is provided. 相似文献
14.
15.
A developmental review of response time data that support a cognitive components model of reading 总被引：2，自引：0，他引：2
The present article provides a review of numerous studies that measured response times for cognitive tasks related to six components of the reading process. The component processes were single-letter recognition, multi-letter unit identification, word and pseudoword identification, semantic access/concept activation, phrase and sentence comprehension, and text comprehension. The response time data are presented in tables and summarized in the text. The data provide support for a componential view of reading. 相似文献
16.
提出一种带有配送时间的单机排序问题,配送时间具有学习效应,目标为极小化总配送完成时间.证明了两个特殊情形下的最优序;分析一般情形下排序问题的性质,并由此得到一致性条件下该问题的最优序. 相似文献
17.
在现代生产管理中,合理安排工件的加工顺序使所有的工件准时完工极为重要．文中研究工件不允许拖期的单机分批调度问题,目标是使加工．总成本最小,目标函数不仅考虑了工件提前完工有提前惩罚成本,还考虑了批加工成本费用．提出了一种多项式时间的最优算法． 相似文献